Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions

Maurice P. Herlihy, Yoram Moses, Mark R. Tuttle

פרסום מחקרי: פרק בספר / בדוח / בכנספרסום בספר כנסביקורת עמיתים

תקציר

Decision tasks require that nonfaulty processes make decisions based on their input values. Simultaneous decision tasks require that nonfaulty processes decide in the same round. Most decision tasks have known worst-case lower bounds. Most also have known worst-case optimal protocols that halt in the number of rounds given by the worst-case lower bound, and some have early-stopping protocols that can halt earlier than the worst-case lower bound (sometimes in as early as two rounds). We consider what might be called earliest-possible protocols for simultaneous decision tasks. We present a new technique that converts worst-case optimal decision protocols into all-case optimal simultaneous decision protocols: For every behavior of the adversary, the all-case optimal protocol decides as soon as any protocol can decide in a run with the same adversarial behavior. Examples to which this can be applied include set consensus, condition-based consensus, renaming and order-preserving renaming. Some of these tasks can be solved significantly faster than the classical simultaneous consensus task. A byproduct of the analysis is a proof that improving on the worst-case bound for any simultaneous task by even a single round is as hard as reaching simultaneous consensus.

שפה מקוריתאנגלית
כותר פרסום המארחPODC'11 - Proceedings of the 2011 ACM Symposium Principles of Distributed Computing
עמודים231-238
מספר עמודים8
מזהי עצם דיגיטלי (DOIs)
סטטוס פרסוםפורסם - 2011
אירוע30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC'11, Held as Part of the 5th Federated Computing Research Conference, FCRC - San Jose, CA, ארצות הברית
משך הזמן: 6 יוני 20118 יוני 2011

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

שםProceedings of the Annual ACM Symposium on Principles of Distributed Computing

כנס

כנס30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC'11, Held as Part of the 5th Federated Computing Research Conference, FCRC
מדינה/אזורארצות הברית
עירSan Jose, CA
תקופה6/06/118/06/11

ASJC Scopus subject areas

  • ???subjectarea.asjc.1700.1712???
  • ???subjectarea.asjc.1700.1708???
  • ???subjectarea.asjc.1700.1705???

טביעת אצבע

להלן מוצגים תחומי המחקר של הפרסום 'Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions'. יחד הם יוצרים טביעת אצבע ייחודית.

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