Routing Permutations in Partitioned Optical Passive Star Networks
Alessandro Mei, Romeo Rizzi
Abstract
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.
Create a lesson
Related papers
Prorsa: Unleashing the Potential of Prefill-Decode Disaggregation in Agentic Reinforcement Learning
Chiheng Lou, Xiangwei Deng, Bangjun Xiao et al.
Revisiting Fast Tendermint: An Agreement Violation and Two Repairs
Alejandro Ranchal-Pedrosa
Federated Coreset Subsampling for Distributed Memory Banks
Jason Witzemann, Daniel Pröll, Sebastian Hegenbart
Space AI Infrastructure: Where the Edge Meets the Orbital Cloud
Zhanwei Wang, Jianhao Huang, Min Sheng et al.
SP-Allreduce: Symmetric Tree Schedules for Tori and Beyond
Mikhail Cherniavskii, Andrey Kupavskii, Georgy Mironov et al.
From Nominal Capacity to Deliverable Compute: Design, Calibration and Validation of the D-PIN SCU Dynamic Metering System
Cheng Li, Jiexiong Liu, Shikun Wang et al.