{"id":"https://openalex.org/W2153430142","doi":"https://doi.org/10.1109/icccn.2005.1523809","title":"A scalable scheduling algorithm to avoid conflicts in switch-memory-switch routers","display_name":"A scalable scheduling algorithm to avoid conflicts in switch-memory-switch routers","publication_year":2006,"publication_date":"2006-10-11","ids":{"openalex":"https://openalex.org/W2153430142","doi":"https://doi.org/10.1109/icccn.2005.1523809","mag":"2153430142"},"language":"en","primary_location":{"id":"doi:10.1109/icccn.2005.1523809","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2005.1523809","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","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/A5100694150","display_name":"Yang Xu","orcid":"https://orcid.org/0000-0001-9976-4403"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yang Xu","raw_affiliation_strings":["Department of Computer Science and Technology, Tsinghua University, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Technology, Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059862135","display_name":"Beibei Wu","orcid":"https://orcid.org/0000-0002-0784-0745"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Beibei Wu","raw_affiliation_strings":["Department of Computer Science and Technology, Tsinghua University, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Technology, Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100408983","display_name":"Wenjie Li","orcid":"https://orcid.org/0000-0002-7360-8864"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wenjie Li","raw_affiliation_strings":["Department of Computer Science and Technology, Tsinghua University, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Technology, Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100711159","display_name":"Bin Liu","orcid":"https://orcid.org/0000-0001-9811-7714"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Bin Liu","raw_affiliation_strings":["Department of Computer Science and Technology, Tsinghua University, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Technology, Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5100694150"],"corresponding_institution_ids":["https://openalex.org/I99065089"],"apc_list":null,"apc_paid":null,"fwci":1.2071,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.82642143,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":null,"first_page":"57","last_page":"64"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and 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/T10829","display_name":"Interconnection Networks and 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/T10018","display_name":"Advancements in Battery Materials","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T12288","display_name":"Optimization and Search Problems","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.7676389813423157},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6812224984169006},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6461543440818787},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5671901702880859},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5535550117492676},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5480733513832092},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5243340134620667},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4405752718448639},{"id":"https://openalex.org/keywords/randomness","display_name":"Randomness","score":0.4335591495037079},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3098659813404083},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2871841490268707},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1561993658542633}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7676389813423157},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6812224984169006},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6461543440818787},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5671901702880859},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5535550117492676},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5480733513832092},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5243340134620667},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4405752718448639},{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.4335591495037079},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3098659813404083},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2871841490268707},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1561993658542633},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icccn.2005.1523809","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2005.1523809","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W2079931475","https://openalex.org/W2087794217","https://openalex.org/W2096192604","https://openalex.org/W2099573773","https://openalex.org/W2103330191","https://openalex.org/W2111366547","https://openalex.org/W2121523570","https://openalex.org/W2126169247","https://openalex.org/W2146541392","https://openalex.org/W2151766861","https://openalex.org/W2153450930","https://openalex.org/W2176566884","https://openalex.org/W2253956134","https://openalex.org/W2295428206","https://openalex.org/W2799087070","https://openalex.org/W3162268932","https://openalex.org/W3163287424","https://openalex.org/W4231916799","https://openalex.org/W6682576916"],"related_works":["https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W2146343568","https://openalex.org/W98480971","https://openalex.org/W2150291671","https://openalex.org/W2013643406","https://openalex.org/W2027972911","https://openalex.org/W3138386522","https://openalex.org/W2499279132","https://openalex.org/W2151412766"],"abstract_inverted_index":{"Although":[0,64],"output":[1],"queued":[2],"(OQ)":[3],"switches":[4],"are":[5,12,138,162],"prominent":[6],"for":[7,73],"their":[8],"high":[9,20,80,123,200],"performance,":[10,69],"they":[11],"not":[13],"easy":[14],"to":[15,18,52,81,111,116],"implement":[16],"due":[17],"the":[19,29,50,53,70,75,118,132,135,141,179,205],"speedup":[21],"requirement.":[22],"Using":[23],"a":[24,33,91,186,194],"special":[25],"scheduling":[26,65],"algorithm":[27,66,98],"in":[28,84,114,140,202],"first":[30],"stage":[31],"switch,":[32,43],"more":[34,157],"scalable":[35],"switch-memory-switch":[36],"(SMS)":[37],"architecture":[38],"can":[39,192],"emulate":[40],"an":[41],"OQ":[42],"where":[44,105,154,176],"cells":[45],"must":[46],"be":[47,82,112],"transferred":[48],"from":[49],"inputs":[51],"shared":[54,174],"memories":[55],"per":[56],"time":[57,71,206],"slot":[58],"without":[59],"arrival":[60,133],"and":[61,121,134,151,156,182,204],"departure":[62,119,136],"conflicts.":[63],"achieves":[67],"good":[68],"complexity":[72,207],"constructing":[74],"bipartite":[76,107],"graph":[77,108],"is":[78,109,126,178,185,210,215],"too":[79],"used":[83,163],"practice.":[85],"In":[86,128],"this":[87],"paper,":[88],"we":[89,168],"propose":[90],"new":[92],"iterative":[93],"random":[94],"round-Robin":[95],"matching":[96,195],"(iRRM)":[97],"together":[99],"with":[100,171,199],"its":[101],"constrained":[102],"version":[103],"CiRRM,":[104],"no":[106],"required":[110],"constructed":[113],"advance":[115],"solve":[117],"conflict,":[120],"thus":[122],"computation":[124],"overhead":[125],"avoided.":[127],"our":[129],"algorithms,":[130],"both":[131],"conflicts":[137],"melted":[139],"iterations.":[142],"Each":[143],"iterations":[144,198],"consist":[145],"of":[146,208],"two":[147],"steps:":[148],"request":[149],"step":[150],"grant":[152],"step,":[153],"randomness":[155],"easily":[158],"implemented":[159],"round-robin":[160],"principle":[161],"respectively.":[164],"Through":[165],"theoretical":[166],"analysis,":[167],"obtain":[169],"that":[170],"M=2/spl":[172],"phi/(N-1)":[173],"memories,":[175],"N":[177],"port":[180],"number":[181],"/spl":[183],"phi/":[184],"constant":[187],"larger":[188],"than":[189,218],"(2N-1)/(2N-2),":[190],"iRRM/CiRRM":[191],"complete":[193],"within":[196],"O(logM)":[197],"probability":[201],"M":[203],"CiRRM":[209],"only":[211],"O(log/sup":[212],"2/M/loglogM),":[213],"which":[214],"much":[216],"lower":[217],"prior":[219],"algorithms.":[220]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}