The periodic balanced sorting network
Journal of the ACM (JACM)
Introduction to algorithms
Low contention linearizable counting
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Low contention load balancing on large-scale multiprocessors
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
A lower bound on wait-free counting
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Journal of the ACM (JACM)
A combinatorial treatment of balancing networks
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
The Performance of Spin Lock Alternatives for Shared-Memory Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Notes on Sorting and Counting Networks (Extended Abstract)
WDAG '93 Proceedings of the 7th International Workshop on Distributed Algorithms
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A combinatorial treatment of balancing networks
Journal of the ACM (JACM)
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
Threshold counters with increments and decrements
Theoretical Computer Science
The Impact of Timing on Linearizability in Counting Networks
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
A Combinatorial Characterization of Properties Preserved by Antitokens
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Self-Stabilizing Smoothing and Counting
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Distributed Computing
Recursive construction of parallel distribution networks
Journal of Parallel and Distributed Computing
A randomized, o(log w)-depth 2 smoothing network
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Supporting increment and decrement operations in balancing networks
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Theoretical Computer Science
Periodic load balancing on the N-cycle: analytical and experimental evaluation
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Elimination Trees and the Construction of Pools and Stacks
Theory of Computing Systems
| Hi-index | 0.00 |
It is shown that an acyclic smoothing network (and hence counting network) with fan-out n cannot be constructed from balancers of fan-out b1,..., bk, if there exists a prime factor p of n, such that p does not divide bi, for all i, 1 ≤ i ≤ k. This holds regardless of the depth, fan-in or size of the network, as long as they are finite. On the positive side, a simple construction of cyclic counting networks with fan-out n, for arbitrary n, is presented. An acyclic counting network with fan-in and fan-out p2k, for any integer k ≥ 0, is constructed out of 2-balancers and p-balancers.