{"id":"https://openalex.org/W2159644278","doi":"https://doi.org/10.1109/71.655248","title":"Optimal scheduling algorithm for distributed-memory machines","display_name":"Optimal scheduling algorithm for distributed-memory machines","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W2159644278","doi":"https://doi.org/10.1109/71.655248","mag":"2159644278"},"language":"en","primary_location":{"id":"doi:10.1109/71.655248","doi":"https://doi.org/10.1109/71.655248","is_oa":false,"landing_page_url":"https://doi.org/10.1109/71.655248","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,"listed_in":["ccf-a","cwts-core","dongbi-a","jufo-2","norway-2","poland-140","russia-white-list-1","vabb-shw"],"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"},"volume":null,"type":"article","is_traditional":true,"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/A5043131673","display_name":"Sekhar Darbha","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Darbha","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Rutgers University, Piscataway, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Rutgers University, Piscataway, NJ, USA","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050922407","display_name":"Dharma Prakash Agrawal","orcid":"https://orcid.org/0000-0002-3366-057X","observed_orcids":["https://orcid.org/0000-0002-3366-057X"]},"institutions":[{"id":"https://openalex.org/I137902535","display_name":"North Carolina State University","ror":"https://ror.org/04tj63d06","country_code":"US","type":"education","lineage":["https://openalex.org/I137902535"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D.P. Agrawal","raw_affiliation_strings":["Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC, USA","institution_ids":["https://openalex.org/I137902535"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2645,"currency":"USD","value_usd":2645},"apc_paid":null,"fwci":9.0751,"has_fulltext":false,"cited_by_count":201,"citation_normalized_percentile":{"value":0.97548307,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"9","issue":"1","first_page":"87","last_page":"95"},"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.8310999870300293,"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.8310999870300293,"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.09489999711513519,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.030500000342726707,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/task-scheduling","display_name":"task scheduling","score":0.9919999837875366},{"id":"https://openalex.org/keywords/distributed-memory-systems","display_name":"distributed memory systems","score":0.984000027179718},{"id":"https://openalex.org/keywords/task-duplication","display_name":"task duplication","score":0.8489999771118164},{"id":"https://openalex.org/keywords/directed-acyclic-graphs","display_name":"directed acyclic graphs","score":0.9860000014305115},{"id":"https://openalex.org/keywords/optimal-scheduling","display_name":"scheduling optimization","score":0.5960000157356262},{"id":"https://openalex.org/keywords/interprocessor-communication","display_name":"interprocessor communication","score":0.8479999899864197},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.7609999775886536},{"id":"https://openalex.org/keywords/heuristic-scheduling-algorithm","display_name":"heuristic scheduling algorithm","score":0.6729999780654907},{"id":"https://openalex.org/keywords/schedule-length","display_name":"schedule length","score":0.8009999990463257}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8541989922523499},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.7571792602539062},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5580040812492371},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5053654313087463},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5046647787094116},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.48947036266326904},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46480217576026917},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.443308562040329},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4233602285385132},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4174588620662689},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.19635868072509766},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10794994235038757},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/71.655248","doi":"https://doi.org/10.1109/71.655248","is_oa":false,"landing_page_url":"https://doi.org/10.1109/71.655248","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,"listed_in":["ccf-a","cwts-core","dongbi-a","jufo-2","norway-2","poland-140","russia-white-list-1","vabb-shw"],"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"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320338281","display_name":"Army Research Office","ror":"https://ror.org/05epdh915"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W78787996","https://openalex.org/W330461489","https://openalex.org/W1488422606","https://openalex.org/W1549134103","https://openalex.org/W1603765807","https://openalex.org/W1655990431","https://openalex.org/W1854780351","https://openalex.org/W2019356799","https://openalex.org/W2043331236","https://openalex.org/W2057108708","https://openalex.org/W2071144913","https://openalex.org/W2089265778","https://openalex.org/W2097911714","https://openalex.org/W2125412556","https://openalex.org/W2129902685","https://openalex.org/W2151085839","https://openalex.org/W2157485500","https://openalex.org/W2158923044"],"related_works":["https://openalex.org/W1959344422","https://openalex.org/W2039633770","https://openalex.org/W2129902685","https://openalex.org/W2119174877","https://openalex.org/W1961407660","https://openalex.org/W2613195879","https://openalex.org/W1585978266","https://openalex.org/W2115271961","https://openalex.org/W2109310641","https://openalex.org/W2034632117"],"abstract_inverted_index":{"Task":[0,49],"Scheduling":[1,52],"is":[2,31,70],"one":[3],"of":[4,27,65,73,87,97,121],"the":[5,20,43,71,76,98,122],"key":[6],"elements":[7],"in":[8,42,75,119],"any":[9],"distributed-memory":[10],"machine":[11],"(DMM),":[12],"and":[13,110,125],"an":[14,81],"efficient":[15],"algorithm":[16,54,79,99,126],"can":[17,56],"help":[18],"reduce":[19],"interprocessor":[21],"communication":[22],"time.":[23],"As":[24],"optimal":[25,82],"scheduling":[26,117],"tasks":[28,74],"to":[29,106],"DMMs":[30],"a":[32,48,63,85,91],"strong":[33],"NP-hard":[34],"problem,":[35],"many":[36],"heuristic":[37],"algorithms":[38],"have":[39],"been":[40,101],"introduced":[41],"literature.":[44],"This":[45,78],"paper":[46],"presents":[47],"Duplication":[50],"based":[51],"(TDS)":[53],"which":[55,89],"schedule":[57,83,123],"directed":[58],"acyclic":[59],"graphs":[60],"(DAGs)":[61],"with":[62,114],"complexity":[64],"O(|V|/sup":[66],"2/),":[67],"where":[68],"|V|":[69],"number":[72],"DAG.":[77],"generates":[80],"for":[84],"class":[86],"DAGs":[88],"satisfy":[90],"simple":[92],"cost":[93],"relationship.":[94],"The":[95],"performance":[96],"has":[100],"observed":[102],"by":[103,111],"its":[104],"application":[105],"some":[107],"practical":[108],"DAGs,":[109],"comparing":[112],"it":[113],"other":[115],"existing":[116],"schemes":[118],"terms":[120],"length":[124],"complexity.":[127]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":11},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":11}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2016-06-24T00:00:00"}