General purpose parallel architectures
Handbook of theoretical computer science (vol. A)
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
Expected time bounds for selection
Communications of the ACM
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
Improved embeddings in POPS networks through stack-graph models
MPPOI '96 Proceedings of the 3rd Conference on Massively Parallel Processing Using Optical Interconnections
Fast merging and sorting on a partitioned optical passive stars network
Computer Science in Perspective
Summation and routing on a partitioned optical passive stars network with large group size
IEEE Transactions on Parallel and Distributed Systems
Optimal hypercube simulation on the partitioned optical passive stars network
The Journal of Supercomputing
| Hi-index | 0.00 |
Partitioned optical passive stars (POPS) network has been proposed recently as a desirable model of parallel computing. Many papers have been published that address fundamental problems on these networks. Packet routing is one such important problem. We present a randomized algorithm in this paper that performs better than the best prior algorithms. We also present a randomized algorithm for selection on the POPS network.