{"id":"https://openalex.org/W1980927950","doi":"https://doi.org/10.1145/1400751.1400799","title":"Distributed order scheduling and its application to multi-core dram controllers","display_name":"Distributed order scheduling and its application to multi-core dram controllers","publication_year":2008,"publication_date":"2008-08-18","ids":{"openalex":"https://openalex.org/W1980927950","doi":"https://doi.org/10.1145/1400751.1400799","mag":"1980927950"},"language":"en","primary_location":{"id":"doi:10.1145/1400751.1400799","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1400751.1400799","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing","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/A5041937385","display_name":"Thomas Moscibroda","orcid":"https://orcid.org/0000-0002-8729-7841"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Thomas Moscibroda","raw_affiliation_strings":["Microsoft Research, Redmond, WA, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050695684","display_name":"Onur Mutlu","orcid":"https://orcid.org/0000-0002-0075-2312"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Onur Mutlu","raw_affiliation_strings":["Microsoft Research, Redmond, WA, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5041937385"],"corresponding_institution_ids":["https://openalex.org/I1290206253"],"apc_list":null,"apc_paid":null,"fwci":4.835,"has_fulltext":false,"cited_by_count":61,"citation_normalized_percentile":{"value":0.95165068,"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":"365","last_page":"374"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9995999932289124,"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.9994000196456909,"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.9994000196456909,"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.8258056044578552},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.7429620623588562},{"id":"https://openalex.org/keywords/dram","display_name":"Dram","score":0.7312934398651123},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5262386202812195},{"id":"https://openalex.org/keywords/spec#","display_name":"Spec#","score":0.5246776938438416},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5134854912757874},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4816088378429413},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.45014551281929016},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4311133027076721},{"id":"https://openalex.org/keywords/distributed-memory","display_name":"Distributed memory","score":0.4249938130378723},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4200981557369232},{"id":"https://openalex.org/keywords/shared-memory","display_name":"Shared memory","score":0.2775324583053589},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.2450675666332245},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1524355709552765},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08829498291015625}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8258056044578552},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.7429620623588562},{"id":"https://openalex.org/C7366592","wikidata":"https://www.wikidata.org/wiki/Q1255620","display_name":"Dram","level":2,"score":0.7312934398651123},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5262386202812195},{"id":"https://openalex.org/C2778565505","wikidata":"https://www.wikidata.org/wiki/Q2207566","display_name":"Spec#","level":2,"score":0.5246776938438416},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5134854912757874},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4816088378429413},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.45014551281929016},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4311133027076721},{"id":"https://openalex.org/C91481028","wikidata":"https://www.wikidata.org/wiki/Q1054686","display_name":"Distributed memory","level":3,"score":0.4249938130378723},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4200981557369232},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.2775324583053589},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.2450675666332245},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1524355709552765},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08829498291015625},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1400751.1400799","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1400751.1400799","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.148.506","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.148.506","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.research.microsoft.com/en-us/um/people/moscitho/Publications/podc08.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5299999713897705,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W51599380","https://openalex.org/W169464267","https://openalex.org/W1504046403","https://openalex.org/W1960330418","https://openalex.org/W2012691563","https://openalex.org/W2015082608","https://openalex.org/W2016432178","https://openalex.org/W2016668986","https://openalex.org/W2066503894","https://openalex.org/W2073617099","https://openalex.org/W2075265959","https://openalex.org/W2092252886","https://openalex.org/W2092844320","https://openalex.org/W2098040113","https://openalex.org/W2102871765","https://openalex.org/W2103397328","https://openalex.org/W2115172404","https://openalex.org/W2134633067","https://openalex.org/W2146144806","https://openalex.org/W2146280225","https://openalex.org/W2150196852","https://openalex.org/W2159158649","https://openalex.org/W2162838417","https://openalex.org/W3026610153","https://openalex.org/W4234970223","https://openalex.org/W4236382111","https://openalex.org/W4238816702","https://openalex.org/W4239813889","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W878150521","https://openalex.org/W2008941207","https://openalex.org/W2373662841","https://openalex.org/W1970478390","https://openalex.org/W1533638723","https://openalex.org/W294916044","https://openalex.org/W2131667412","https://openalex.org/W2014546971","https://openalex.org/W2019959197","https://openalex.org/W4365460523"],"abstract_inverted_index":{"We":[0,120,164],"study":[1],"a":[2,26,135,150,167,182,211],"distributed":[3,72,183],"version":[4],"of":[5,20,28,43,47,107,115,129,194,206],"the":[6,71,84,91,102,105,113,116,125,141,145,154,173,204],"order":[7,40,59],"scheduling":[8,13,184],"problem":[9],"that":[10,122,171],"arises":[11],"when":[12,63],"memory":[14],"requests":[15,66,85],"in":[16,140,160,196,210],"shared":[17],"DRAM":[18],"systems":[19],"many-core":[21,212],"architectures.":[22],"In":[23,70,97],"this":[24,98],"problem,":[25],"set":[27],"n":[29,161],"customer":[30],"orders":[31,131],"needs":[32],"to":[33,50],"be":[34,51,133],"scheduled":[35],"on":[36,53],"multiple":[37,44],"facilities.":[38],"An":[39],"can":[41,132],"consist":[42],"requests,":[45],"each":[46],"which":[48],"has":[49,76],"serviced":[52],"one":[54],"designated":[55],"facility,":[56],"and":[57,81,112],"an":[58,191],"is":[60],"completed":[61],"only":[62,87],"all":[64,130],"its":[65,77],"have":[67],"been":[68],"serviced.":[69],"setting,":[73],"every":[74],"facility":[75],"own":[78],"request":[79],"buffer":[80,92,156],"must":[82],"schedule":[83],"having":[86],"limited":[88],"knowledge":[89],"about":[90],"state":[93],"at":[94],"other":[95,146],"facilities":[96,111],"paper,":[99],"we":[100,180,201],"quantify":[101],"trade-off":[103],"between":[104,175],"amount":[106],"communication":[108,162,198],"among":[109],"different":[110,208],"quality":[114],"resulting":[117],"global":[118],"solution.":[119],"show":[121],"without":[123],"communication,":[124],"average":[126],"completion":[127],"time":[128],"by":[134],"factor":[136],"\u03a9(\u221an)":[137],"worse":[138],"than":[139],"optimal":[142],"schedule.":[143],"On":[144],"hand,":[147],"there":[148],"exists":[149],"2-approximation":[151],"algorithm":[152,185],"if":[153],"complete":[155],"states":[157],"are":[158],"exchanged":[159],"rounds.":[163,199],"then":[165],"prove":[166],"general":[168],"upper":[169],"bound":[170],"characterizes":[172],"region":[174],"these":[176],"extreme":[177],"points.":[178],"Specifically,":[179],"devise":[181],"that,":[186],"for":[187],"any":[188],"k,":[189],"achieves":[190],"approximation":[192],"ratio":[193],"O(k)":[195],"n/k":[197],"Finally,":[200],"empirically":[202],"test":[203],"performance":[205],"our":[207],"algorithms":[209],"environment":[213],"using":[214],"SPEC":[215],"CPU2006":[216],"benchmarks":[217],"as":[218,220],"well":[219],"Windows":[221],"desktop":[222],"application":[223],"traces.":[224]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":5}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}