Self-simulation for the passive optical star model

P. Berthomé; Th H. Duboux; T. Hagerup; I. Newman; A. Schuster

doi:10.1007/3-540-60313-1_156

Self-simulation for the passive optical star model

P. Berthomé, Th H. Duboux, T. Hagerup, I. Newman, A. Schuster

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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 Ө(k²) is the exact complexity.

Original language	English
Title of host publication	Algorithms - ESA 1995 - 3rd Annual European Symposium, Proceedings
Editors	Paul Spirakis
Publisher	Springer Verlag
Pages	369-380
Number of pages	12
ISBN (Print)	3540603131, 9783540603139
DOIs	https://doi.org/10.1007/3-540-60313-1_156
State	Published - 1995
Event	3rd Annual European Symposium on Algorithms, ESA 1995 - Corfu, Greece Duration: 25 Sep 1995 → 27 Sep 1995

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	979
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	3rd Annual European Symposium on Algorithms, ESA 1995
Country/Territory	Greece
City	Corfu
Period	25/09/95 → 27/09/95

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1995.

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-60313-1_156

Cite this

Berthomé, P., Duboux, T. H., Hagerup, T., Newman, I., & Schuster, A. (1995). Self-simulation for the passive optical star model. In P. Spirakis (Ed.), Algorithms - ESA 1995 - 3rd Annual European Symposium, Proceedings (pp. 369-380). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 979). Springer Verlag. https://doi.org/10.1007/3-540-60313-1_156

@inproceedings{36ffb57ba1ee4760a41f7f8a9b18db17,

title = "Self-simulation for the passive optical star model",

abstract = "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.",

author = "P. Berthom{\'e} and Duboux, {Th H.} and T. Hagerup and I. Newman and A. Schuster",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1995.; 3rd Annual European Symposium on Algorithms, ESA 1995 ; Conference date: 25-09-1995 Through 27-09-1995",

year = "1995",

doi = "10.1007/3-540-60313-1_156",

language = "English",

isbn = "3540603131",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "369--380",

editor = "Paul Spirakis",

booktitle = "Algorithms - ESA 1995 - 3rd Annual European Symposium, Proceedings",

address = "Germany",

}

Berthomé, P, Duboux, TH, Hagerup, T, Newman, I & Schuster, A 1995, Self-simulation for the passive optical star model. in P Spirakis (ed.), Algorithms - ESA 1995 - 3rd Annual European Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 979, Springer Verlag, pp. 369-380, 3rd Annual European Symposium on Algorithms, ESA 1995, Corfu, Greece, 25/09/95. https://doi.org/10.1007/3-540-60313-1_156

Self-simulation for the passive optical star model. / Berthomé, P.; Duboux, Th H.; Hagerup, T. et al.
Algorithms - ESA 1995 - 3rd Annual European Symposium, Proceedings. ed. / Paul Spirakis. Springer Verlag, 1995. p. 369-380 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 979).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Self-simulation for the passive optical star model

AU - Berthomé, P.

AU - Duboux, Th H.

AU - Hagerup, T.

AU - Newman, I.

AU - Schuster, A.

PY - 1995

Y1 - 1995

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0347377861&partnerID=8YFLogxK

U2 - 10.1007/3-540-60313-1_156

DO - 10.1007/3-540-60313-1_156

M3 - Conference contribution

AN - SCOPUS:0347377861

SN - 3540603131

SN - 9783540603139

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 369

EP - 380

BT - Algorithms - ESA 1995 - 3rd Annual European Symposium, Proceedings

A2 - Spirakis, Paul

PB - Springer Verlag

T2 - 3rd Annual European Symposium on Algorithms, ESA 1995

Y2 - 25 September 1995 through 27 September 1995

ER -

Berthomé P, Duboux TH, Hagerup T, Newman I, Schuster A. Self-simulation for the passive optical star model. In Spirakis P, editor, Algorithms - ESA 1995 - 3rd Annual European Symposium, Proceedings. Springer Verlag. 1995. p. 369-380. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-60313-1_156

Self-simulation for the passive optical star model

Abstract

Publication series

Conference

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this