Routing, merging, and sorting on parallel models of computation

Journal of Computer and System Sciences

Volumn 30, Issue 1, 1985, Pages 130-145

  Borodin, A ^a   Hopcroft, J E ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS;

MERGING; ROUTING; SORTING;

COMPUTER SYSTEMS, DIGITAL;

EID: 0022012899     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/0022-0000(85)90008-X     Document Type: Article

References (30)

1. Randomized parallel communications
2. An O(n log n) sorting network
3. Routing, merging, and sorting in parallel models of computation
4. Complexity theory for unbounded fan-in parallelism
5. Towards a complexity theory of synchronous parallel computation
6. Bounds on the time of parallel RAM's to compute simple functions
7. Hardware complexity and parallel computation
8. Parallelism in random access machines
9. Parity circuits and the polynomial-time hierarchy
10. An efficient general purpose parallel computer
11. A unified approach to models of synchronous parallel machines
12. Coordinating large number of processors
13. Parallel sorting with constant time for comparisons
14. Sorting and Merging in Rounds
15. Searching, merging, and sorting in parallel computation
16. Interconnections between PE and MBs using the shuffle-exchange
17. A fast parallel algorithm for routing in permutation networks
18. New parallel-sorting schemes
19. The cube-connected cycles
20. A Logarithmic Time Sort for Linear Size Networks
21. Ultracomputers
22. Finding the maximum, merging, and sorting in a parallel computation model
23. On Parallel Searching
24. Parallel processing with the perfect shuffle
25. Efficient schemes for parallel communication
26. Parallelism in comparison problems
27. Universal schemes for parallel computation