• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Software Transactional Memory for Dynamic-Sized Data Structures (2003)

Cached

  • Download as a PDF

Download Links

  • [www.distcomp.ethz.ch]
  • [dcg.ethz.ch]
  • [disco.ethz.ch]
  • [distcomp.ethz.ch]
  • [www.dcg.ethz.ch]
  • [www.cs.rochester.edu]
  • [www.cs.rice.edu]
  • [research.sun.com]
  • [research.sun.com]
  • [www.cs.brown.edu]
  • [www.cs.brown.edu]
  • [www.sun.com]

  • Other Repositories/Bibliography

  • CiteULike
  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Maurice Herlihy , Victor Luchangco , Mark Moir
Citations:274 - 21 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Herlihy03softwaretransactional,
    author = {Maurice Herlihy and Victor Luchangco and Mark Moir},
    title = {Software Transactional Memory for Dynamic-Sized Data Structures},
    booktitle = {},
    year = {2003},
    pages = {92--101},
    publisher = {ACM Press}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

We propose a new form of software transactional memory (STM) designed to support dynamic-sized data structures, and we describe a novel non-blocking implementation. The non-blocking property we consider is obstruction-freedom. Obstruction-freedom is weaker than lock-freedom; as a result, it admits substantially simpler and more e#cient implementations. A novel feature of our obstruction-free STM implementation is its use of modular contention managers to ensure progress in practice. We illustrate the utility of our dynamic STM with a straightforward implementation of an obstruction-free red-black tree, thereby demonstrating a sophisticated non-blocking dynamic data structure that would be di#cult to implement by other means. We also present the results of simple preliminary performance experiments that demonstrate that an "early release" feature of our STM is useful for reducing contention, and that our STM lends itself to the e#ective use of modular contention managers.

Citations

7321 Introduction to Algorithms - Cormen, Leiserson, et al. - 2001
774 Linearizability: A correctness condition for concurrent objects - Herlihy, Wing - 1990
597 Transactional Memory: Architectural Support for Lock-Free Data Structures. Digital Cambridge Research Lab - Herlihy, Moss - 1992
414 Software transactional memory - Shavit, Touitou - 1995
150 Obstruction-Free Synchronization: Double-Ended Queues as an Example - Herlihy, Luchangco, et al. - 2003
91 Concurrency of operations on B-trees - Bayer, Schkolnick - 1977
81 Disjoint-access-parallel implementations of strong shared memory primitives - ISRAELI, RAPPOPORT - 1994
65 M.L.: Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors - Michael, Scott - 1998
53 Wait-free made fast - Afek, Dauber, et al. - 1995
48 Transparent support for wait-free transactions - Moir - 1997
37 S.: Locking without blocking: making lock based concurrent data structure algorithms nonblocking - Turek, Shasha, et al. - 1992
13 Nonblocking k-compare-single-swap - Luchangco, Moir, et al. - 2003
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University