Fast parallel sorting under LogP: experience with the CM-5
- 1 January 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 7 (8) , 791-805
- https://doi.org/10.1109/71.532111
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- An improved supercomputer sorting benchmarkPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Asynchronous PRAMS with Memory LatencyJournal of Parallel and Distributed Computing, 1994
- Radix sort for vector multiprocessorsPublished by Association for Computing Machinery (ACM) ,1991
- Communication complexity of PRAMsTheoretical Computer Science, 1990
- Efficient robust parallel computationsPublished by Association for Computing Machinery (ACM) ,1990
- A more practical PRAM modelPublished by Association for Computing Machinery (ACM) ,1989
- Efficient parallel algorithms can be made robustPublished by Association for Computing Machinery (ACM) ,1989
- Towards an architecture-independent analysis of parallel algorithmsPublished by Association for Computing Machinery (ACM) ,1988
- Tight Bounds on the Complexity of Parallel SortingIEEE Transactions on Computers, 1985
- Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memoriesActa Informatica, 1984