Sequentially consistent versus linearizable counting networks

Authors:
Marios Mavronicolas;Michael Merritt;Gadi Taubenfeld
Affiliations:
Department of Computer Science and Engineering, University of Connecticut, Storrs, CT;AT&T Labs - Research, 180 Park Avenue, Florham Park, NJ;The Open University, 16 Klausner St., Tel-Aviv 61392, Israel
Venue:
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Year:
1999

Citing 16
Cited 5

Linearizability: a correctness condition for concurrent objects

ACM Transactions on Programming Languages and Systems (TOPLAS)
Small-depth counting networks

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Sequential consistency versus linearizability

ACM Transactions on Computer Systems (TOCS)
Counting networks

Journal of the ACM (JACM)
Coins, weights and contention in balancing networks

PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Contention in counting networks

PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Concurrent counting

Journal of Computer and System Sciences
Counting networks are practically linearizable

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
A lower bound on wait-free counting

Journal of Algorithms
The Impact of Timing on Linearizability in Counting Networks

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Efficient, Strongly Consistent Implementations of Shared Memory (Extended Abstract)

WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Notes on Sorting and Counting Networks (Extended Abstract)

WDAG '93 Proceedings of the 7th International Workshop on Distributed Algorithms
An Efficient Counting Network

IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Public data structures: counters as a special case

ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Linearizable counting networks

Distributed Computing
Counting networks with arbitrary fan-out

Distributed Computing

Sorting and counting networks of small depth and arbitrary width

Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Public data structures: counters as a special case

Theoretical Computer Science
Adding Networks

DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Read-modify-write networks

Distributed Computing
A case for relativistic programming

Proceedings of the 2012 ACM workshop on Relaxing synchronization for multicore and manycore scalability

Quantified Score

Hi-index	0.01

Sequentially consistent versus linearizable counting networks

Quantified Score

Visualization

Abstract