{"id":"https://openalex.org/W2103366467","doi":"https://doi.org/10.1109/hpcsim.2011.5999814","title":"A data-aware workflow scheduling algorithm for heterogeneous distributed systems","display_name":"A data-aware workflow scheduling algorithm for heterogeneous distributed systems","publication_year":2011,"publication_date":"2011-07-01","ids":{"openalex":"https://openalex.org/W2103366467","doi":"https://doi.org/10.1109/hpcsim.2011.5999814","mag":"2103366467"},"language":"en","primary_location":{"id":"doi:10.1109/hpcsim.2011.5999814","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcsim.2011.5999814","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 International Conference on High Performance Computing &amp; Simulation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040707086","display_name":"Dengpan Yin","orcid":null},"institutions":[{"id":"https://openalex.org/I121820613","display_name":"Louisiana State University","ror":"https://ror.org/05ect4e57","country_code":"US","type":"education","lineage":["https://openalex.org/I121820613"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dengpan Yin","raw_affiliation_strings":["Department of Computer Science, Louisiana State University, Baton Rouge, LA, USA","Department of Computer Science, Louisiana State University, Baton Rouge, LA 70803"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Louisiana State University, Baton Rouge, LA, USA","institution_ids":["https://openalex.org/I121820613"]},{"raw_affiliation_string":"Department of Computer Science, Louisiana State University, Baton Rouge, LA 70803","institution_ids":["https://openalex.org/I121820613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069324928","display_name":"Tevfik Kosar","orcid":"https://orcid.org/0000-0002-5600-6706"},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]},{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tevfik Kosar","raw_affiliation_strings":["Department of Computer Science & Engineering, State University of New York, University at Buffalo, Buffalo, NY, USA","Dept. of Computer science and Engineering, University at Buffalo, SUNY, Buffalo, NY 14260"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering, State University of New York, University at Buffalo, Buffalo, NY, USA","institution_ids":["https://openalex.org/I63190737","https://openalex.org/I57206974"]},{"raw_affiliation_string":"Dept. of Computer science and Engineering, University at Buffalo, SUNY, Buffalo, NY 14260","institution_ids":["https://openalex.org/I63190737"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5040707086"],"corresponding_institution_ids":["https://openalex.org/I121820613"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.17299904,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"78","issue":null,"first_page":"114","last_page":"120"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9876000285148621,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8550834655761719},{"id":"https://openalex.org/keywords/workflow","display_name":"Workflow","score":0.7560862302780151},{"id":"https://openalex.org/keywords/turnaround-time","display_name":"Turnaround time","score":0.6751039624214172},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5911503434181213},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5769433379173279},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.551489531993866},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4793006479740143},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.45571044087409973},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.43693360686302185},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41068172454833984},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.1332933008670807},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.12489345669746399}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8550834655761719},{"id":"https://openalex.org/C177212765","wikidata":"https://www.wikidata.org/wiki/Q627335","display_name":"Workflow","level":2,"score":0.7560862302780151},{"id":"https://openalex.org/C176553487","wikidata":"https://www.wikidata.org/wiki/Q7855819","display_name":"Turnaround time","level":2,"score":0.6751039624214172},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5911503434181213},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5769433379173279},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.551489531993866},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4793006479740143},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.45571044087409973},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.43693360686302185},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41068172454833984},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.1332933008670807},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.12489345669746399},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpcsim.2011.5999814","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcsim.2011.5999814","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 International Conference on High Performance Computing &amp; Simulation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W120471740","https://openalex.org/W1571991012","https://openalex.org/W2010868970","https://openalex.org/W2024790103","https://openalex.org/W2034319651","https://openalex.org/W2063169100","https://openalex.org/W2074687748","https://openalex.org/W2099389501","https://openalex.org/W2112998751","https://openalex.org/W2119101832","https://openalex.org/W2150532704","https://openalex.org/W2164340292","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2613195858","https://openalex.org/W2184166483","https://openalex.org/W2397293317","https://openalex.org/W2377713709","https://openalex.org/W2373973180","https://openalex.org/W2372008037","https://openalex.org/W2978148977","https://openalex.org/W3003077338","https://openalex.org/W2225350526","https://openalex.org/W2281029826"],"abstract_inverted_index":{"The":[0,28,132],"workflow":[1,70,106,141],"scheduling":[2,46,62],"problem":[3,47],"in":[4,80,86],"heterogeneous":[5],"distributed":[6,35],"systems":[7],"is":[8,71],"hard":[9],"to":[10,13,58,94,124,151],"solve":[11,95],"due":[12],"both":[14,81],"intermediate":[15,122],"data":[16,109,113,123,127],"transfer":[17],"time":[18,22,67,84,138],"and":[19,38,83,118],"the":[20,31,39,45,60,65,69,77,96,105,130,136,140,152],"computation":[21],"for":[23],"each":[24,102],"task":[25,103],"being":[26],"considered.":[27],"heterogeneity":[29],"of":[30,34,68,104,139],"computing":[32],"power":[33],"computational":[36],"sites":[37],"band":[40],"width":[41],"between":[42],"them":[43],"makes":[44],"challenging.":[48],"In":[49,99],"this":[50,100],"study,":[51],"we":[52],"improve":[53],"a":[54,111,125],"heuristic-based":[55],"data-aware":[56,148],"algorithm":[57,75,93,149],"find":[59],"optimal":[61,154],"so":[63],"that":[64,135],"turnaround":[66,137],"minimized.":[72],"Our":[73],"improved":[74],"outperforms":[76],"existing":[78,153],"algorithms":[79],"performance":[82],"efficiency":[85],"most":[87],"cases.":[88],"We":[89],"also":[90,119],"extend":[91],"our":[92,147],"co-scheduling":[97],"problem.":[98],"problem,":[101],"can":[107,142],"request":[108],"from":[110],"remote":[112,126],"site":[114,128],"before":[115],"its":[116],"execution;":[117],"store":[120],"important":[121],"after":[129],"execution.":[131],"results":[133],"show":[134],"be":[143],"shortened":[144],"significantly":[145],"using":[146],"compared":[150],"algorithms.":[155]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
