Fully Anonymous Consensus and Set Agreement Algorithms

Michel Raynal, Gadi Taubenfeld

نتاج البحث: فصل من :كتاب / تقرير / مؤتمرمنشور من مؤتمرمراجعة النظراء


Process anonymity has been studied for a long time. Memory anonymity is more recent. In an anonymous memory system, there is no a priori agreement among the processes on the names of the shared registers they access. As an example, a shared register named A by a process p and a shared register named B by another process q may correspond to the very same register X, while the same name C may correspond to different shared registers for the processes p and q. This article focuses on solving the consensus and set agreement problems in the fully anonymous model, namely a model in which both the processes and the registers are anonymous. It is shown that consensus, and its weak version called set agreement, can be solved despite full anonymity, in the presence of any number of process crashes. As far as we know, this is the first time where non-trivial concurrency-related problems are solved in such a strong anonymity context. A noteworthy property of the proposed algorithms lies in their conceptual simplicity.

اللغة الأصليةالإنجليزيّة
عنوان منشور المضيفNetworked Systems - 8th International Conference, NETYS 2020, Proceedings
المحررونChryssis Georgiou, Rupak Majumdar
ناشرSpringer Science and Business Media Deutschland GmbH
عدد الصفحات15
رقم المعيار الدولي للكتب (المطبوع)9783030670863
المعرِّفات الرقمية للأشياء
حالة النشرنُشِر - 2021
منشور خارجيًانعم
الحدث8th International Conference on Networked Systems, NETYS 2020 - Marrakech, المغرب
المدة: ٣ يونيو ٢٠٢٠٥ يونيو ٢٠٢٠

سلسلة المنشورات

الاسمLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
مستوى الصوت12129 LNCS
رقم المعيار الدولي للدوريات (المطبوع)0302-9743
رقم المعيار الدولي للدوريات (الإلكتروني)1611-3349


!!Conference8th International Conference on Networked Systems, NETYS 2020

ملاحظة ببليوغرافية

Publisher Copyright:
© 2021, Springer Nature Switzerland AG.


أدرس بدقة موضوعات البحث “Fully Anonymous Consensus and Set Agreement Algorithms'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا