Routing Permutations in Partitioned Optical Passive Star Networks

Simple item page
dc.creatorMei, Alessandro
dc.creatorRizzi, Romeo
dc.date2001-09-18
dc.date.accessioned2026-07-07T03:17:31Z
dc.date.available2026-07-07T03:17:31Z
dc.descriptionIt is shown that a POPS network with g groups and d processors per group can efficiently route any permutation among the n=dg processors. 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)<>i for all i.
dc.description8 pages, 3 figures
dc.identifierhttps://arxiv.org/abs/cs/0109027
dc.identifierhttp://arxiv.org/abs/cs/0109027
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30750
dc.subjectDistributed, Parallel, and Cluster Computing
dc.subjectData Structures and Algorithms
dc.subjectC.1.4
dc.titleRouting Permutations in Partitioned Optical Passive Star Networks
dc.typetext

Files

Collections

arXiv