{"id":"https://openalex.org/W2100550451","doi":"https://doi.org/10.1109/ipdps.2004.1303065","title":"A hybrid heuristic for DAG scheduling on heterogeneous systems","display_name":"A hybrid heuristic for DAG scheduling on heterogeneous systems","publication_year":2004,"publication_date":"2004-06-10","ids":{"openalex":"https://openalex.org/W2100550451","doi":"https://doi.org/10.1109/ipdps.2004.1303065","mag":"2100550451"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2004.1303065","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2004.1303065","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.","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/A5079821707","display_name":"Rizos Sakellariou","orcid":"https://orcid.org/0000-0002-6104-6649"},"institutions":[{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"R. Sakellariou","raw_affiliation_strings":["Department of Computer Science, University of Manchester, Manchester, USA","Dept. of Comput. Sci., Manchester Univ., UK#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Manchester, Manchester, USA","institution_ids":[]},{"raw_affiliation_string":"Dept. of Comput. Sci., Manchester Univ., UK#TAB#","institution_ids":["https://openalex.org/I28407311"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101334100","display_name":"Henan Zhao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Henan Zhao","raw_affiliation_strings":["Department of Computer Science, University of Manchester, Manchester, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Manchester, Manchester, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5079821707"],"corresponding_institution_ids":["https://openalex.org/I28407311"],"apc_list":null,"apc_paid":null,"fwci":9.0381,"has_fulltext":false,"cited_by_count":296,"citation_normalized_percentile":{"value":0.97983767,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"111","last_page":"123"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":1.0,"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":1.0,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9919999837875366,"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/heuristics","display_name":"Heuristics","score":0.8409849405288696},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7293076515197754},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6524553298950195},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5120211243629456},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.49154672026634216},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47439125180244446},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4511019289493561},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.41803112626075745},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3461529016494751},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17524003982543945},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1650339663028717}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8409849405288696},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7293076515197754},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6524553298950195},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5120211243629456},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.49154672026634216},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47439125180244446},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4511019289493561},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.41803112626075745},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3461529016494751},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17524003982543945},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1650339663028717},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/ipdps.2004.1303065","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2004.1303065","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/828ea6b5-34ea-4b66-a962-c4938bc1e573","is_oa":false,"landing_page_url":"https://research.manchester.ac.uk/en/publications/828ea6b5-34ea-4b66-a962-c4938bc1e573","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Sakellariou, R & Zhao, H 2004, A hybrid heuristic for DAG scheduling on heterogeneous systems. in Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)|Proc. Int. Parall. Distrib. Process. Symp. IPDPS 2004. vol. 18, pp. 1571-1583, Proceedings - 18th International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM), Santa Fe, NM, 1/07/04. https://doi.org/10.1109/IPDPS.2004.1303065","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.121.3069","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.3069","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.man.ac.uk/~rizos/papers/hcw04.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:publications/828ea6b5-34ea-4b66-a962-c4938bc1e573","is_oa":false,"landing_page_url":"https://www.research.manchester.ac.uk/portal/en/publications/a-hybrid-heuristic-for-dag-scheduling-on-heterogeneous-systems(828ea6b5-34ea-4b66-a962-c4938bc1e573).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Sakellariou, R & Zhao, H 2004, A hybrid heuristic for DAG scheduling on heterogeneous systems. in Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)|Proc. Int. Parall. Distrib. Process. Symp. IPDPS 2004. vol. 18, pp. 1571-1583, Proceedings - 18th International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM), Santa Fe, NM, 1/07/04. https://doi.org/10.1109/IPDPS.2004.1303065","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1508297467","https://openalex.org/W1973531467","https://openalex.org/W1982602839","https://openalex.org/W2010868970","https://openalex.org/W2023753260","https://openalex.org/W2025397485","https://openalex.org/W2097911714","https://openalex.org/W2101051966","https://openalex.org/W2131363892","https://openalex.org/W2136294350","https://openalex.org/W2148777733","https://openalex.org/W2149294210","https://openalex.org/W2150055106","https://openalex.org/W2152408640","https://openalex.org/W2170981054","https://openalex.org/W6630438185","https://openalex.org/W6682280461"],"related_works":["https://openalex.org/W2280422768","https://openalex.org/W3143197806","https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W4352977312","https://openalex.org/W1536056491","https://openalex.org/W2041180560"],"abstract_inverted_index":{"Summary":[0],"form":[1],"only":[2],"given.":[3],"This":[4],"paper":[5],"is":[6,50,68],"motivated":[7],"by":[8],"the":[9,16,34,65],"observation":[10],"that":[11],"different":[12],"methods":[13],"to":[14,30],"compute":[15],"weights":[17],"of":[18,56],"nodes":[19],"and":[20],"edges":[21],"when":[22],"scheduling":[23,59],"DAGs":[24],"onto":[25],"heterogeneous":[26],"machines":[27],"may":[28],"lead":[29],"significant":[31],"variations":[32],"in":[33],"generated":[35],"schedule.":[36],"To":[37],"minimize":[38],"such":[39],"variations,":[40],"we":[41],"present":[42],"a":[43,54],"novel":[44,62],"heuristic":[45,63],"for":[46,64],"DAG":[47],"scheduling,":[48],"which":[49],"based":[51],"upon":[52],"solving":[53],"series":[55],"independent":[57],"task":[58],"problems.":[60],"A":[61],"latter":[66],"problem":[67],"also":[69],"included.":[70],"Both":[71],"heuristics":[72],"compare":[73],"favourably":[74],"with":[75],"other":[76],"related":[77],"heuristics.":[78]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":17},{"year":2017,"cited_by_count":17},{"year":2016,"cited_by_count":15},{"year":2015,"cited_by_count":18},{"year":2014,"cited_by_count":24},{"year":2013,"cited_by_count":21},{"year":2012,"cited_by_count":17}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}