{"file":[{"file_name":"645-spaa70-scheideler.pdf","creator":"florida","date_updated":"2018-03-14T13:58:11Z","file_size":268500,"date_created":"2018-03-14T13:58:11Z","success":1,"file_id":"1228","access_level":"closed","relation":"main_file","content_type":"application/pdf"}],"department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"citation":{"apa":"Doerr, B., Goldberg, L. A., Minder, L., Sauerwald, T., &#38; Scheideler, C. (2011). Stabilizing consensus with the power of two choices. In <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp. 149–158). <a href=\"https://doi.org/10.1145/1989493.1989516\">https://doi.org/10.1145/1989493.1989516</a>","bibtex":"@inproceedings{Doerr_Goldberg_Minder_Sauerwald_Scheideler_2011, title={Stabilizing consensus with the power of two choices}, DOI={<a href=\"https://doi.org/10.1145/1989493.1989516\">10.1145/1989493.1989516</a>}, booktitle={Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Doerr, Benjamin and Goldberg, Leslie Ann and Minder, Lorenz and Sauerwald, Thomas and Scheideler, Christian}, year={2011}, pages={149–158} }","ama":"Doerr B, Goldberg LA, Minder L, Sauerwald T, Scheideler C. Stabilizing consensus with the power of two choices. In: <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ; 2011:149-158. doi:<a href=\"https://doi.org/10.1145/1989493.1989516\">10.1145/1989493.1989516</a>","ieee":"B. Doerr, L. A. Goldberg, L. Minder, T. Sauerwald, and C. Scheideler, “Stabilizing consensus with the power of two choices,” in <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2011, pp. 149–158.","chicago":"Doerr, Benjamin, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, and Christian Scheideler. “Stabilizing Consensus with the Power of Two Choices.” In <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 149–58, 2011. <a href=\"https://doi.org/10.1145/1989493.1989516\">https://doi.org/10.1145/1989493.1989516</a>.","mla":"Doerr, Benjamin, et al. “Stabilizing Consensus with the Power of Two Choices.” <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2011, pp. 149–58, doi:<a href=\"https://doi.org/10.1145/1989493.1989516\">10.1145/1989493.1989516</a>.","short":"B. Doerr, L.A. Goldberg, L. Minder, T. Sauerwald, C. Scheideler, in: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2011, pp. 149–158."},"user_id":"15504","ddc":["040"],"doi":"10.1145/1989493.1989516","abstract":[{"text":"In the standard consensus problem there are n processes with possibly di®erent input values and the goal is to eventually reach a point at which all processes commit to exactly one of these values. We are studying a slight variant of the consensus problem called the stabilizing consensus problem [2]. In this problem, we do not require that each process commits to a ¯nal value at some point, but that eventually they arrive at a common, stable value without necessarily being aware of that. This should work irrespective of the states in which the processes are starting. Our main result is a simple randomized algorithm called median rule that, with high probability, just needs O(logmlog log n + log n) time and work per process to arrive at an almost stable consensus for any set of m legal values as long as an adversary can corrupt the states of at most p n processes at any time. Without adversarial involvement, just O(log n) time and work is needed for a stable consensus, with high probability. As a by-product, we obtain a simple distributed algorithm for approximating the median of n numbers in time O(logmlog log n + log n) under adversarial presence.","lang":"eng"}],"status":"public","has_accepted_license":"1","author":[{"last_name":"Doerr","full_name":"Doerr, Benjamin","first_name":"Benjamin"},{"last_name":"Goldberg","full_name":"Goldberg, Leslie Ann","first_name":"Leslie Ann"},{"first_name":"Lorenz","full_name":"Minder, Lorenz","last_name":"Minder"},{"first_name":"Thomas","full_name":"Sauerwald, Thomas","last_name":"Sauerwald"},{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"date_updated":"2022-01-06T07:03:05Z","_id":"645","year":"2011","page":"149-158","type":"conference","file_date_updated":"2018-03-14T13:58:11Z","publication":"Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","title":"Stabilizing consensus with the power of two choices","date_created":"2017-10-17T12:42:57Z"}