In the context of parallel computing, optical technology offers simple interconnection schemes with straightforward layouts that support complex logical interconnection patterns. The Passive Optical Star (POS) is often suggested as a platform for implementing the optical network: logically it offers an all-to-all broadcast capability. We investigate the self-simulation or scalability properties of the POS. A family of parallel machines is said to be self-simulating or scalable if reducing the number of processors by a factor of k (by going to a smaller member of the family) increases the computation time by a factor of (the optimal) O(k). We present a randomized algorithm for an n-processor POS that simulates a kn-processor POS with a slowdown of O(k + log*n) using local control only, thus coming close to the self-simulation ideal of O(k). We also analyze direct algorithms that send messages directly from their origin to their destination; for this case we prove that Ө(k2) is the exact complexity.
|Title of host publication||Algorithms - ESA 1995 - 3rd Annual European Symposium, Proceedings|
|Number of pages||12|
|ISBN (Print)||3540603131, 9783540603139|
|State||Published - 1995|
|Event||3rd Annual European Symposium on Algorithms, ESA 1995 - Corfu, Greece|
Duration: 25 Sep 1995 → 27 Sep 1995
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||3rd Annual European Symposium on Algorithms, ESA 1995|
|Period||25/09/95 → 27/09/95|
Bibliographical notePublisher Copyright:
© Springer-Verlag Berlin Heidelberg 1995.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)