{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:27:13Z","timestamp":1750220833386,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,6]],"date-time":"2020-07-06T00:00:00Z","timestamp":1593993600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,6]]},"DOI":"10.1145\/3350755.3400232","type":"proceedings-article","created":{"date-parts":[[2020,7,9]],"date-time":"2020-07-09T15:56:12Z","timestamp":1594310172000},"page":"163-173","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Parallel Load Balancing on Constrained Client-Server Topologies"],"prefix":"10.1145","author":[{"given":"Andrea","family":"Clementi","sequence":"first","affiliation":[{"name":"Universit\u00e1 di Roma Tor Vergata, Roma, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emanuele","family":"Natale","sequence":"additional","affiliation":[{"name":"Universit\u00e9 C\u00f4te d'Azur, CNRS, INRIA, Sophia Antipolis, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Isabella","family":"Ziccardi","sequence":"additional","affiliation":[{"name":"Universit\u00e0 dell'Aquila, L'Aquila, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,7,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/258128"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1070432.1070461"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195412"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/3381089.3381169"},{"key":"e_1_3_2_1_5_1","volume-title":"2010 IEEE International Symposium on Parallel Distributed Processing (IPDPS). 1--10","author":"Berenbrink P.","year":"2010","unstructured":"P. Berenbrink , A. Brinkmann , T. Friedetzky , and L. Nagel . 2010. Balls into nonuniform bins . In 2010 IEEE International Symposium on Parallel Distributed Processing (IPDPS). 1--10 . https:\/\/doi.org\/10.1109\/IPDPS. 2010 .5470355 10.1109\/IPDPS.2010.5470355 P. Berenbrink, A. Brinkmann, T. Friedetzky, and L. Nagel. 2010. Balls into nonuniform bins. In 2010 IEEE International Symposium on Parallel Distributed Processing (IPDPS). 1--10. https:\/\/doi.org\/10.1109\/IPDPS.2010.5470355"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2011.10.006"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970444435X"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109597"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.09.023"},{"key":"e_1_3_2_1_10_1","volume-title":"Parallel randomized load balancing. Unpublished Manuscript","author":"Berenbrink Petra","year":"2018","unstructured":"Petra Berenbrink , Tom Friedetzy , Christiane Lammersen , and Thomas Sauwervald . 2018. Parallel randomized load balancing. Unpublished Manuscript ( 2018 ). Petra Berenbrink, Tom Friedetzy, Christiane Lammersen, and Thomas Sauwervald. 2018. Parallel randomized load balancing. Unpublished Manuscript (2018)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486191"},{"volume-title":"Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '97)","author":"Berenbrink Petra","key":"e_1_3_2_1_12_1","unstructured":"Petra Berenbrink , Friedhelm Meyer auf der Heide, and Klaus Schr\u00f6der. 1997. Allocating Weighted Jobs in Parallel . In Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '97) . Association for Computing Machinery, New York, NY, USA, 302--310. https:\/\/doi.org\/10.1145\/ 258492.258522 Petra Berenbrink, Friedhelm Meyer auf der Heide, and Klaus Schr\u00f6der. 1997. Allocating Weighted Jobs in Parallel. In Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '97). Association for Computing Machinery, New York, NY, USA, 302--310. https:\/\/doi.org\/10.1145\/ 258492.258522"},{"key":"e_1_3_2_1_13_1","volume-title":"Online Bipartite Matching in Offline Time. In 2014 IEEE 55th Annual Symposium on Foundations of Computer Science. 384--393","author":"Bosek B.","year":"2014","unstructured":"B. Bosek , D. Leniowski , P. Sankowski , and A. Zych . 2014 . Online Bipartite Matching in Offline Time. In 2014 IEEE 55th Annual Symposium on Foundations of Computer Science. 384--393 . https:\/\/doi.org\/10.1109\/FOCS. 2014 .48 10.1109\/FOCS.2014.48 B. Bosek, D. Leniowski, P. Sankowski, and A. Zych. 2014. Online Bipartite Matching in Offline Time. In 2014 IEEE 55th Annual Symposium on Foundations of Computer Science. 384--393. https:\/\/doi.org\/10.1109\/FOCS.2014.48"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007921"},{"key":"e_1_3_2_1_15_1","volume-title":"Dubhashi and Alessandro Panconesi","author":"Devdatt","year":"2009","unstructured":"Devdatt P. Dubhashi and Alessandro Panconesi . 2009 . Concentration of measure for the analysis of randomized algorithms. Cambridge University Press . Devdatt P. Dubhashi and Alessandro Panconesi. 2009. Concentration of measure for the analysis of randomized algorithms. Cambridge University Press."},{"key":"e_1_3_2_1_16_1","volume-title":"Philpott","author":"Gantz Stephen D.","year":"2013","unstructured":"Stephen D. Gantz and Daniel R . Philpott . 2013 . Chapter 15 - Contingency Planning. In FISMA and the Risk Management Framework, Stephen D. Gantz and Daniel R. Philpott (Eds.). Syngress , 403 -- 443. https:\/\/doi.org\/10.1016\/B978--1--59--749641--4. 00015--1 10.1016\/B978--1--59--749641--4 Stephen D. Gantz and Daniel R. Philpott. 2013. Chapter 15 - Contingency Planning. In FISMA and the Risk Management Framework, Stephen D. Gantz and Daniel R. Philpott (Eds.). Syngress, 403 -- 443. https:\/\/doi.org\/10.1016\/B978--1--59--749641--4. 00015--1"},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '08)","author":"Godfrey P. Brighten","year":"2008","unstructured":"P. Brighten Godfrey . 2008 . Balls and Bins with Structure: Balanced Allocations on Hypergraphs . In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '08) . Society for Industrial and Applied Mathematics, USA, 511--517. P. Brighten Godfrey. 2008. Balls and Bins with Structure: Balanced Allocations on Hypergraphs. In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '08). Society for Industrial and Applied Mathematics, USA, 511--517."},{"volume-title":"Proceedings of the Twenty- Fourth Annual ACM Symposium on Theory of Computing (STOC '92)","author":"Karp Richard M.","key":"e_1_3_2_1_18_1","unstructured":"Richard M. Karp , Michael Luby , and Friedhelm Meyer auf der Heide. 1992. Efficient PRAM Simulation on a Distributed Memory Machine . In Proceedings of the Twenty- Fourth Annual ACM Symposium on Theory of Computing (STOC '92) . Association for Computing Machinery, New York, NY, USA, 318--326. https:\/\/doi.org\/10.1145\/129712.129743 10.1145\/129712.129743 Richard M. Karp, Michael Luby, and Friedhelm Meyer auf der Heide. 1992. Efficient PRAM Simulation on a Distributed Memory Machine. In Proceedings of the Twenty- Fourth Annual ACM Symposium on Theory of Computing (STOC '92). Association for Computing Machinery, New York, NY, USA, 318--326. https:\/\/doi.org\/10.1145\/129712.129743"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109606"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1582716.1582731"},{"key":"e_1_3_2_1_21_1","volume-title":"Approximate Equilibria and Ball Fusion. Theory of Computing Systems 36, 6 (01","author":"Koutsoupias Elias","year":"2003","unstructured":"Elias Koutsoupias , Marios Mavronicolas , and Paul Spirakis . 2003. Approximate Equilibria and Ball Fusion. Theory of Computing Systems 36, 6 (01 Dec 2003 ), 683--693. https:\/\/doi.org\/10.1007\/s00224-003--1131--5 10.1007\/s00224-003--1131--5 Elias Koutsoupias, Marios Mavronicolas, and Paul Spirakis. 2003. Approximate Equilibria and Ball Fusion. Theory of Computing Systems 36, 6 (01 Dec 2003), 683--693. https:\/\/doi.org\/10.1007\/s00224-003--1131--5"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3323165.3323203"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993639"},{"key":"e_1_3_2_1_24_1","volume-title":"Wilmer","author":"Levin David A.","year":"2006","unstructured":"David A. Levin , Yuval Peres , and Elizabeth L . Wilmer . 2006 . Markov chains and mixing times. American Mathematical Society . http: \/\/scholar.google.com\/scholar.bib?q=info:3wf9IU94tyMJ:scholar.google.com\/ &output=citation&hl=en&as_sdt=2000&ct=citation&cd=0 David A. Levin, Yuval Peres, and Elizabeth L. Wilmer. 2006. Markov chains and mixing times. American Mathematical Society. http: \/\/scholar.google.com\/scholar.bib?q=info:3wf9IU94tyMJ:scholar.google.com\/ &output=citation&hl=en&as_sdt=2000&ct=citation&cd=0"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199809)13:2<159::AID-RSA3>3.0.CO;2-Q"},{"key":"e_1_3_2_1_26_1","volume-title":"Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis","author":"Mitzenmacher Michael","unstructured":"Michael Mitzenmacher and Eli Upfal . 2017. Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis ( 2 nd ed.). Cambridge University Press , USA. Michael Mitzenmacher and Eli Upfal. 2017. Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis (2nd ed.). Cambridge University Press, USA.","edition":"2"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652152"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/792538.792546"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1248377.1248407"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2010.5510913"}],"event":{"name":"SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Virtual Event USA","acronym":"SPAA '20"},"container-title":["Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3350755.3400232","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3350755.3400232","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:13:35Z","timestamp":1750202015000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3350755.3400232"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,6]]},"references-count":30,"alternative-id":["10.1145\/3350755.3400232","10.1145\/3350755"],"URL":"https:\/\/doi.org\/10.1145\/3350755.3400232","relation":{},"subject":[],"published":{"date-parts":[[2020,7,6]]},"assertion":[{"value":"2020-07-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}