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
Improved embeddings in POPS networks through stack-graph models
MPPOI '96 Proceedings of the 3rd Conference on Massively Parallel Processing Using Optical Interconnections
Routing permutations in partitioned optical passive stars networks
Journal of Parallel and Distributed Computing - Special section best papers from the 2002 international parallel and distributed processing symposium
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 Optimal Passive Stars network, POPS(d,g), is an optical interconnection network of N processors (N=dg) which uses g2 optical passive star couplers. The processors of this network are partitioned into g groups of d processors each and the g2 couplers are used for connecting each group with each of the groups, including itself. In this paper, we present an optimal embedding of the hypercube on this network for all combinations of values of d and g. Specifically, we show how to optimally simulate the most common hypercube communication pattern where each hypercube node sends a packet along the same dimension. Optimal simulation of this communication on the POPS(d,g) network has already been presented for d ≤ g in the literature, but for the case d g, the optimality remained an open problem. Now, we show that an optimal simulation is feasible in this case too.