{"language":[{"iso":"eng"}],"oa":1,"day":"06","year":"2021","external_id":{"arxiv":["2005.07761"]},"publication_status":"published","page":"129-139","acknowledgement":"We thank Orr Fischer, Juho Hirvonen, and Tuomo Lempiäinen for valuable discussions. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 840605.","doi":"10.1145/3409964.3461785","publication":"Annual ACM Symposium on Parallelism in Algorithms and Architectures","_id":"9678","date_updated":"2024-03-05T07:13:12Z","conference":{"location":" Virtual Event, United States","start_date":"2021-07-06","name":"SPAA: Symposium on Parallelism in Algorithms and Architectures ","end_date":"2021-07-08"},"main_file_link":[{"url":"https://arxiv.org/abs/2005.07761","open_access":"1"}],"date_published":"2021-07-06T00:00:00Z","date_created":"2021-07-18T22:01:22Z","oa_version":"Preprint","article_processing_charge":"No","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","publication_identifier":{"isbn":["9781450380706"]},"type":"conference","month":"07","status":"public","ec_funded":1,"title":"Efficient load-balancing through distributed token dropping","department":[{"_id":"DaAl"}],"citation":{"ama":"Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. Efficient load-balancing through distributed token dropping. In: <i>Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>. ; 2021:129-139. doi:<a href=\"https://doi.org/10.1145/3409964.3461785\">10.1145/3409964.3461785</a>","short":"S. Brandt, B. Keller, J. Rybicki, J. Suomela, J. Uitto, in:, Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2021, pp. 129–139.","ista":"Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. 2021. Efficient load-balancing through distributed token dropping. Annual ACM Symposium on Parallelism in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and Architectures , 129–139.","mla":"Brandt, Sebastian, et al. “Efficient Load-Balancing through Distributed Token Dropping.” <i>Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2021, pp. 129–39, doi:<a href=\"https://doi.org/10.1145/3409964.3461785\">10.1145/3409964.3461785</a>.","apa":"Brandt, S., Keller, B., Rybicki, J., Suomela, J., &#38; Uitto, J. (2021). Efficient load-balancing through distributed token dropping. In <i>Annual ACM Symposium on Parallelism in Algorithms and Architectures</i> (pp. 129–139).  Virtual Event, United States. <a href=\"https://doi.org/10.1145/3409964.3461785\">https://doi.org/10.1145/3409964.3461785</a>","ieee":"S. Brandt, B. Keller, J. Rybicki, J. Suomela, and J. Uitto, “Efficient load-balancing through distributed token dropping,” in <i>Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>,  Virtual Event, United States, 2021, pp. 129–139.","chicago":"Brandt, Sebastian, Barbara Keller, Joel Rybicki, Jukka Suomela, and Jara Uitto. “Efficient Load-Balancing through Distributed Token Dropping.” In <i>Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>, 129–39, 2021. <a href=\"https://doi.org/10.1145/3409964.3461785\">https://doi.org/10.1145/3409964.3461785</a>."},"author":[{"full_name":"Brandt, Sebastian","last_name":"Brandt","first_name":"Sebastian"},{"last_name":"Keller","full_name":"Keller, Barbara","first_name":"Barbara"},{"full_name":"Rybicki, Joel","last_name":"Rybicki","first_name":"Joel","orcid":"0000-0002-6432-6646","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jukka","full_name":"Suomela, Jukka","last_name":"Suomela"},{"first_name":"Jara","last_name":"Uitto","full_name":"Uitto, Jara"}],"project":[{"_id":"26A5D39A-B435-11E9-9278-68D0E5697425","grant_number":"840605","call_identifier":"H2020","name":"Coordination in constrained and natural distributed systems"}],"abstract":[{"lang":"eng","text":"We introduce a new graph problem, the token dropping game, and we show how to solve it efficiently in a distributed setting. We use the token dropping game as a tool to design an efficient distributed algorithm for stable orientations and more generally for locally optimal semi-matchings. The prior work by Czygrinow et al. (DISC 2012) finds a stable orientation in O(Δ^5) rounds in graphs of maximum degree Δ, while we improve it to O(Δ^4) and also prove a lower bound of Ω(Δ). For the more general problem of locally optimal semi-matchings, the prior upper bound is O(S^5) and our new algorithm runs in O(C · S^4) rounds, which is an improvement for C = o(S); here C and S are the maximum degrees of customers and servers, respectively."}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"15074"}]},"scopus_import":"1","quality_controlled":"1"}