• 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

Room Synchronizations (2001)

Cached

  • Download as a PDF

Download Links

  • [www.pittsburgh.intel-research.net]
  • [www.cs.cmu.edu]
  • [www-2.cs.cmu.edu]
  • [www-2.cs.cmu.edu]
  • [www.cs.cmu.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Guy E. Blelloch , Perry Cheng , Phillip B. Gibbons
Citations:6 - 3 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Blelloch01roomsynchronizations,
    author = {Guy E. Blelloch and Perry Cheng and Phillip B. Gibbons},
    title = {Room Synchronizations },
    year = {2001}
}

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

We present a class of synchronization called room synchronizations and show how this class can be used to implement asynchronous parallel queues and stacks with constant time access (assuming a fetch-and-add operation). The room synchronization problem involves supporting a set of m mutually exclusive "rooms" where any number of users can execute code simultaneously in any one of the rooms, but no two users can simultaneously execute code in separate rooms. Users asynchronously request permission to enter specified rooms, and neither the arrival time nor the arrival order nor the desired room of such requests are known ahead of time. We describe an algorithm for room synchronizations, and prove it satisfies a number of desirable properties. We have implemented our algorithm on a Sun UltraEnterprise 10000 multiprocessor. We present experimental results comparing an implementation of a parallel stack using room synchronizations to one using locks, demonstrating a significant scalability advantage for room synchronizations.

Citations

1311 Distributed Algorithms - Lynch - 1996
1016 A Bridging Model for Parallel Computation - Valiant - 1990
774 Linearizability: A correctness condition for concurrent objects - Herlihy, Wing - 1990
660 Wait-free synchronization - Herlihy - 1991
597 Transactional Memory: Architectural Support for Lock-Free Data Structures. Digital Cambridge Research Lab - Herlihy, Moss - 1992
414 Software transactional memory - Shavit, Touitou - 1995
191 A New Solution of Dijkstra's Concurrent Programming Problem - Lamport - 1974
97 practical nonblocking and blocking concurrent queue algorithms - Simple - 1996
84 Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential Processors - Gottlieb, Lubachevsky, et al. - 1983
80 A parallel, real-time garbage collector - Cheng, Blelloch - 2001
80 Linearizable concurrent objects - Herlihy, Wing - 1988
71 Systems programming: Coping with parallelism - Treiber - 1986
61 A method for implementing lock-free shared data structures - Barnes - 1993
58 Lock-free data structures - Valois - 1995
55 Non-blocking synchronization and system design - Greenwald - 1999
49 Implementing lock-free queues - Valois - 1994
41 Can a shared-memory model serve as a bridging model for parallel computation - Gibbons, Matias, et al. - 1997
38 Lock-free garbage collection on multiprocessors - HERLIHY, MOSS - 1992
37 Elimination trees and the construction of pools and stacks - SHAVIT, TOUITOU - 1997
33 Effective Fine-Grained Synchronization for Automatically Parallelized Programs Using Optimistic Synchronization Primitives - Rinard - 1999
28 A Borodin. Distributed fifo allocation of identical resources using small shared space - Fischer, Lynch, et al. - 1989
23 On bounding time and space for multiprocessor garbage collection - Blelloch, Cheng - 1999
14 Basic Techniques for the E cient Coordination of Very Large - Gottleib, Lubachevsky, et al. - 1983
9 Combining funnels - Shavit, Zemach - 1998
5 Steele Jr. DCAS-based concurrent deques - Agesen, Detlefs, et al. - 2000
1 Can a shared-memorymodelserve as a bridging model for parallel computation - Gibbons, Matias, et al. - 1999
1 E ective ne-grain synchronization for automatically parallelized programs using optimistic synchronization primitives - Rinard - 1999
1 Distributed FIFO allocationofidentical resources using small shared space - Fischer, Lynch, et al. - 1989
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