Routing permutations in partitioned optical passive stars networks
Routing permutations in partitioned optical passive stars networks
It 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.
8 pages, 3 figures
- Roma Tre University Italy
- Sapienza University of Rome Italy
- University of Trento Italy
- University of Verona Italy
Computer system organization, FOS: Computer and information sciences, Permutation routing, Network design and communication in computer systems, Computer Networks and Communications; Modeling and Simulation, Optical interconnections; Passive stars; Permutation routing, Optical interconnections, Passive stars, Optical interconnections; Passive stars; Permutation routing; Computer Science Applications1707 Computer Vision and Pattern Recognition; Hardware and Architecture; Control and Systems Engineering, C.1.4, Computer Science - Distributed, Parallel, and Cluster Computing, Graph theory (including graph drawing) in computer science, Computer Science - Data Structures and Algorithms, POPS networks; routing; permutation routing; offline routing, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC)
Computer system organization, FOS: Computer and information sciences, Permutation routing, Network design and communication in computer systems, Computer Networks and Communications; Modeling and Simulation, Optical interconnections; Passive stars; Permutation routing, Optical interconnections, Passive stars, Optical interconnections; Passive stars; Permutation routing; Computer Science Applications1707 Computer Vision and Pattern Recognition; Hardware and Architecture; Control and Systems Engineering, C.1.4, Computer Science - Distributed, Parallel, and Cluster Computing, Graph theory (including graph drawing) in computer science, Computer Science - Data Structures and Algorithms, POPS networks; routing; permutation routing; offline routing, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC)
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).8 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!