Marco Zagha
Guy E. Blelloch
- 1.Kenneth E. Batcher. Sorting networks and their applications. In AFIPS Spring Joint Computer Conference, pages 307- 314, 1968.Google Scholar
Digital Library
- 2.Guy E. Blelloch. Scans as primitive parallel operations. IEEE Transactions on Computers, C-38(11):1526-1538, November 1989. Google ScholarDigital Library
- 3.Guy E. Blelloch, Charles E. Leiserson, Bruce M. Maggs, C. Gregory Plaxton, Steven J. Smith, and Marco Zagha. A comparison of sorting algorithms for the Connection Machine CM-2. In Proceedings Symposium on Parallel Algorithms and Architectures, pages 3-16, Hilton Head, SC, July 1991. Google ScholarDigital Library
- 4.Siddhartha Chatterjee, Guy E. BlelIoeh, and Marco Zagha. Scan primitives for vector computers. In Proceedings Supercomputing '90, pages 666-675, November 1990. Google ScholarDigital Library
- 5.Richard Cole and Uzi Vishkin. Deterministic coin tossing and accelerating cascades: Micro and macro techniques for designing parallel algorithms. In Proceedings ACM Symposium on Theory of Computing, pages 206-219, 1986. Google ScholarDigital Library
- 6.T.H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT Press and McGraw-Hill, 1990. Google ScholarDigital Library
- 7.Cray Research Inc., Mendota Heights, Minnesota. Macros and Opdefs Reference Manual, SR-OO12D, June 1988.Google Scholar
- 8.Cray Research Inc., Mendota Heights, Minnesota. OR- DERS(3SC1) Manual Page SR-2081 5.1, March 1988.Google Scholar
- 9.Cray Research Inc., Mendota Heights, Minnesota. Symbolic Machine Instructions Reference Manual, SR-OO85B, March 1988.Google Scholar
- 10.C.A.R. Hoare. Quicksort. Computer J., 5(1):10-15, 1962.Google ScholarCross Ref
- 11.Donald E. Knuth. Sorting and Searching, volume 3 of The Art of Computer Programming. Addison-Wesley Publishing Company, Reading, MA, 1973.Google Scholar
- 12.Richard E. Ladner and Michael J. Fischer. Parallel prefix computation. Journal of the Association for Computing Machinery, 27(4):831-838, October 1980. Google ScholarDigital Library
- 13.Stewart A. Levin. A fully vectorized quicksort. Parallel Computing, 16:369-373, 1990.Google ScholarCross Ref
- 14.B.M.E. Motet and H.D. Shapiro. Algorithms from P to NP. Benjamin Cummings Publishing Company, 1990.Google Scholar
- 15.Lasse Natvig. Logarithmic time cost optimal parallel sorting is not yet fast in practice! In Proceedings Supercomputing '90, pages 486-494, November 1990. Google ScholarDigital Library
- 16.D. A. Padua and M. Wolfe. Advanced compiler optimizations for supercomputers. Communications of the ACM, 29(12):1184-1201, December 1986. Google ScholarDigital Library
- 17.Kay A. Robbins and Steven Robbins. The CrayX-MP/Model 24: A Case Study in Pipelined Architecture and Vector Processing. Springer-Verlag, 1989. Google ScholarDigital Library
- 18.Wolfgang R6nsch and Henry Strauss. Timing results of some internal sorting algorithms on vector computers. Parallel Computing, 4, 1987.Google Scholar
Index Terms
- Radix sort for vector multiprocessors
Recommendations
Partitioned Parallel Radix Sort
Load balanced parallel radix sort solved the load imbalance problem present in parallel radix sort. By redistributing the keys in each round of radix, each processor has exactly the same number of keys, thereby reducing the overall sorting time. Load ...
Partitioned Parallel Radix Sort
ISHPC '00: Proceedings of the Third International Symposium on High Performance ComputingLoad balanced parallel radix sort solved the load imbalance problem present in parallel radix sort. Redistributing the keys in each round of radix, each processor has exactly the same number of keys, thereby reducing the overall sorting time. Load ...
A Benchmark Parallel Sort for Shared Memory Multiprocessors
The first parallel sort algorithm for shared memory MIMD (multiple-instruction-multiple-data-stream) multiprocessors that has a theoretical and measured speedup near linear is exhibited. It is based on a novel asynchronous parallel merge that evenly ...
Comments