Sorting and counting networks of small depth and arbitrary width

Authors:
Costas Busch;Maurice Herlihy
Affiliations:
Computer Science Department, Brown University, Providence, RI;Computer Science Department, Brown University, Providence, RI
Venue:
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Year:
1999

Sorting in c log n parallel steps

Combinatorica
The periodic balanced sorting network

Journal of the ACM (JACM)
Introduction to algorithms

Introduction to algorithms
Counting networks

Journal of the ACM (JACM)
Contention in counting networks

PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
A Multiway Merge Sorting Network

IEEE Transactions on Parallel and Distributed Systems
Small-depth counting networks and related topics

Small-depth counting networks and related topics
Counting networks are practically linearizable

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Sequentially consistent versus linearizable counting networks

Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
The Impact of Timing on Linearizability in Counting Networks

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Counting networks with arbitrary fan-out

Distributed Computing

Hi-index	0.00