{"id":"https://openalex.org/W1982602839","doi":"https://doi.org/10.1145/305138.305162","title":"On the complexity of list scheduling algorithms for distributed-memory systems","display_name":"On the complexity of list scheduling algorithms for distributed-memory systems","publication_year":1999,"publication_date":"1999-05-01","ids":{"openalex":"https://openalex.org/W1982602839","doi":"https://doi.org/10.1145/305138.305162","mag":"1982602839"},"language":"en","primary_location":{"id":"doi:10.1145/305138.305162","is_oa":true,"landing_page_url":"https://doi.org/10.1145/305138.305162","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/305138.305162","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 13th international conference on Supercomputing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/305138.305162","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033443273","display_name":"A. R\u0103dulescu","orcid":null},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Andrei R\u0103dulescu","raw_affiliation_strings":["Delft University of Technology, P.O. Box 5031, 2600 GA Delft, The Netherlands","Delft University of Technology, P.O. Box 5031, 2600 GA Delft, The Netherlands#TAB#"],"affiliations":[{"raw_affiliation_string":"Delft University of Technology, P.O. Box 5031, 2600 GA Delft, The Netherlands","institution_ids":["https://openalex.org/I98358874"]},{"raw_affiliation_string":"Delft University of Technology, P.O. Box 5031, 2600 GA Delft, The Netherlands#TAB#","institution_ids":["https://openalex.org/I98358874"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084609766","display_name":"Arjan J. C. van Gemund","orcid":null},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Arjan J. C. van Gemund","raw_affiliation_strings":["Delft University of Technology, P.O. Box 5031, 2600 GA Delft, The Netherlands","Delft University of Technology, P.O. Box 5031, 2600 GA Delft, The Netherlands#TAB#"],"affiliations":[{"raw_affiliation_string":"Delft University of Technology, P.O. Box 5031, 2600 GA Delft, The Netherlands","institution_ids":["https://openalex.org/I98358874"]},{"raw_affiliation_string":"Delft University of Technology, P.O. Box 5031, 2600 GA Delft, The Netherlands#TAB#","institution_ids":["https://openalex.org/I98358874"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5033443273"],"corresponding_institution_ids":["https://openalex.org/I98358874"],"apc_list":null,"apc_paid":null,"fwci":2.8231,"has_fulltext":true,"cited_by_count":69,"citation_normalized_percentile":{"value":0.91366343,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"68","last_page":"75"},"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.9998999834060669,"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.9998999834060669,"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/T12288","display_name":"Optimization and Search Problems","score":0.9986000061035156,"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.9983000159263611,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6124042868614197},{"id":"https://openalex.org/keywords/citation","display_name":"Citation","score":0.5837392210960388},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35783132910728455},{"id":"https://openalex.org/keywords/library-science","display_name":"Library science","score":0.2760111689567566}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6124042868614197},{"id":"https://openalex.org/C2778805511","wikidata":"https://www.wikidata.org/wiki/Q1713","display_name":"Citation","level":2,"score":0.5837392210960388},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35783132910728455},{"id":"https://openalex.org/C161191863","wikidata":"https://www.wikidata.org/wiki/Q199655","display_name":"Library science","level":1,"score":0.2760111689567566}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/305138.305162","is_oa":true,"landing_page_url":"https://doi.org/10.1145/305138.305162","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/305138.305162","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 13th international conference on Supercomputing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.35.3349","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.3349","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cardit.et.tudelft.nl/~andrei/professional/../papers/ICS-99.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.42.8626","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.8626","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cardit.et.tudelft.nl/~andrei/professional/../papers/TR-02-99.ps.gz","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1145/305138.305162","is_oa":true,"landing_page_url":"https://doi.org/10.1145/305138.305162","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/305138.305162","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 13th international conference on Supercomputing","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Partnerships for the goals","score":0.5199999809265137,"id":"https://metadata.un.org/sdg/17"}],"awards":[{"id":"https://openalex.org/G629491556","display_name":null,"funder_award_id":"(NWO)","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1982602839.pdf","grobid_xml":"https://content.openalex.org/works/W1982602839.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W1549134103","https://openalex.org/W2011039300","https://openalex.org/W2031415642","https://openalex.org/W2065689629","https://openalex.org/W2077941545","https://openalex.org/W2096363371","https://openalex.org/W2104680817","https://openalex.org/W2107351313","https://openalex.org/W2118396891","https://openalex.org/W2151038512","https://openalex.org/W2541367100"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,13,18,47,68,98],"novel":[4],"heuristic,":[5],"called":[6],"Fast":[7],"Critical":[8],"Path":[9],"(FCP),":[10],"intended":[11],"as":[12,64],"compile-time":[14],"scheduling":[15,26,148],"algorithm":[16],"on":[17],"distributed-memory":[19],"system.":[20],"While":[21],"similar":[22],"to":[23,75,84,106,145],"existing":[24,146],"list":[25,147],"algorithms,":[27],"FCP":[28,142],"has":[29],"two":[30],"important":[31],"differences:":[32],"(a)":[33],"it":[34],"does":[35],"not":[36],"sort":[37],"all":[38,62],"the":[39,42,71,77,81,85,90,95,100,117,124,131],"tasks":[40,51,120],"at":[41,53],"beginning":[43],"but":[44],"maintains":[45],"only":[46],"limited":[48],"number":[49,118,132],"of":[50,60,119,133,150],"sorted":[52],"any":[54],"given":[55,69,86],"time,":[56],"and":[57,114,121,128,139],"(b)":[58],"instead":[59],"considering":[61],"processors":[63],"possible":[65],"target":[66],"for":[67],"task,":[70],"choice":[72],"is":[73,103,130],"restricted":[74],"either":[76],"processor":[78,91],"from":[79],"which":[80,92],"last":[82],"messages":[83],"task":[87,125],"arrives":[88],"or":[89],"becomes":[93],"idle":[94],"earliest.":[96],"As":[97],"result,":[99],"time":[101],"complexity":[102],"drastically":[104],"reduced":[105],"O(V":[107],"log":[108],"(P)":[109],"+":[110],"E),":[111],"where":[112],"V":[113],"E":[115],"are":[116],"edges":[122],"in":[123],"graph,":[126],"respectively,":[127],"P":[129],"processors.":[134],"We":[135],"demonstrate":[136],"through":[137],"theory":[138],"experiments":[140],"that":[141],"performs":[143],"equally":[144],"algorithms":[149],"much":[151],"higher":[152],"complexity.":[153]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}