{"publication_status":"published","conference":{"name":"DISC: Symposium on Distributed Computing","end_date":"2020-10-16","start_date":"2020-10-12","location":"Virtual"},"scopus_import":"1","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","type":"conference","citation":{"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>","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.","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>.","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.","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>.","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.","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>"},"oa_version":"Published Version","month":"10","title":"Brief announcement: Efficient load-balancing through distributed token dropping","doi":"10.4230/LIPIcs.DISC.2020.40","_id":"15074","date_published":"2020-10-07T00:00:00Z","article_processing_charge":"No","file":[{"file_id":"15075","success":1,"access_level":"open_access","creator":"dernst","checksum":"23e2d9321aef53092dc1e24a8ab82d72","file_size":303529,"date_created":"2024-03-05T07:08:27Z","file_name":"2020_LIPIcs_Brandt.pdf","content_type":"application/pdf","date_updated":"2024-03-05T07:08:27Z","relation":"main_file"}],"year":"2020","ddc":["000"],"date_created":"2024-03-05T07:09:12Z","article_number":"40","publication":"34th International Symposium on Distributed Computing","alternative_title":["LIPIcs"],"department":[{"_id":"DaAl"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Brandt, Sebastian","first_name":"Sebastian","last_name":"Brandt"},{"full_name":"Keller, Barbara","first_name":"Barbara","last_name":"Keller"},{"id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","last_name":"Rybicki","full_name":"Rybicki, Joel","first_name":"Joel","orcid":"0000-0002-6432-6646"},{"full_name":"Suomela, Jukka","first_name":"Jukka","last_name":"Suomela"},{"full_name":"Uitto, Jara","first_name":"Jara","last_name":"Uitto"}],"language":[{"iso":"eng"}],"file_date_updated":"2024-03-05T07:08:27Z","volume":179,"external_id":{"arxiv":["2005.07761"]},"has_accepted_license":"1","quality_controlled":"1","day":"07","status":"public","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."}],"tmp":{"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)","image":"/images/cc_by.png"},"date_updated":"2024-03-05T07:13:13Z","intvolume":"       179","related_material":{"record":[{"id":"9678","status":"public","relation":"later_version"}]},"license":"https://creativecommons.org/licenses/by/3.0/"}