{"article_number":"40","day":"07","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)"},"file_date_updated":"2024-03-05T07:08:27Z","language":[{"iso":"eng"}],"scopus_import":"1","ddc":["000"],"doi":"10.4230/LIPIcs.DISC.2020.40","external_id":{"arxiv":["2005.07761"]},"date_published":"2020-10-07T00:00:00Z","date_created":"2024-03-05T07:09:12Z","oa":1,"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 the stable orientation problem, which is a special case of the more general locally optimal semi-matching problem. The prior work by Czygrinow et al. (DISC 2012) finds a locally optimal semi-matching in O(Δ⁵) rounds in graphs of maximum degree Δ, which directly implies an algorithm with the same runtime for stable orientations. We improve the runtime to O(Δ⁴) for stable orientations and prove a lower bound of Ω(Δ) rounds."}],"publication":"34th International Symposium on Distributed Computing","quality_controlled":"1","date_updated":"2024-03-05T07:13:13Z","year":"2020","oa_version":"Published Version","type":"conference","title":"Brief announcement: Efficient load-balancing through distributed token dropping","author":[{"last_name":"Brandt","first_name":"Sebastian","full_name":"Brandt, Sebastian"},{"full_name":"Keller, Barbara","first_name":"Barbara","last_name":"Keller"},{"last_name":"Rybicki","orcid":"0000-0002-6432-6646","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","full_name":"Rybicki, Joel","first_name":"Joel"},{"last_name":"Suomela","first_name":"Jukka","full_name":"Suomela, Jukka"},{"last_name":"Uitto","full_name":"Uitto, Jara","first_name":"Jara"}],"department":[{"_id":"DaAl"}],"_id":"15074","related_material":{"record":[{"id":"9678","status":"public","relation":"later_version"}]},"publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","article_processing_charge":"No","conference":{"start_date":"2020-10-12","end_date":"2020-10-16","name":"DISC: Symposium on Distributed Computing","location":"Virtual"},"intvolume":"       179","month":"10","file":[{"file_name":"2020_LIPIcs_Brandt.pdf","file_id":"15075","date_updated":"2024-03-05T07:08:27Z","access_level":"open_access","file_size":303529,"success":1,"content_type":"application/pdf","date_created":"2024-03-05T07:08:27Z","checksum":"23e2d9321aef53092dc1e24a8ab82d72","relation":"main_file","creator":"dernst"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":179,"status":"public","citation":{"short":"S. Brandt, B. Keller, J. Rybicki, J. Suomela, J. Uitto, in:, 34th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ieee":"S. Brandt, B. Keller, J. Rybicki, J. Suomela, and J. Uitto, “Brief announcement: Efficient load-balancing through distributed token dropping,” in <i>34th International Symposium on Distributed Computing</i>, Virtual, 2020, vol. 179.","ama":"Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. Brief announcement: Efficient load-balancing through distributed token dropping. In: <i>34th International Symposium on Distributed Computing</i>. Vol 179. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.40\">10.4230/LIPIcs.DISC.2020.40</a>","chicago":"Brandt, Sebastian, Barbara Keller, Joel Rybicki, Jukka Suomela, and Jara Uitto. “Brief Announcement: Efficient Load-Balancing through Distributed Token Dropping.” In <i>34th International Symposium on Distributed Computing</i>, Vol. 179. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.40\">https://doi.org/10.4230/LIPIcs.DISC.2020.40</a>.","apa":"Brandt, S., Keller, B., Rybicki, J., Suomela, J., &#38; Uitto, J. (2020). Brief announcement: Efficient load-balancing through distributed token dropping. In <i>34th International Symposium on Distributed Computing</i> (Vol. 179). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.40\">https://doi.org/10.4230/LIPIcs.DISC.2020.40</a>","mla":"Brandt, Sebastian, et al. “Brief Announcement: Efficient Load-Balancing through Distributed Token Dropping.” <i>34th International Symposium on Distributed Computing</i>, vol. 179, 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.40\">10.4230/LIPIcs.DISC.2020.40</a>.","ista":"Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. 2020. Brief announcement: Efficient load-balancing through distributed token dropping. 34th International Symposium on Distributed Computing. DISC: Symposium on Distributed Computing, LIPIcs, vol. 179, 40."},"alternative_title":["LIPIcs"],"has_accepted_license":"1"}