{"id":"https://openalex.org/W2101051966","doi":"https://doi.org/10.1109/tpds.2002.1011417","title":"Low-cost task scheduling for distributed-memory machines","display_name":"Low-cost task scheduling for distributed-memory machines","publication_year":2002,"publication_date":"2002-06-01","ids":{"openalex":"https://openalex.org/W2101051966","doi":"https://doi.org/10.1109/tpds.2002.1011417","mag":"2101051966"},"language":"en","primary_location":{"id":"doi:10.1109/tpds.2002.1011417","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2002.1011417","pdf_url":null,"source":{"id":"https://openalex.org/S97130795","display_name":"IEEE Transactions on Parallel and Distributed Systems","issn_l":"1045-9219","issn":["1045-9219","1558-2183","2161-9883"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Parallel and Distributed 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":"https://openalex.org/A5033443273","display_name":"A. R\u0103dulescu","orcid":null},"institutions":[{"id":"https://openalex.org/I1329325741","display_name":"Philips (Finland)","ror":"https://ror.org/01g4jev56","country_code":"FI","type":"company","lineage":["https://openalex.org/I1329325741","https://openalex.org/I4210122849"]},{"id":"https://openalex.org/I4210122849","display_name":"Philips (Netherlands)","ror":"https://ror.org/02p2bgp27","country_code":"NL","type":"company","lineage":["https://openalex.org/I4210122849"]}],"countries":["FI","NL"],"is_corresponding":true,"raw_author_name":"A. Radulescu","raw_affiliation_strings":["Philips Research Laboratories, Eindhoven, Netherlands","Philips' Research Laboratories, Eindhoven-Netherlands"],"affiliations":[{"raw_affiliation_string":"Philips Research Laboratories, Eindhoven, Netherlands","institution_ids":["https://openalex.org/I4210122849"]},{"raw_affiliation_string":"Philips' Research Laboratories, Eindhoven-Netherlands","institution_ids":["https://openalex.org/I1329325741"]}]},{"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":"A.J.C. van Gemund","raw_affiliation_strings":["Delft University of Technnology, Netherlands","[Delft University of Technnology, Netherlands]"],"affiliations":[{"raw_affiliation_string":"Delft University of Technnology, Netherlands","institution_ids":["https://openalex.org/I98358874"]},{"raw_affiliation_string":"[Delft University of Technnology, Netherlands]","institution_ids":["https://openalex.org/I98358874"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5033443273"],"corresponding_institution_ids":["https://openalex.org/I1329325741","https://openalex.org/I4210122849"],"apc_list":null,"apc_paid":null,"fwci":5.3111,"has_fulltext":false,"cited_by_count":91,"citation_normalized_percentile":{"value":0.96309853,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"13","issue":"6","first_page":"648","last_page":"658"},"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.9994000196456909,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9955000281333923,"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.8569674491882324},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.6823381185531616},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.6201090812683105},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.6038873195648193},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.5866544246673584},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.5826700925827026},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.571921169757843},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5591628551483154},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.5436671376228333},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.45586490631103516},{"id":"https://openalex.org/keywords/critical-path-method","display_name":"Critical path method","score":0.42321428656578064},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4070833921432495},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.39056211709976196},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.344548761844635},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.17076483368873596},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07475748658180237},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.06909456849098206}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8569674491882324},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.6823381185531616},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.6201090812683105},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.6038873195648193},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.5866544246673584},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.5826700925827026},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.571921169757843},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5591628551483154},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.5436671376228333},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.45586490631103516},{"id":"https://openalex.org/C115874739","wikidata":"https://www.wikidata.org/wiki/Q825377","display_name":"Critical path method","level":2,"score":0.42321428656578064},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4070833921432495},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.39056211709976196},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.344548761844635},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.17076483368873596},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07475748658180237},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.06909456849098206},{"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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tpds.2002.1011417","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2002.1011417","pdf_url":null,"source":{"id":"https://openalex.org/S97130795","display_name":"IEEE Transactions on Parallel and Distributed Systems","issn_l":"1045-9219","issn":["1045-9219","1558-2183","2161-9883"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Parallel and Distributed Systems","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.13.3181","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.3181","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://rama.pds.twi.tudelft.nl/~gemund/Publications/tpds02.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W1549134103","https://openalex.org/W1632514893","https://openalex.org/W1961360692","https://openalex.org/W1969571387","https://openalex.org/W1973531467","https://openalex.org/W1982602839","https://openalex.org/W1997066004","https://openalex.org/W2011039300","https://openalex.org/W2023753260","https://openalex.org/W2031415642","https://openalex.org/W2053787404","https://openalex.org/W2057108708","https://openalex.org/W2065689629","https://openalex.org/W2074464226","https://openalex.org/W2077941545","https://openalex.org/W2081283714","https://openalex.org/W2084606150","https://openalex.org/W2096363371","https://openalex.org/W2097911714","https://openalex.org/W2098464112","https://openalex.org/W2104680817","https://openalex.org/W2107351313","https://openalex.org/W2110417760","https://openalex.org/W2113486250","https://openalex.org/W2118396891","https://openalex.org/W2125412556","https://openalex.org/W2129403399","https://openalex.org/W2135449963","https://openalex.org/W2151038512","https://openalex.org/W2164631467","https://openalex.org/W2169560887","https://openalex.org/W2546370205","https://openalex.org/W2581172100","https://openalex.org/W2798909945","https://openalex.org/W3137896427","https://openalex.org/W4236679282"],"related_works":["https://openalex.org/W4300092030","https://openalex.org/W1545991362","https://openalex.org/W2184166483","https://openalex.org/W3184267879","https://openalex.org/W2167574351","https://openalex.org/W2404383452","https://openalex.org/W2545511463","https://openalex.org/W1935185185","https://openalex.org/W2557471897","https://openalex.org/W2912206708"],"abstract_inverted_index":{"In":[0,50],"compile-time":[1],"task":[2,110],"scheduling":[3,8,57,153],"for":[4,98],"distributed-memory":[5],"systems,":[6],"list":[7,56,152],"is":[9,78,92],"generally":[10],"accepted":[11],"as":[12,161,216,241],"an":[13,135],"attractive":[14],"approach,":[15],"since":[16],"it":[17,81,126],"pairs":[18],"low":[19,90],"cost":[20,69],"with":[21,58,154,221],"good":[22],"results.":[23],"List-scheduling":[24],"algorithms":[25,159,185,210,233],"schedule":[26],"tasks":[27],"in":[28,103,116,234],"order":[29],"of":[30,137,147,151,182,207,238],"their":[31,191],"priority.":[32],"This":[33],"priority":[34],"can":[35,62,82,141],"be":[36,63,83],"computed":[37],"either":[38],"(1)":[39],"statically,":[40],"before":[41],"the":[42,48,99,113,117,128,144,179,183,204,208,235],"scheduling,":[43],"or":[44],"(2)":[45],"dynamically,":[46],"during":[47],"scheduling.":[49],"this":[51,138],"paper,":[52],"we":[53,140],"show":[54,202],"that":[55,178,203],"statically-computed":[59],"priorities":[60,156],"(LSSP)":[61],"performed":[64],"at":[65,195],"a":[66,148,187,196],"significantly":[67,197],"lower":[68,198],"than":[70],"existing":[71],"approaches,":[72],"without":[73],"sacrificing":[74],"performance.":[75],"Our":[76,175],"approach":[77],"general,":[79],"i.e.":[80,106],"applied":[84],"to":[85,127,190],"any":[86],"LSSP":[87],"algorithm.":[88,133],"The":[89],"complexity":[91,146,229],"achieved":[93],"by":[94,124],"using":[95],"low-complexity":[96],"methods":[97],"most":[100],"time-consuming":[101],"parts":[102],"list-scheduling":[104,184,209],"algorithms,":[105,214],"processor":[107],"selection":[108],"and":[109,170,230],"selection,":[111],"preserving":[112],"criteria":[114],"used":[115],"original":[118,192],"algorithms.":[119],"We":[120,200],"exemplify":[121],"our":[122],"method":[123],"applying":[125],"MCP":[129],"(Modified":[130],"Critical":[131],"Path)":[132],"Using":[134],"extension":[136],"method,":[139],"also":[142,201,226],"reduce":[143],"time":[145],"particular":[149],"class":[150,237],"dynamic":[155],"(LSDP)":[157],"[including":[158],"such":[160,215,240],"DLS":[162],"(Dynamic":[163,218],"Level":[164],"Scheduling),":[165],"ETF":[166],"(Earliest":[167,172],"Task":[168],"First)":[169],"ERT":[171],"Ready":[173],"Task)].":[174],"results":[176],"confirm":[177],"modified":[180,205],"versions":[181,206],"obtain":[186],"performance":[188],"comparable":[189],"versions,":[193],"yet":[194],"cost.":[199],"consistently":[211],"outperform":[212,232],"multi-step":[213],"DSC-LLB":[217],"Sequence":[219],"Clustering":[220],"List":[222],"Load":[223],"Balancing),":[224],"which":[225],"have":[227],"higher":[228],"clearly":[231],"same":[236],"complexity,":[239],"CPM":[242],"(Critical":[243],"Path":[244],"Method).":[245]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":9}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}