Coordination without prior agreement

Gadi Taubenfeld

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


Assuming that there is an a priori agreement between processes on the names of shared memory locations, as done in almost all the publications on shared memory algorithms, is tantamount to assuming that agreement has already been solved at the lower-level. From a theoretical point of view, it is intriguing to figure out how coordination can be achieved without relying on such lower-level agreement. In order to better understand the new model, we have designed new algorithms without relying on such a priori lower-level agreement, and proved space lower bounds and impossibility results for several important problems, such as mutual exclusion, consensus, election and renaming. Using these results, we identify fundamental differences between the standard model where there is a lower-level agreement about the shared register's names and the strictly weaker model where there is no such agreement.

اللغة الأصليةالإنجليزيّة
عنوان منشور المضيفPODC 2017 - Proceedings of the ACM Symposium on Principles of Distributed Computing
ناشرAssociation for Computing Machinery
عدد الصفحات10
رقم المعيار الدولي للكتب (الإلكتروني)9781450349925
المعرِّفات الرقمية للأشياء
حالة النشرنُشِر - 26 يوليو 2017
منشور خارجيًانعم
الحدث36th ACM Symposium on Principles of Distributed Computing, PODC 2017 - Washington, الولايات المتّحدة
المدة: ٢٥ يوليو ٢٠١٧٢٧ يوليو ٢٠١٧

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

الاسمProceedings of the Annual ACM Symposium on Principles of Distributed Computing
مستوى الصوتPart F129314


!!Conference36th ACM Symposium on Principles of Distributed Computing, PODC 2017
الدولة/الإقليمالولايات المتّحدة

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

Publisher Copyright:
© 2017 Association for Computing Machinery.


أدرس بدقة موضوعات البحث “Coordination without prior agreement'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا