Deterministic sorting in nearly logarithmic time on the hypercube and related computers
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Hypercube algorithms: with applications to image processing and pattern recognition
Hypercube algorithms: with applications to image processing and pattern recognition
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Realizing Common Communication Patterns in Partitioned Optical Passive Stars (POPS) Networks
IEEE Transactions on Computers
Matrix Multiplication and Data Routing Using a Partitioned Optical Passive Stars Network
IEEE Transactions on Parallel and Distributed Systems
The Partitioned Optical Passive Stars Network: Simulations and Fundamental Operations
IEEE Transactions on Parallel and Distributed Systems
Routing Permutations in Partitioned Optical Passive Star Networks
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
The Partitioned Optical Passive Stars (POPS) topology
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Basic Operations on a Partitioned Optical Passive Stars Network with Large Group Size
ICCS '02 Proceedings of the International Conference on Computational Science-Part I
Improved embeddings in POPS networks through stack-graph models
MPPOI '96 Proceedings of the 3rd Conference on Massively Parallel Processing Using Optical Interconnections
Packet routing and selection on the POPS network
Journal of Parallel and Distributed Computing
Optimal hypercube simulation on the partitioned optical passive stars network
The Journal of Supercomputing
| Hi-index | 0.00 |
We present fast algorithms for merging and sorting of data on a multiprocessor system connected through a Partitioned Optical Passive Stars (POPS) network. In a POPS(d,g) network there are n = dg processors and they are divided into g groups of d processors each. There is an optical passive star (OPS) coupler between every pair of groups. Each OPS Coupler can receive an optical signal from any one of its source nodes and broadcast the signal to all the destination nodes. The time needed to perform this receive and broadcast is referred to as a slot and the complexity of an algorithm using the POPS network is measured in terms of number of slots it uses. Our sorting algorithm is more efficient compared to a simulated hypercube sorting algorithm on the POPS.