Costas Busch, Marios Mavronicolas, Paul Spirakis  Home/Search
Context
Related
| rpi.edu/~buschc/papers/rmw.pdf Cached: 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.
PS.gz PS Image Update HelpFrom: rpi.edu/~buschc/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this work, we embark on a study of the possibility (or impossibility), and the corresponding costs, of devising concurrent, low-contention implementations of atomic Read-Modify-Write operations (abbreviated as RMW), in a distributed system. We consider a natural class of RMW operations which give rise to a certain class of algebraic groups that we introduce here and call monotone groups. Our chief combinatorial instrument is a Monotone Linearizability Lemma, which establishes inherent... (Update)
Active bibliography (related documents): More All
0.6: A Combinatorial Characterization of Properties Preserved by.. - Busch, al. (2000) (Correct)
0.5: The Cost of Concurrent, Low-Contention Read&Modify&Write - Busch, Mavronicolas, Spirakis (2003) (Correct)
0.5: Supporting Increment and Decrement Operations in.. - Aiello, Busch.. (2000) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ busch-cost,
author = "Costas Busch and Marios Mavronicolas and Paul Spirakis",
title = "The Cost of Concurrent, Low-Contention Read-Modify-Write",
url = "citeseer.ist.psu.edu/751075.html" }
Citations (may not include all citations):718 Distributed Algorithms (context) - Lynch - 1996
606 How to Make a Multiprocessor Computer that Correctly Execute.. (context) - Lamport - 1979
326 Linearizability: A Correctness Condition for Concurrent Obje.. (context) - Herlihy, Wing - 1990
58 Contention in Shared Memory Algorithms - Dwork, Herlihy et al. - 1997
56 Distributed Computing: Fundamentals (context) - Attiya, Welch - 1998
43 Counting Networks - Aspnes, Herlihy et al. - 1994
42 Elimination Trees and the Construction of Pools and Stacks - Shavit, Touitou - 1997
28 A Combinatorial Treatment of Balancing Networks - Busch, Mavronicolas - 1996
24 Linearizable Counting Networks - Herlihy, Shavit et al. - 1996
12 Chelsea Publishing Company (context) - Hall, Theory et al. - 1979
7 Supporting Increment and Decrement Operations in Balancing N.. - Aiello, Busch et al. - 2000
7 An Inherent Bottleneck in Distributed Counting - Wattenhofer, Widmayer - 1998
6 E#cient Synchronization on Multiprocessors with Shared Memor.. (context) - Kruskal, Rudolph et al. - 1986
3 Adding Networks (context) - Fatourou, Herlihy - 2001
3 E#cient Synchronization Primitives for Large-Scale, Cache-Co.. (context) - Goodman, Vernon et al. - 1989
2 Sequentially Consistent versus Linearizable Counting Network.. (context) - Mavronicolas, Merritt et al. - 1999
2 Sorting and Counting Networks of Small Depth and Arbitrary W.. (context) - Busch, Herlihy - 2002
1 Timing Conditions for Linearizability in Uniform Counting Ne.. - Lynch, Shavit et al. - 1999
1 Ordered Multicast and Distributed Swap - Herlihy, Tirthapura et al. - 2001
Documents on the same site (http://www.cs.rpi.edu/~buschc/papers.html): More
Analysis of Link Reversal Routing Algorithms for.. - Busch, Surapaneni.. (2003) (Correct)
Atomic Routing Games on Maximum Congestion - Busch, Magdon-Ismail (Correct)
Direct Routing: Algorithms and Complexity - Busch, Magdon-Ismail.. (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