Advertisement

Brief Announcement: Abortable and Query-Abortable Objects

  • M. K. Aguilera
  • S. Frolund
  • V. Hadzilacos
  • S. L. Horn
  • S. Toueg
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4167)

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.

Keywords

Target Object Base Object Shared Object Desirable Behaviour System Contention 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Attiya, H., Guerraoui, R., Kouznetsov, P.: Computing with reads and writes in the absence of step contention. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 122–136. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  2. 2.
    Herlihy, M.: Wait-free synchronization. ACM Transactions on Programming Languages and Systems (TOPLAS) 13(1), 124–149 (1991)CrossRefGoogle Scholar
  3. 3.
    Herlihy, M., Luchangco, V., Moir, M.: Obstruction-free synchronization: Double-ended queues as an example. In: Proc. of ICDCS 2003, Washington, DC, USA, pp. 522–529 (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • M. K. Aguilera
    • 1
  • S. Frolund
    • 2
  • V. Hadzilacos
    • 3
  • S. L. Horn
    • 3
  • S. Toueg
    • 3
  1. 1.HP LaboratoriesPalo AltoUSA
  2. 2.Gatehouse A/S ; work done while author was at HP LaboratoriesDenmark
  3. 3.Dept. of Computer ScienceUniversity of TorontoTorontoCanada

Personalised recommendations