Linearizable counting networks
- 1 February 1996
- journal article
- Published by Springer Nature in Distributed Computing
- Vol. 9 (4) , 193-203
- https://doi.org/10.1007/s004460050019
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Diffracting treesACM Transactions on Computer Systems, 1996
- Scalable concurrent countingACM Transactions on Computer Systems, 1995
- Counting networksJournal of the ACM, 1994
- Introduction to AlgorithmsJournal of the Operational Research Society, 1991
- Algorithms for scalable synchronization on shared-memory multiprocessorsACM Transactions on Computer Systems, 1991
- Linearizability: a correctness condition for concurrent objectsACM Transactions on Programming Languages and Systems, 1990
- The mutual exclusion problemJournal of the ACM, 1986
- Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential ProcessorsACM Transactions on Programming Languages and Systems, 1983
- The serializability of concurrent database updatesJournal of the ACM, 1979
- A new solution of Dijkstra's concurrent programming problemCommunications of the ACM, 1974