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
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
Routing and wavelength assignment for hypercube in array-based WDM optical networks
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
This paper shows that an n=2^k processor Partitioned Optical Passive Stars (POPS) network with g groups and d processors per group can simulate every bidirectional move of an n processor hypercube using one slot when dg. Moreover, the same POPS network can simulate every monodirectional move of an n processor hypercube using one slot when d=g. All these results are shown to be optimal. Our simulations improve on the literature whenever d\neq g and directly yield several important consequences. For example, as a direct consequence of our simulations, a {\rm{POPS}} network, n=dg and d