Waiting in concurrent algorithms

Gadi Taubenfeld

نتاج البحث: نشر في مجلةمقالةمراجعة النظراء


Between the two extremes, lock-based algorithms, which involve “a lot of waiting”, and wait-free algorithms, which are “free of locking and waiting”, there is an interesting spectrum of different levels of waiting. This unexplored spectrum is formally defined and its properties are investigated. New progress conditions, called k-waiting, for k≥ 0 , which are intended to capture the “amount of waiting” of processes in asynchronous concurrent algorithms, are introduced. To illustrate the utility of the new conditions, they are used to derive new lower and upper bounds, and impossibility results for well-known basic problems such as consensus, election, renaming and mutual exclusion. Furthermore, the relation between waiting and fairness is explored.

اللغة الأصليةالإنجليزيّة
الصفحات (من إلى)39-57
عدد الصفحات19
دوريةComputing (Vienna/New York)
مستوى الصوت101
رقم الإصدار1
المعرِّفات الرقمية للأشياء
حالة النشرنُشِر - 17 يناير 2019
منشور خارجيًانعم

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

Publisher Copyright:
© 2018, Springer-Verlag GmbH Austria, part of Springer Nature.


أدرس بدقة موضوعات البحث “Waiting in concurrent algorithms'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا