{"id":"https://openalex.org/W2139885350","doi":"https://doi.org/10.1080/019697297125921","title":"A COMPARISON OF LIST SCHEDULING HEURISTICS FOR COMMUNICATION INTENSIVE TASK GRAPHS","display_name":"A COMPARISON OF LIST SCHEDULING HEURISTICS FOR COMMUNICATION INTENSIVE TASK GRAPHS","publication_year":1997,"publication_date":"1997-10-01","ids":{"openalex":"https://openalex.org/W2139885350","doi":"https://doi.org/10.1080/019697297125921","mag":"2139885350"},"language":"en","primary_location":{"id":"doi:10.1080/019697297125921","is_oa":false,"landing_page_url":"https://doi.org/10.1080/019697297125921","pdf_url":null,"source":{"id":"https://openalex.org/S117436046","display_name":"Cybernetics & Systems","issn_l":"0196-9722","issn":["0196-9722","1087-6553"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Cybernetics and Systems","raw_type":"journal-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":null,"display_name":"BENJAMIN S. MACEY AND ALBERT Y. ZOM","orcid":null},"institutions":[{"id":"https://openalex.org/I880766802","display_name":"Graduate School USA","ror":"https://ror.org/04n835f38","country_code":"US","type":"education","lineage":["https://openalex.org/I880766802"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"BENJAMIN S. MACEY AND ALBERT Y. ZOM","raw_affiliation_strings":["Graduate Research School"],"affiliations":[{"raw_affiliation_string":"Graduate Research School","institution_ids":["https://openalex.org/I880766802"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I880766802"],"apc_list":null,"apc_paid":null,"fwci":1.0147,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.82477378,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"28","issue":"7","first_page":"535","last_page":"546"},"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.9987000226974487,"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.9987000226974487,"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.9926999807357788,"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/T12288","display_name":"Optimization and Search Problems","score":0.9799000024795532,"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.8434611558914185},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8228132724761963},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6078163981437683},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.5706489086151123},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5380235910415649},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5284552574157715},{"id":"https://openalex.org/keywords/homogeneous","display_name":"Homogeneous","score":0.5147664546966553},{"id":"https://openalex.org/keywords/critical-path-method","display_name":"Critical path method","score":0.4917905628681183},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.42956024408340454},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.22818875312805176},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18300428986549377},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11076298356056213},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.08871108293533325}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8434611558914185},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8228132724761963},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6078163981437683},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.5706489086151123},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5380235910415649},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5284552574157715},{"id":"https://openalex.org/C66882249","wikidata":"https://www.wikidata.org/wiki/Q169336","display_name":"Homogeneous","level":2,"score":0.5147664546966553},{"id":"https://openalex.org/C115874739","wikidata":"https://www.wikidata.org/wiki/Q825377","display_name":"Critical path method","level":2,"score":0.4917905628681183},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.42956024408340454},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.22818875312805176},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18300428986549377},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11076298356056213},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.08871108293533325},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/019697297125921","is_oa":false,"landing_page_url":"https://doi.org/10.1080/019697297125921","pdf_url":null,"source":{"id":"https://openalex.org/S117436046","display_name":"Cybernetics & Systems","issn_l":"0196-9722","issn":["0196-9722","1087-6553"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Cybernetics and Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2280422768","https://openalex.org/W2363460986","https://openalex.org/W609318495","https://openalex.org/W2376229137","https://openalex.org/W1501193936","https://openalex.org/W2262854793","https://openalex.org/W2379237800","https://openalex.org/W2760702716","https://openalex.org/W3011701302","https://openalex.org/W2386584920"],"abstract_inverted_index":{"Abstract":[0],"List-based":[1],"priority":[2],"schedulers":[3],"have":[4,16],"long":[5],"been":[6,17],"the":[7,21,52,86],"dominant":[8],"class":[9],"of":[10,33,36,42,51,99,119,132],"static":[11],"scheduling":[12,56],"algorithms.":[13],"Such":[14],"heuristics":[15,101,127],"predominantly":[18],"based":[19],"on":[20,115],"''critical":[22],"path,":[23],"most":[24],"immediate":[25],"successors":[26],"first''":[27],"CP":[28],"MISF":[29],"priority.":[30],"The":[31],"ability":[32],"this":[34,48],"type":[35],"scheduler":[37],"to":[38,67,102],"handle":[39],"increased":[40],"levels":[41],"communication":[43,133],"overhead":[44],"is":[45,91],"examined":[46],"in":[47,76],"paper.":[49],"Three":[50],"more":[53],"popular":[54],"list":[55],"heuristics,":[57],"Hu's":[58],"LSH":[59],"and":[60,63,135],"Kruatrachue's":[61],"ISH":[62],"DSH,":[64],"are":[65],"subjected":[66],"a":[68,80,97,104],"performance-based":[69],"comparison,":[70],"with":[71,128],"results":[72],"demonstrating":[73],"their":[74],"inadequacies":[75],"communication-intensive":[77],"cases.":[78],"WINSCHED,":[79],"Microsoft":[81],"Windows":[82],"tool":[83],"developed":[84],"by":[85],"Parallel":[87],"Computing":[88],"Research":[89],"Laboratory,":[90],"also":[92],"briefly":[93],"presented.":[94],"WINSCHED":[95],"uses":[96],"number":[98,118],"list-based":[100],"schedule":[103],"parallel":[105,121],"program":[106],"represented":[107],"as":[108],"an":[109,116],"enhanced":[110],"directed":[111],"acyclic":[112],"graph":[113],"EDAG":[114],"arbitrary":[117],"homogeneous":[120],"processors.":[122],"It":[123],"supports":[124],"six":[125,137],"distinct":[126],"or":[129],"without":[130],"consideration":[131],"costs":[134],"has":[136],"interconnection":[138],"topologies":[139],"built":[140],"in.":[141]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-16T08:26:57.006410","created_date":"2016-06-24T00:00:00"}