{"id":"https://openalex.org/W2151125933","doi":"https://doi.org/10.1109/ipdps.2004.1302904","title":"Parallel maximum weight bipartite matching algorithms for scheduling in input-queued switches","display_name":"Parallel maximum weight bipartite matching algorithms for scheduling in input-queued switches","publication_year":2004,"publication_date":"2004-06-10","ids":{"openalex":"https://openalex.org/W2151125933","doi":"https://doi.org/10.1109/ipdps.2004.1302904","mag":"2151125933"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2004.1302904","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2004.1302904","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.","raw_type":"proceedings-article"},"type":"conference-paper","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/A5031132293","display_name":"Morteza Fayyazi","orcid":null},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. Fayyazi","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Northeastern University, Boston, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Northeastern University, Boston, MA, USA","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061128237","display_name":"David Kaeli","orcid":"https://orcid.org/0000-0002-5692-0151"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. Kaeli","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Northeastern University, Boston, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Northeastern University, Boston, MA, USA","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056980887","display_name":"Waleed Meleis","orcid":"https://orcid.org/0000-0003-4158-6071"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"W. Meleis","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Northeastern University, Boston, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Northeastern University, Boston, MA, USA","institution_ids":["https://openalex.org/I12912129"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I12912129"],"apc_list":null,"apc_paid":null,"fwci":0.4825,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.64777812,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"35","issue":null,"first_page":"4","last_page":"11"},"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.9947999715805054,"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9861000180244446,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.8497069478034973},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7255007028579712},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6357371807098389},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.6312758326530457},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6073973178863525},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.5505735874176025},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5382724404335022},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.45671194791793823},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.30772703886032104},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.27547621726989746},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2731625735759735},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22903671860694885},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1726054549217224},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.11406919360160828}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8497069478034973},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7255007028579712},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6357371807098389},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.6312758326530457},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6073973178863525},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.5505735874176025},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5382724404335022},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.45671194791793823},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.30772703886032104},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.27547621726989746},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2731625735759735},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22903671860694885},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1726054549217224},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.11406919360160828}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ipdps.2004.1302904","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2004.1302904","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W101940000","https://openalex.org/W1513400187","https://openalex.org/W1513448402","https://openalex.org/W1513716704","https://openalex.org/W1602900718","https://openalex.org/W1607044975","https://openalex.org/W1968411746","https://openalex.org/W1980449090","https://openalex.org/W1981234161","https://openalex.org/W2053913299","https://openalex.org/W2064306958","https://openalex.org/W2068505107","https://openalex.org/W2069323107","https://openalex.org/W2073446486","https://openalex.org/W2076915000","https://openalex.org/W2087794217","https://openalex.org/W2096046208","https://openalex.org/W2099573773","https://openalex.org/W2099988251","https://openalex.org/W2105818147","https://openalex.org/W2106522282","https://openalex.org/W2118130591","https://openalex.org/W2120655454","https://openalex.org/W2128796442","https://openalex.org/W2137188211","https://openalex.org/W2144746678","https://openalex.org/W2156812473","https://openalex.org/W2160302221","https://openalex.org/W2168590861","https://openalex.org/W2610479830","https://openalex.org/W2610729871","https://openalex.org/W2752885492","https://openalex.org/W2946046356","https://openalex.org/W3145128584","https://openalex.org/W3162268932","https://openalex.org/W6604159152","https://openalex.org/W6630667541"],"related_works":["https://openalex.org/W2968037521","https://openalex.org/W2357469710","https://openalex.org/W2461841679","https://openalex.org/W2596165142","https://openalex.org/W69176915","https://openalex.org/W2118779360","https://openalex.org/W196138040","https://openalex.org/W2461366636","https://openalex.org/W4308171630","https://openalex.org/W2151412766"],"abstract_inverted_index":{"Summary":[0],"form":[1],"only":[2],"given.":[3],"An":[4],"input-queued":[5,48,107,138],"switch":[6],"with":[7,166],"virtual":[8],"output":[9],"queuing":[10],"is":[11,52],"able":[12,79],"to":[13,53,80],"provide":[14,54],"a":[15,33,39,71,85,143,150],"maximum":[16,34,40],"throughput":[17,56],"of":[18,74,112,124,172],"100%":[19,55],"in":[20,88,96,106],"the":[21,82,93,97,103,110,122,156],"supporting":[22],"more":[23],"sophisticated":[24],"scheduling":[25,28,45,134],"strategies.":[26],"Switch":[27],"can":[29],"be":[30],"cast":[31],"as":[32],"flow":[35],"problem.":[36],"We":[37,77,140],"propose":[38],"weight":[41,111],"bipartite":[42,152,164],"matching":[43,94],"(MWBM)":[44],"algorithm":[46,63,128,148,161],"for":[47,84,137,149,162],"switches.":[49,139],"Our":[50,62],"goal":[51],"while":[57],"maintaining":[58],"fairness":[59],"and":[60],"stability.":[61],"provides":[64],"sublinear":[65,89,159],"parallel":[66],"run":[67],"time":[68,86,90,99,119,145],"complexity":[69,146],"using":[70,92],"polynomial":[72],"number":[73,171],"processing":[75],"elements.":[76],"are":[78],"obtain":[81],"MWBM":[83,133,147,160],"slot":[87,100],"by":[91],"produced":[95],"previous":[98],"based":[101],"on":[102],"observation":[104],"that":[105],"cell-based":[108],"switches,":[109],"edges":[113],"changes":[114],"very":[115],"little":[116],"during":[117],"successive":[118],"slots.":[120],"To":[121],"best":[123,157],"our":[125,127],"knowledge,":[126],"outperforms":[129,155],"all":[130],"previously":[131],"proposed":[132,136],"algorithms":[135],"also":[141],"describe":[142],"linear":[144],"general":[151],"graph":[153,165],"which":[154],"known":[158],"any":[163],"less":[167],"than":[168],"10/sup":[169],"15/":[170],"nodes.":[173]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}