Algorithms for parallel memory allocation
International Journal of Parallel Programming
Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
A methodology for implementing highly concurrent data structures
PPOPP '90 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The impact of time on the session problem
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Low contention load balancing on large-scale multiprocessors
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Contention in shared memory algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Diffracting trees (preliminary version)
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Journal of the ACM (JACM)
Efficiency of semisynchronous versus asynchronous networks
Mathematical Systems Theory
Coins, weights and contention in balancing networks
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Elimination trees and the construction of pools and stacks: preliminary version
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
A combinatorial treatment of balancing networks
Journal of the ACM (JACM)
Counting networks are practically linearizable
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Notes on Sorting and Counting Networks (Extended Abstract)
WDAG '93 Proceedings of the 7th International Workshop on Distributed Algorithms
Linearizable counting networks
Distributed Computing
Counting networks with arbitrary fan-out
Distributed Computing
Contention in balancing networks resolved (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Sequentially consistent versus linearizable counting networks
Proceedings of the eighteenth annual ACM symposium on Principles of 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
Self-tuning reactive diffracting trees
Journal of Parallel and Distributed Computing
Supporting increment and decrement operations in balancing networks
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Obstruction-Free algorithms can be practically wait-free
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Hi-index | 0.00 |
Counting networks form a new class of distributed, low-contention data structures, made up of interconnected balancers and are suitable for solving a variety of multiprocessor synchronization problems that can be expressed as counting problems. A linearizable counting network guarantees that the order of the values it returns respects the real-time order they were requested. Linearizability significantly raises the capabilities of the network, but at a possible price in network size or synchronization support. In this work we further pursue the systematic study of the impact of timing on linearizability for counting networks, along a research line recently initiated by Lynch et al.We consider two basic timing models, the instantaneous balancer model, in which the transition of a token from an input to an output port of a balancer is modeled as an instantaneous event, and the periodic balancer model, where balancers send out tokens at a fixed rate. We also consider lower and upper bounds on the delays incurred by wires connecting the balancers.We present necessary and sufficient conditions for linearizability in the form of precise inequalities that involve timing parameters and identify structural parameters of the counting network, which may be of more general interest. Our results significantly extend and strengthen previous impossibility and possibility results on linearizability in counting networks.