Load balancing, selection and sorting on the hypercube

Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989

Volumn , Issue , 1989, Pages 64-73

  Plaxton, C Greg ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PARALLEL ALGORITHMS;

ASYMPTOTIC BOUNDS; CONSTANT FACTORS; HYPERCUBE; N VALUE; SELECTION ALGORITHM; SORTING ALGORITHM;

PARALLEL ARCHITECTURES;

EID: 85034027711     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/72935.72943     Document Type: Conference Paper

References (18)

1. A. Aggarwal and M.-D. A. Huang. Network complexity of sorting and graph problems and sim-ulating CRCW PRAMs by interconnection networks. In J. H. Reif, editor, Lecture Notes in Computer Science: VLSI Algorithms and Architectures (A WOC 88), vol. 319, pages 339-350. Springer- Verlag, 1988.
2. K. E. Batcher. Sorting networks and their applications. In Proc. AFIPS Spring Joint Summer Computer Conference, vol. 32, pages 307-314, 1968.
3. G. Baudet and D. Stevenson. Optimal sorting algorithms for parallel computers. IEEE Transactions on Computers, C-27:84-87, 1978.
4. A. Borodin, L. J. Guibas, N. A. Lynch, and A. C. Yao. Efficient searching using partial ordering. Information Processing Letters, 12:71-75, 1981.
5. R. E. Cypher and J. L. C. Sanz. Optimal sorting on reduced architectures. In Proc. International Conference on Parallel Processing, vol. 3, pages 308-311, 1988.
6. P. Frankl and Z. Fiiredi. A short proof for a theorem of Harper about Hamming spheres. Discrete Mathematics, 34:311-313, 1981.
7. L. Harper. Optimal numberings and isoperimet- ric problems on graphs. J. Combinatorial Theory, 1:385-393, 1966.
8. C.-T. Ho and S. L Johnsson. Distributed routing algorithms for broadcasting and personalized communication in hypercubes. In Proc. International Conference on Parallel Processing, pages 640-648, .
9. S. L. Johnsson. Combining parallel and sequential sorting on a Boolean n-cube. In Proc. International Conference on Parallel Processing, pages 444-448, 1984.
10. R. M. Karp, R. Motwani, and P. Raghavan. Deferred data structuring. SIAM J. Comput., 3:883-902, 1988.
11. F. T. Leighton. Personal communication.
12. F. T. Leighton. Tight bounds on the complexity of parallel sorting. IEEE Transactions on Computers, C-34:344-354, 1985.
13. D. Nassimi and S. Sahni. Parallel permutation and sorting algorithms and a new generalized connection network. J ACM, 29:642-667, 1982.
14. D. Peleg and E. Upfal. The token distribution problem. In Proc. 27th Annual IEEE Symposium on Foundations of Computer Science, pages 418-427, 1985.
15. J. H. Reif and L. G. Valiant. A logarithmic time sort for linear size networks. J ACM, 34:60-76, .
16. P. Varman and K. Doshi. Sorting with linear speedup on a pipelined hypercube. Technical Report TR-8802, Rice University, Department of Electrical and Computer Engineering, February.
17. U. Vishkin. An optimal parallel algorithm for selection. Technical Report 106, Courant Institute of Mathematical Sciences, Department of Computer Science, December 1983.
18. B. Wagar. Hyperquicksort: A fast sorting algorithm for hypercubes. In Proc. of the Second Conference on Hypercube Multiprocessors, pages 292-299, 1986.