Brief announcement: abortable and query-abortable objects

Authors:
M. K. Aguilera;S. Frolund;V. Hadzilacos;S. L. Horn;S. Toueg
Affiliations:
HP Laboratories, Palo Alto, CA;Gatehouse A/S / work done while author was at HP Laboratories, Denmark;Dept. of Computer Science, University of Toronto, Toronto, ON, Canada;Dept. of Computer Science, University of Toronto, Toronto, ON, Canada;Dept. of Computer Science, University of Toronto, Toronto, ON, Canada
Venue:
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Year:
2006

Citing 3
Cited 0

Wait-free synchronization

ACM Transactions on Programming Languages and Systems (TOPLAS)
Obstruction-Free Synchronization: Double-Ended Queues as an Example

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Computing with reads and writes in the absence of step contention

DISC'05 Proceedings of the 19th international conference on Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The setting for this paper is a distributed system in which asynchronous processes interact by accessing linearizable, wait-free shared objects [2]. The typical task in such a system is to design an implementation of a target object given certain “base objects”. The complexity of such implementations is mostly due to the fact that multiple processes may access the target object concurrently. It has been observed that in some systems contention on shared objects is rare [3]. It is therefore tempting to try to simplify the task of implementing shared objects by allowing them to exhibit degraded behaviour in the (hopefully rare) event of contention.