Systolic sorting in a sequential input/output environment
Parallel Computing
Designing efficient algorithms for parallel computers
Designing efficient algorithms for parallel computers
The design and analysis of parallel algorithms
The design and analysis of parallel algorithms
Space and time complexities of balanced sorting on processor arrays
Journal of Complexity
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Parallel Sorting Algorithms
Data-Driven Control Scheme for Linear Arrays: Application to a Stable Insertion Sorter
IEEE Transactions on Parallel and Distributed Systems
Reconfigurable Parallel Sorting and Load Balancing on a Beowulf Cluster: HeteroSort
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Optimal fault-tolerant embedding of paths in twisted cubes
Journal of Parallel and Distributed Computing
Optimal Embeddings of Paths with Various Lengths in Twisted Cubes
IEEE Transactions on Parallel and Distributed Systems
The bipanconnectivity and m-panconnectivity of the folded hypercube
Theoretical Computer Science
The m-pancycle-connectivity of a WK-Recursive network
Information Sciences: an International Journal
Edge-pancyclicity and path-embeddability of bijective connection graphs
Information Sciences: an International Journal
The pancyclicity and the Hamiltonian-connectivity of the generalized base-b hypercube
Computers and Electrical Engineering
The bipancycle-connectivity of the hypercube
Information Sciences: an International Journal
Strongly Hamiltonian laceability of the even k-ary n-cube
Computers and Electrical Engineering
Path embeddings in faulty 3-ary n-cubes
Information Sciences: an International Journal
The panconnectivity and the pancycle-connectivity of the generalized base-b hypercube
The Journal of Supercomputing
Panconnectivity and edge-pancyclicity of k-ary n-cubes with faulty elements
Discrete Applied Mathematics
Geodesic pancyclicity and balanced pancyclicity of the generalized base-b hypercube
Discrete Applied Mathematics
| Hi-index | 0.00 |
A balanced parallel algorithm to sort a sequence of items on a linear array of processors is presented. The length of the sequence may be small to arbitrarily large. For a shortsequence, the output of the sorted sequence begins at the step following the last inputof the whole sequence. For an arbitrarily long sequence, the time complexity is optimalunder realistic hardware conditions. A variation of the algorithm is also introduced. Bothalgorithms require far less local memory than that required by a different approach ofbalanced computation. Any number of balanced processors can be connected to delivermore computing power without increasing the memory size of each processor.