William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou  Home/Search
Context Related
| uchicago.edu/articles/2002...cj0004.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: uchicago.edu/articles/...contents (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Counting networks are a class of distributed data structures that support highly concurrent implementations of shared Fetch&Increment counters. Applications of these counters include shared pools and stacks, load balancing, and software barriers. A limitation of counting networks is that the resulting shared counters can be incremented, but not decremented. (Update)
Context of citations to this paper: More
...operation named antitoken that represents the request for an increment of 1. Aiello, Busch, Herlihy, Mavronicolas, Shavit, and Touitou [2] generalized this result and showed that any counting network can support the decrement operation (including networks that use arbitrary...
Cited by: More
The Cost of Concurrent, Low-Contention Read-Modify-Write - Busch, Mavronicolas, Spirakis (Correct)
The Cost of Concurrent, Low-Contention Read&Modify&Write - Busch, Mavronicolas, Spirakis (2003) (Correct)
A Scalable Elimination-based Exchange Channel - III, Lea, Scott (2005) (Correct)
Similar documents (at the sentence level):
46.0%: Supporting Increment and Decrement Operations in.. - Aiello, Busch.. (1998) (Correct)
Active bibliography (related documents): More All
0.9: A Survey on Counting Networks - Busch, Herlihy (Correct)
0.7: Contention in Balancing Networks Resolved (Extended Abstract) - Hadjimitsis, Mavronicolas (1998) (Correct)
0.5: A Combinatorial Characterization of Properties Preserved by.. - Busch, al. (2000) (Correct)
Similar documents based on text: More All
0.6: Threshold Counters with Increments and Decrements - Busch, Demetriou, Herlihy.. (1999) (Correct)
0.5: A Combinatorial Treatment of Balancing Networks - Busch, Mavronicolas (1995) (Correct)
0.5: Proving Correctness for Balancing Networks - Busch, Mavronicolas (1995) (Correct)
Related documents from co-citation: More All
6: Counting Networks - Aspnes, Herlihy et al. - 1994
5: Linearizable Counting Networks - Herlihy, Shavit et al. - 1991
4: Contention in Shared Memory Algorithms - Dwork, Herlihy et al. - 1993
BibTeX entry: (Update)
W. Aiello, C. Busch, M. Herlihy, M. Mavronicolas, N. Sha D. Touitou, "Supporting Increment and Decrement Operations in B Networks," Proceedings of the 16th International Symposium on T cal Aspects of Computer Science, G. Meinel and S. Tison eds., pp. 3 Vol. 1563, Lecture Notes in Computer Science, Springer-Verlag, Tr many, March 1999. http://citeseer.ist.psu.edu/aiello00supporting.html More
@article{ aiello99supporting,
author = "William Aiello and Costas Busch and Maurice Herlihy and Marios Mavronicolas and Nir Shavit and Dan Touitou",
title = "Supporting Increment and Decrement Operations in Balancing Networks",
journal = "Lecture Notes in Computer Science",
volume = "1563",
pages = "393--403",
year = "1999",
url = "citeseer.ist.psu.edu/aiello00supporting.html" }
Citations (may not include all citations):3972 Introduction to algorithms (context) - Cormen, Leiserson et al. - 1992
334 Operating System Concepts (context) - Silberschatz, Galvin - 1994
210 Cooperating sequential processes (context) - Dijkstra - 1968
142 Solution of a problem in concurrent programming control (context) - Dijkstra - 1965
49 Operating System Principles (context) - Hansen - 1973
44 Small-depth counting networks - Klugerman, Plaxton - 1992
43 Counting networks - Aspnes, Herlihy et al. - 1994
42 Elimination trees and the construction of pools and stacks - Shavit, Touitou - 1997
33 Building counting networks from larger balancers - Felten, LaMarca et al. - 1993
32 Counting networks with arbitrary fan-out (context) - Aharonson, Attiya - 1995
22 Notes on sorting and counting networks (context) - Hardavellas, Karakos et al. - 1993
18 ACM Transactions on Computer Systems (context) - Shavit, Zemach et al. - 1996
17 ACM Transactions on Computer Systems (context) - Herlihy, Lim et al. - 1995
14 Contention in counting networks - Busch, Hardavellas et al. - 1994
14 weights and contention in balancing networks (context) - Aiello, Venkatesan et al. - 1994
12 Counting networks are practically linearizable - Lynch, Shavit et al. - 1996
10 The impact of timing on linearizability in counting networks - Mavronicolas, lou et al. - 1997
8 Small-Depth Counting Networks and Related Topics - Klugerman - 1994
7 The strength of counting networks (context) - Busch, Mavronicolas - 1996
7 Impossibility results for weak threshold networks - Busch, Mavronicolas - 1997
6 low contention task allocation (context) - Kapidakis, Mavronicolas - 1996
5 Operating Systems Techniques (context) - Hoare, Periott - 1972
4 and \writers (context) - Courtois, Heymans et al. - 1971
3 An ecient counting network (context) - Busch, Mavronicolas - 1998
2 Sorting and counting networks of small-depth and arbitrary w.. (context) - Busch, Herlihy - 1999
2 Incdec counting network (context) - Shavit, dec et al. - 1995
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