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
מזהי עצם דיגיטלי (DOIs)
סטטוס פרסוםפורסם - 2021
פורסם באופן חיצוניכן
אירוע8th International Conference on Networked Systems, NETYS 2020 - Marrakech, מרוקו
משך הזמן: 3 יוני 20205 יוני 2020

סדרות פרסומים

שםLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
כרך12129 LNCS
ISSN (מודפס)0302-9743
ISSN (אלקטרוני)1611-3349


כנס8th International Conference on Networked Systems, NETYS 2020

הערה ביבליוגרפית

Publisher Copyright:
© 2021, Springer Nature Switzerland AG.

טביעת אצבע

להלן מוצגים תחומי המחקר של הפרסום 'Fully Anonymous Consensus and Set Agreement Algorithms'. יחד הם יוצרים טביעת אצבע ייחודית.

פורמט ציטוט ביבליוגרפי