Conflict-free sorting algorithms under single-channel and multi-channel broadcast communication models
- 1 January 1991
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Parallel graph algorithms based upon broadcast communicationsIEEE Transactions on Computers, 1990
- Distributed sorting on local area networksIEEE Transactions on Computers, 1988
- Broadcast Communications and Distributed AlgorithmsIEEE Transactions on Computers, 1986
- Tight Bounds on the Complexity of Parallel SortingIEEE Transactions on Computers, 1985
- A taxonomy of parallel sortingACM Computing Surveys, 1984
- Log-logarithmic protocols for resolving ethernet and semaphore conflictsPublished by Association for Computing Machinery (ACM) ,1984
- New Parallel-Sorting SchemesIEEE Transactions on Computers, 1978
- Optimal Sorting Algorithms for Parallel ComputersIEEE Transactions on Computers, 1978
- Parallel Processing with the Perfect ShuffleIEEE Transactions on Computers, 1971
- Sorting networks and their applicationsPublished by Association for Computing Machinery (ACM) ,1968