Time-adaptive algorithms for synchronization

Rajeev Alur, Hagit Attiya, Gadi Taubenfeld

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


We consider concurrent systems in which there is an unknown upper bound on memory access time. Such a model is inherently different from asynchronous model where no such bound exists, and also from timing-baaed models where such a bound exists and is known a priori. The appeal of our model lies in the fact that white it abstracts from implementation details, it is a better approximation of real concurrent systems compared to the asynchronous model. Furthermore, it is stronger than the asynchronous model enabling us to design algorithms for problems that are unsolvable in the asynchronous model. Two basic synchronization problems, consensus and mutual exclusion, are investigated in a shared memory environment that supports atomic registers. We show that Θ(Δ ,logΔ/loglogΔ ) is an upper and lower bound on the time complexity of any consensus algorithm, where A is the (unknown) upper bound on memory access time. For the mutual exclusion problem, we design an efficient algorithm that takes advantage of the fact that some upper bound on memory access time exists. The solutions for both problems are even more efficient in the absence of contention, in which case their time complexity is a con- Stant.

שפה מקוריתאנגלית
כותר פרסום המארחProceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC 1994
מוציא לאורAssociation for Computing Machinery
מספר עמודים10
מסת"ב (אלקטרוני)0897916638
מזהי עצם דיגיטלי (DOIs)
סטטוס פרסוםפורסם - 23 מאי 1994
פורסם באופן חיצוניכן
אירוע26th Annual ACM Symposium on Theory of Computing, STOC 1994 - Montreal, קנדה
משך הזמן: 23 מאי 199425 מאי 1994

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

שםProceedings of the Annual ACM Symposium on Theory of Computing
כרךPart F129502
ISSN (מודפס)0737-8017


כנס26th Annual ACM Symposium on Theory of Computing, STOC 1994

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

Publisher Copyright:
© 1994 ACM.

טביעת אצבע

להלן מוצגים תחומי המחקר של הפרסום 'Time-adaptive algorithms for synchronization'. יחד הם יוצרים טביעת אצבע ייחודית.

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