• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

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]
  • [wiki.cs.unm.edu]
  • [www.net.t-labs.tu-berlin.de]
  • [www.net.t-labs.tu-berlin.de]
  • [www.cs.auckland.ac.nz]
  • [www.cs.auckland.ac.nz]
  • [web.cse.msu.edu]
  • [www.cs.msu.edu]
  • [www.cse.msu.edu]
  • [web.cs.msu.edu]
  • [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]
  • [cs.brown.edu]
  • [cs.brown.edu]
  • [www.eecs.wsu.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Maurice Herlihy , Victor Luchangco , Mark Moir , William N. Scherer III
Venue:IN PROCEEDINGS OF THE 22ND ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING
Citations:432 - 25 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Herlihy03softwaretransactional,
    author = {Maurice Herlihy and Victor Luchangco and Mark Moir and William N. Scherer III},
    title = {Software transactional memory for dynamic-sized data structures},
    booktitle = {IN PROCEEDINGS OF THE 22ND ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING},
    year = {2003},
    publisher = {}
}

Share

Facebook Twitter Reddit Bibsonomy

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 efficient 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 difficult 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 effective use of modular contention managers.

Keyphrases

dynamic-sized data structure    software transactional memory    modular contention manager    straightforward implementation    simple preliminary performance experiment    sophisticated non-blocking dynamic data structure    novel non-blocking implementation    obstruction-free red-black tree    new form    efficient implementation    non-blocking property    obstruction-free stm implementation    novel feature    effective use    early release feature    dynamic stm   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

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

© 2007-2019 The Pennsylvania State University