Low complexity network synchronization

Lior Shabtay; Adrian Segall

doi:10.1007/bfb0020436

Low complexity network synchronization

Lior Shabtay
, Adrian Segall

Technion-Israel Institute of Technology

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

11 Scopus citations

Abstract

Synchronizer γ is the best synchronizer known that works with any type of synchronous model and any network topology. This paper presents three new synchronizers: η₁, η₂ and θ. These synchronizers use sparse covers in order to operate and have the following advantages over synchronizer γ: (1) they are conceptually simpler, as only one convergecast and one broadcast processes are performed along each cluster spanning-tree between each two consecutive pulses, and no preferred links are needed for inter-cluster communication. (2) synchronizer η₂ uses half the communication complexity of synchronizer γ, while retaining the time complexity. (3) synchronizer θ uses half the time complexity of synchronizer γ, while retaining the communication complexity. (4) since there is no need to elect preferred links between neighboring clusters, the initialization process of these synchronizers is more efficient: it requires only O(¦V¦log ¦V} + ¦E¦) messages.

Original language	English
Title of host publication	Distributed Algorithms - 8th International Workshop, WDAG 1994, Proceedings
Editors	Gerard Tel, Paul Vitanyi
Publisher	Springer Verlag
Pages	223-237
Number of pages	15
ISBN (Print)	9783540584490
DOIs	https://doi.org/10.1007/bfb0020436
State	Published - 1994
Externally published	Yes
Event	8th International Workshop on Distributed Algorithms, WDAG 1994 - Terschelling, Netherlands Duration: 29 Sep 1994 → 1 Oct 1994

Publication series

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

Conference

Conference	8th International Workshop on Distributed Algorithms, WDAG 1994
Country/Territory	Netherlands
City	Terschelling
Period	29/09/94 → 1/10/94

Bibliographical note

Publisher Copyright:
© 1994, Springer Verlag. All rights reserved.

Keywords

Communication and time complexities
Distributed algorithms
Networks
Sparse covers
Synchronization

Access to Document

10.1007/bfb0020436

Cite this

Shabtay, L., & Segall, A. (1994). Low complexity network synchronization. In G. Tel, & P. Vitanyi (Eds.), Distributed Algorithms - 8th International Workshop, WDAG 1994, Proceedings (pp. 223-237). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 857 LNCS). Springer Verlag. https://doi.org/10.1007/bfb0020436

@inproceedings{d727bce631494953b20d0b8b5453c71b,

title = "Low complexity network synchronization",

abstract = "Synchronizer γ is the best synchronizer known that works with any type of synchronous model and any network topology. This paper presents three new synchronizers: η1, η2 and θ. These synchronizers use sparse covers in order to operate and have the following advantages over synchronizer γ: (1) they are conceptually simpler, as only one convergecast and one broadcast processes are performed along each cluster spanning-tree between each two consecutive pulses, and no preferred links are needed for inter-cluster communication. (2) synchronizer η2 uses half the communication complexity of synchronizer γ, while retaining the time complexity. (3) synchronizer θ uses half the time complexity of synchronizer γ, while retaining the communication complexity. (4) since there is no need to elect preferred links between neighboring clusters, the initialization process of these synchronizers is more efficient: it requires only O(¦V¦log ¦V\} + ¦E¦) messages.",

keywords = "Communication and time complexities, Distributed algorithms, Networks, Sparse covers, Synchronization",

author = "Lior Shabtay and Adrian Segall",

note = "Publisher Copyright: {\textcopyright} 1994, Springer Verlag. All rights reserved.; 8th International Workshop on Distributed Algorithms, WDAG 1994 ; Conference date: 29-09-1994 Through 01-10-1994",

year = "1994",

doi = "10.1007/bfb0020436",

language = "אנגלית",

isbn = "9783540584490",

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

publisher = "Springer Verlag",

pages = "223--237",

editor = "Gerard Tel and Paul Vitanyi",

booktitle = "Distributed Algorithms - 8th International Workshop, WDAG 1994, Proceedings",

address = "גרמניה",

}

Shabtay, L & Segall, A 1994, Low complexity network synchronization. in G Tel & P Vitanyi (eds), Distributed Algorithms - 8th International Workshop, WDAG 1994, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 857 LNCS, Springer Verlag, pp. 223-237, 8th International Workshop on Distributed Algorithms, WDAG 1994, Terschelling, Netherlands, 29/09/94. https://doi.org/10.1007/bfb0020436

Low complexity network synchronization. / Shabtay, Lior; Segall, Adrian.
Distributed Algorithms - 8th International Workshop, WDAG 1994, Proceedings. ed. / Gerard Tel; Paul Vitanyi. Springer Verlag, 1994. p. 223-237 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 857 LNCS).

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

TY - GEN

T1 - Low complexity network synchronization

AU - Shabtay, Lior

AU - Segall, Adrian

PY - 1994

Y1 - 1994

N2 - Synchronizer γ is the best synchronizer known that works with any type of synchronous model and any network topology. This paper presents three new synchronizers: η1, η2 and θ. These synchronizers use sparse covers in order to operate and have the following advantages over synchronizer γ: (1) they are conceptually simpler, as only one convergecast and one broadcast processes are performed along each cluster spanning-tree between each two consecutive pulses, and no preferred links are needed for inter-cluster communication. (2) synchronizer η2 uses half the communication complexity of synchronizer γ, while retaining the time complexity. (3) synchronizer θ uses half the time complexity of synchronizer γ, while retaining the communication complexity. (4) since there is no need to elect preferred links between neighboring clusters, the initialization process of these synchronizers is more efficient: it requires only O(¦V¦log ¦V} + ¦E¦) messages.

AB - Synchronizer γ is the best synchronizer known that works with any type of synchronous model and any network topology. This paper presents three new synchronizers: η1, η2 and θ. These synchronizers use sparse covers in order to operate and have the following advantages over synchronizer γ: (1) they are conceptually simpler, as only one convergecast and one broadcast processes are performed along each cluster spanning-tree between each two consecutive pulses, and no preferred links are needed for inter-cluster communication. (2) synchronizer η2 uses half the communication complexity of synchronizer γ, while retaining the time complexity. (3) synchronizer θ uses half the time complexity of synchronizer γ, while retaining the communication complexity. (4) since there is no need to elect preferred links between neighboring clusters, the initialization process of these synchronizers is more efficient: it requires only O(¦V¦log ¦V} + ¦E¦) messages.

KW - Communication and time complexities

KW - Distributed algorithms

KW - Networks

KW - Sparse covers

KW - Synchronization

UR - https://www.scopus.com/pages/publications/0009184857

U2 - 10.1007/bfb0020436

DO - 10.1007/bfb0020436

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0009184857

SN - 9783540584490

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

SP - 223

EP - 237

BT - Distributed Algorithms - 8th International Workshop, WDAG 1994, Proceedings

A2 - Tel, Gerard

A2 - Vitanyi, Paul

PB - Springer Verlag

T2 - 8th International Workshop on Distributed Algorithms, WDAG 1994

Y2 - 29 September 1994 through 1 October 1994

ER -

Low complexity network synchronization

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this