Routing permutations in partitioned optical passive stars networks

Authors:
Alessandro Mei;Romeo Rizzi
Affiliations:
Department of Computer Science, University of Rome "La Sapienza," Rome, Italy;Department of Information and Communication Technology, University of Trento, Italy
Venue:
Journal of Parallel and Distributed Computing - Special section best papers from the 2002 international parallel and distributed processing symposium
Year:
2003

Citing 7
Cited 3

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

Hypercube Computations on Partitioned Optical Passive Stars Networks

IEEE Transactions on Parallel and Distributed Systems
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.