Realizing Common Communication Patterns in Partitioned Optical Passive Stars (POPS) Networks
IEEE Transactions on Computers
Bipartite Edge Coloring in $O(\Delta m)$ Time
SIAM Journal on Computing
Edge-coloring bipartite graphs
Journal of Algorithms
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
Finding 1-Factors in Bipartite Regular Graphs and Edge-Coloring Bipartite Graphs
SIAM Journal on Discrete Mathematics
The Partitioned Optical Passive Stars (POPS) topology
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Fast merging and sorting on a partitioned optical passive stars network
Computer Science in Perspective
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
Optimal embedding of the hypercube on partitioned optical passive stars networks
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
| Hi-index | 0.01 |
It is shown that a Partitioned Optical Passive Stars (POPS) network with g groups and d processors per group can route any permutation among the n = dg processors in one slot when d =1 and 2驴d/g驴 slots when d 1. The number of slots used is optimal in the worst case, and is at most the double of the optimum for all permutations 驴 such that 驴(i) 驴 i, for all i.