{"id":"https://openalex.org/W2072687243","doi":"https://doi.org/10.1145/1248377.1248384","title":"Scheduling DAGs on asynchronous processors","display_name":"Scheduling DAGs on asynchronous processors","publication_year":2007,"publication_date":"2007-06-09","ids":{"openalex":"https://openalex.org/W2072687243","doi":"https://doi.org/10.1145/1248377.1248384","mag":"2072687243"},"language":"en","primary_location":{"id":"doi:10.1145/1248377.1248384","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1248377.1248384","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures","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/A5068761590","display_name":"Michael A. Bender","orcid":"https://orcid.org/0000-0001-7639-530X"},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael A. Bender","raw_affiliation_strings":["Stony Brook University, Stony Brook, NY"],"affiliations":[{"raw_affiliation_string":"Stony Brook University, Stony Brook, NY","institution_ids":["https://openalex.org/I59553526"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035120984","display_name":"Cynthia A. Phillips","orcid":"https://orcid.org/0000-0001-7348-9079"},"institutions":[{"id":"https://openalex.org/I4210104735","display_name":"Sandia National Laboratories","ror":"https://ror.org/01apwpt12","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I198811213","https://openalex.org/I4210104735"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Cynthia A. Phillips","raw_affiliation_strings":["Sandia National Laboratories, Albuquerque, NM"],"affiliations":[{"raw_affiliation_string":"Sandia National Laboratories, Albuquerque, NM","institution_ids":["https://openalex.org/I4210104735"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5068761590"],"corresponding_institution_ids":["https://openalex.org/I59553526"],"apc_list":null,"apc_paid":null,"fwci":5.0843,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.94373159,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"35","last_page":"45"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9983999729156494,"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.9980000257492065,"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/asynchronous-communication","display_name":"Asynchronous communication","score":0.8303608894348145},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.824001133441925},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.7135417461395264},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6249093413352966},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5765985250473022},{"id":"https://openalex.org/keywords/adversary","display_name":"Adversary","score":0.570393979549408},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.5085841417312622},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.46996113657951355},{"id":"https://openalex.org/keywords/asynchrony","display_name":"Asynchrony (computer programming)","score":0.46051278710365295},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1729315221309662},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1681877076625824},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11126729846000671},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.07100263237953186},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.0702781081199646}],"concepts":[{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.8303608894348145},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.824001133441925},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.7135417461395264},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6249093413352966},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5765985250473022},{"id":"https://openalex.org/C41065033","wikidata":"https://www.wikidata.org/wiki/Q2825412","display_name":"Adversary","level":2,"score":0.570393979549408},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.5085841417312622},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.46996113657951355},{"id":"https://openalex.org/C2779019669","wikidata":"https://www.wikidata.org/wiki/Q25203946","display_name":"Asynchrony (computer programming)","level":3,"score":0.46051278710365295},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1729315221309662},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1681877076625824},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11126729846000671},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.07100263237953186},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.0702781081199646},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1248377.1248384","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1248377.1248384","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.173.8166","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.173.8166","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.sunysb.edu/%7Ebender/newpub/BenderPh07.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.390.3208","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.390.3208","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ce.sharif.ac.ir/~ghodsi/archive/d-papers/SPAA/2007/Approximation algorithms for multiprocessor scheduling under uncertainty.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.6800000071525574,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W227145363","https://openalex.org/W1539676025","https://openalex.org/W1558008742","https://openalex.org/W1669554023","https://openalex.org/W1690788913","https://openalex.org/W1693740679","https://openalex.org/W1965765215","https://openalex.org/W1966146851","https://openalex.org/W1981626879","https://openalex.org/W1982315584","https://openalex.org/W2010152470","https://openalex.org/W2012472438","https://openalex.org/W2012989825","https://openalex.org/W2022642396","https://openalex.org/W2023114553","https://openalex.org/W2025268357","https://openalex.org/W2026015769","https://openalex.org/W2041645051","https://openalex.org/W2056473617","https://openalex.org/W2057392949","https://openalex.org/W2057933312","https://openalex.org/W2058886099","https://openalex.org/W2060591840","https://openalex.org/W2064073280","https://openalex.org/W2066067999","https://openalex.org/W2067522613","https://openalex.org/W2067753820","https://openalex.org/W2072725684","https://openalex.org/W2103363198","https://openalex.org/W2104680817","https://openalex.org/W2111996486","https://openalex.org/W2113347691","https://openalex.org/W2130566259","https://openalex.org/W2144407406","https://openalex.org/W2154492588","https://openalex.org/W2165606466","https://openalex.org/W2173994910","https://openalex.org/W2607875432","https://openalex.org/W2764956387"],"related_works":["https://openalex.org/W2534656837","https://openalex.org/W2374603670","https://openalex.org/W2061653780","https://openalex.org/W4300245965","https://openalex.org/W2414929729","https://openalex.org/W2585854369","https://openalex.org/W2944915449","https://openalex.org/W2102266661","https://openalex.org/W2122229220","https://openalex.org/W4283014255"],"abstract_inverted_index":{"This":[0],"paper":[1],"addresses":[2],"the":[3,28,32,36,51,80],"problem":[4],"of":[5,9,75,79],"scheduling":[6,81],"a":[7],"DAG":[8],"unit-length":[10],"tasks":[11],"on":[12],"asynchronous":[13],"processors,":[14],"that":[15,30],"is,":[16,31],"processors":[17],"having":[18],"different":[19],"and":[20,67],"changing":[21],"speeds.":[22],"The":[23,59],"objective":[24],"is":[25,40,47],"to":[26,34,49],"minimize":[27],"makespan,":[29],"time":[33],"execute":[35],"entire":[37],"DAG.":[38],"Asynchrony":[39],"modeled":[41],"by":[42],"an":[43],"oblivious":[44,60],"adversary,":[45],"which":[46],"assumed":[48],"determine":[50],"processor":[52,64],"speeds":[53,65],"at":[54],"each":[55],"point":[56],"in":[57],"time.":[58],"adversary":[61],"may":[62],"change":[63],"arbitrarily":[66,68],"often,":[69],"but":[70],"makes":[71],"speed":[72],"decisions":[73],"independently":[74],"any":[76],"random":[77],"choices":[78],"algorithm.":[82]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}