Nir Shavit, Dan Touitou  Home/Search
Context Related
| brown.edu/courses/cs295h/shavit95.ps mit.edu/~shanir/st95.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: brown.edu/courses/cs295h/ (more) From: mit.edu/tds/reflist (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Shared pools and stacks are two coordination structures with a history of applications ranging from simple producer /consumer buffers to job-schedulers and procedure stacks. This paper introduces elimination trees, a novel form of diffracting trees that offer pool and stack implementations with superior response (on average constant) under high loads, while guaranteeing logarithmic time "deterministic " termination under sparse request patterns. 1 Introduction As multiprocessing breaks away... (Update)
Context of citations to this paper: More
...every c2 time units according to some global clock. A common structuring property of almost all published counting networks [2 4, 9 12, 15, 18, 17,23,24] is uniformity: each balancer of the network lies on some path from inputs to outputs, and all paths from inputs to outputs...
Cited by: More
A Steady State Analysis of Diffracting - Trees Nir Shavit (Correct)
The Cost of Concurrent, Low-Contention Read-Modify-Write - Busch, Mavronicolas, Spirakis (Correct)
Supporting Increment and Decrement Operations in.. - Aiello, Busch.. (2000) (Correct)
Similar documents (at the sentence level):
51.7%: Elimination Trees and the Construction of Pools and Stacks - Shavit, Touitou (1996) (Correct)
Active bibliography (related documents): More All
0.4: Diffracting Trees - Shavit, Zemach (1995) (Correct)
0.3: Counting Networks - Aspnes (1994) (Correct)
0.1: Semantics-Based Optimization under Epsilon Serializability - Hseush (1995) (Correct)
Similar documents based on text: More All
0.2: Reactive Diffracting Trees - Della-Libera, Shavit (1997) (Correct)
0.1: Counting Networks are Practically Linearizable - Lynch, Shavit, Shvartsman.. (1996) (Correct)
0.1: A Steady State Analysis of Diffracting Trees - Shavit, Upfal, Zemach (1997) (Correct)
Related documents from co-citation: More All
24: Small-Depth Counting Networks - Klugerman - 1994
23: Linearizability: A correctness condition for concurrent objects (context) - Herlihy, Wing - 1992
20: Counting Networks - Aspnes, Herlihy et al. - 1994
BibTeX entry: (Update)
Nir Shavit and Dan Touitou. Elimination trees and the construction of pools and stacks. In SPAA'95: 7th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 54--63, Santa Barbara, California, July 1995. Also, Tel-Aviv University Technical Report, January 1995. http://citeseer.ist.psu.edu/article/shavit95elimination.html More
@inproceedings{ shavit95elimination,
author = "Nir Shavit and Dan Touitou",
title = "Elimination Trees and the Construction of Pools and Stacks (Preliminary Version)",
booktitle = "{ACM} Symposium on Parallel Algorithms and Architectures",
pages = "54-63",
year = "1995",
url = "citeseer.ist.psu.edu/article/shavit95elimination.html" }
Citations (may not include all citations):326 Linearizability: A correctness condition for concurrent obje.. (context) - Herlihy, Wing
293 Hierarchical Correctness Proofs for Distributed Algorithms - Lynch, Tuttle - 1987
197 The Performance of Spin Lock Alternatives for Shared-Memory .. (context) - Anderson - 1990
191 The MIT Alewife Machine: A LargeScale Distributed-Memory Mul.. - Agarwal - 1991
173 Hot Spot' contention and combining in multistage interconnec.. (context) - Pfister, Norton - 1985
150 Proteus: A High-Performance ParallelArchitecture Simulator - Brewer, Dellarocas et al. - 1991
112 Efficient Synchronization Primitives for Large-Scale CacheCo.. (context) - Goodman, Vernon et al. - 1989
52 A Simple Load Balancing Scheme for Task Allocation in Parall.. - Rudolph, Slivkin et al. - 1991
43 Counting Networks - Aspnes, Herlihy et al. - 1994
42 An Efficient Implementation Scheme of Concurrent Object-Orie.. - Taura, Matsuoka et al. - 1993
35 Diffracting Trees - Shavit, Zemach - 1994
28 A Dynamic Distributed Load Balancing Algorithm with Provable.. - Luling, Monien - 1993
28 Low Contention Load Balancing on Large Scale Multiprocessors (context) - Herlihy, Lim et al. - 1992
19 Processing 'hot spots' in high performance systems (context) - Gawlick - 1985
15 A Formal Characterization of Epsilon Serializability - Ramamrithan, Pu - 1994
4 Sheduling Multithreaded Computations by Work Stealing (context) - Blumofe, Leiserson - 1994
4 Scott Synchronization without Contention (context) - Mellor-Crummey - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://wilma.cs.brown.edu/courses/cs295h/): More
Software Transactional Memory - Shavit (1995) (Correct)
Scalable Concurrent Counting - Herlihy, Lim, Shavit (1994) (Correct)
Proving Correctness for Balancing Networks - Busch, Mavronicolas (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC