{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:18:55Z","timestamp":1750220335114,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":53,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T00:00:00Z","timestamp":1658275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["1522054, 1526067, 1839346, 1740822, 1704742, 2047283"],"award-info":[{"award-number":["1522054, 1526067, 1839346, 1740822, 1704742, 2047283"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,20]]},"DOI":"10.1145\/3519270.3538443","type":"proceedings-article","created":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T16:23:51Z","timestamp":1658420631000},"page":"313-323","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["From Switch Scheduling to Datacenter Scheduling"],"prefix":"10.1145","author":[{"given":"Rachit","family":"Agarwal","sequence":"first","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shijin","family":"Rajakrishnan","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David B.","family":"Shmoys","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,7,21]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486031"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/161541.161736"},{"key":"e_1_3_2_2_3_1","volume-title":"SODA","author":"Awerbuch B.","year":"2005","unstructured":"B. Awerbuch , M. T. Hajiaghayi , R. D. Kleinberg , and T. Leighton . Online clientserver load balancing without global information . In SODA , 2005 . B. Awerbuch, M. T. Hajiaghayi, R. D. Kleinberg, and T. Leighton. Online clientserver load balancing without global information. In SODA, 2005."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087806"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.993558"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879175"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1120.1138"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312058"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3544216.3544235"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3452296.3472888"},{"key":"e_1_3_2_2_11_1","volume-title":"The toronto paper matching system: an automated paper-reviewer assignment system","author":"Charlin L.","year":"2013","unstructured":"L. Charlin and R. Zemel . The toronto paper matching system: an automated paper-reviewer assignment system . 2013 . L. Charlin and R. Zemel. The toronto paper matching system: an automated paper-reviewer assignment system. 2013."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571877"},{"key":"e_1_3_2_2_13_1","article-title":"Graph traversal techniques and the maximum flow problem in distributed computation","author":"Cheung T.","year":"1983","unstructured":"T. Cheung . Graph traversal techniques and the maximum flow problem in distributed computation . IEEE Transactions on Software Engineering , 1983 . T. Cheung. Graph traversal techniques and the maximum flow problem in distributed computation. IEEE Transactions on Software Engineering, 1983.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9239"},{"key":"e_1_3_2_2_15_1","volume-title":"IJCAI","author":"Drummond J.","year":"2015","unstructured":"J. Drummond , A. Perrault , and F. Bacchus . SAT is an effective and complete method for solving stable matching problems with couples . In IJCAI , 2015 . J. Drummond, A. Perrault, and F. Bacchus. SAT is an effective and complete method for solving stable matching problems with couples. In IJCAI, 2015."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2529989"},{"key":"e_1_3_2_2_17_1","volume-title":"trees, and flowers. Canadian Journal of mathematics","author":"Edmonds J.","year":"1965","unstructured":"J. Edmonds . Paths , trees, and flowers. Canadian Journal of mathematics , 1965 . J. Edmonds. Paths, trees, and flowers. Canadian Journal of mathematics, 1965."},{"key":"e_1_3_2_2_18_1","volume-title":"5th International Workshop","volume":"2570","author":"Edmonds J. R.","year":"2001","unstructured":"J. R. Edmonds and E. L. Johnson . Matching: A well-solved class of integer linear programs. In Combinatorial Optimization - Eureka, You Shrink!, Papers Dedicated to Jack Edmonds , 5th International Workshop , volume 2570 of Lecture Notes in Computer Science, pages 27--30. Springer , 2001 . J. R. Edmonds and E. L. Johnson. Matching: A well-solved class of integer linear programs. In Combinatorial Optimization - Eureka, You Shrink!, Papers Dedicated to Jack Edmonds, 5th International Workshop, volume 2570 of Lecture Notes in Computer Science, pages 27--30. Springer, 2001."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2684464.2684469"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/HOTI.2009.11"},{"key":"e_1_3_2_2_21_1","volume-title":"Distributed Computing","author":"Fischer M.","year":"2020","unstructured":"M. Fischer . Improved deterministic distributed matching via rounding . Distributed Computing , 2020 . M. Fischer. Improved deterministic distributed matching via rounding. Distributed Computing, 2020."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2716281.2836086"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212743"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767440"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3387514.3405878"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(86)90144-4"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2016.65"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04355-0_23"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1107\/S0907444904026460"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2742012"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.5297"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989505"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.20"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2645710.2645749"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378558"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786753"},{"key":"e_1_3_2_2_37_1","volume-title":"Multicast traffic in input-queued switches: optimal scheduling and maximum throughput","author":"Marsan M. A.","year":"2003","unstructured":"M. A. Marsan , A. Bianco , P. Giaccone , E. Leonardi , and F. Neri . Multicast traffic in input-queued switches: optimal scheduling and maximum throughput . IEEE\/ACM Transactions on Networking , 2003 . M. A. Marsan, A. Bianco, P. Giaccone, E. Leonardi, and F. Neri. Multicast traffic in input-queued switches: optimal scheduling and maximum throughput. IEEE\/ACM Transactions on Networking, 2003."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.769767"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/26.780463"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1049\/el:19931459"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230564"},{"key":"e_1_3_2_2_42_1","volume-title":"Distributed Computing","author":"Panconesi A.","year":"2010","unstructured":"A. Panconesi and M. Sozio . Fast primal-dual distributed algorithms for scheduling and matching problems . Distributed Computing , 2010 . A. Panconesi and M. Sozio. Fast primal-dual distributed algorithms for scheduling and matching problems. Distributed Computing, 2010."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626309"},{"key":"e_1_3_2_2_44_1","volume-title":"(ISPDC)","author":"Pham T. L.","year":"2005","unstructured":"T. L. Pham , I. Lavall\u00e9e , M. Bui , and S. H. Do . A distributed algorithm for the maximum flow problem . In (ISPDC) , 2005 . T. L. Pham, I. Lavall\u00e9e, M. Bui, and S. H. Do. A distributed algorithm for the maximum flow problem. In (ISPDC), 2005."},{"key":"e_1_3_2_2_45_1","volume-title":"Matching theory","author":"Plummer M. D.","year":"1986","unstructured":"M. D. Plummer and L. Lov\u00e1sz . Matching theory . Elsevier , 1986 . M. D. Plummer and L. Lov\u00e1sz. Matching theory. Elsevier, 1986."},{"key":"e_1_3_2_2_46_1","first-page":"179","article-title":"Matchings and extensions","volume":"1","author":"Pulleyblank W. R.","year":"1995","unstructured":"W. R. Pulleyblank . Matchings and extensions . Handbook of combinatorics , 1 : 179 -- 232 , 1995 . W. R. Pulleyblank. Matchings and extensions. Handbook of combinatorics, 1:179-- 232, 1995.","journal-title":"Handbook of combinatorics"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787472"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/40.988685"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.238"},{"key":"e_1_3_2_2_50_1","volume-title":"NSDI","author":"Shashidhara R.","year":"2022","unstructured":"R. Shashidhara , T. Stamler , A. Kaufmann , and S. Peter . FlexTOE: Flexible TCP offload with fine-grained parallelism . In NSDI , 2022 . R. Shashidhara, T. Stamler, A. Kaufmann, and S. Peter. FlexTOE: Flexible TCP offload with fine-grained parallelism. In NSDI, 2022."},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787508"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"crossref","unstructured":"R. E.\n      Tarjan\n    . \n      Data\n     structures and network algorithms volume \n  44\n   of \n  CBMS-NSF regional conference series in applied mathematics\n  . \n  SIAM 1983\n  .  R. E. Tarjan. Data structures and network algorithms volume 44 of CBMS-NSF regional conference series in applied mathematics. SIAM 1983.","DOI":"10.1137\/1.9781611970265"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30186-8_24"}],"event":{"name":"PODC '22: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Salerno Italy","acronym":"PODC '22"},"container-title":["Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538443","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538443","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538443","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:21Z","timestamp":1750191141000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538443"}},"subtitle":["Matching-Coordinated Greed is Good"],"short-title":[],"issued":{"date-parts":[[2022,7,20]]},"references-count":53,"alternative-id":["10.1145\/3519270.3538443","10.1145\/3519270"],"URL":"https:\/\/doi.org\/10.1145\/3519270.3538443","relation":{},"subject":[],"published":{"date-parts":[[2022,7,20]]},"assertion":[{"value":"2022-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}