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 2d/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 p such that p(i) \neq i for all i.
Routing Permutations in Partitioned Optical Passive Stars Networks
RIZZI, ROMEO
2003-01-01
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 2d/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 p such that p(i) \neq i for all i.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
