Synchronizer (algorithm)

In computer science, a synchronizer is an algorithm that can be used to run a synchronous algorithm on top of an asynchronous processor network, so enabling the asynchronous system to run as a synchronous network.

Comment
enIn computer science, a synchronizer is an algorithm that can be used to run a synchronous algorithm on top of an asynchronous processor network, so enabling the asynchronous system to run as a synchronous network.
Has abstract
enIn computer science, a synchronizer is an algorithm that can be used to run a synchronous algorithm on top of an asynchronous processor network, so enabling the asynchronous system to run as a synchronous network. The concept was originally proposed in (Awerbuch, 1985) along with three synchronizer algorithms named alpha, beta and gamma which provided different tradeoffs in terms of time and message complexity. Essentially, they are a solution to the problem of asynchronous algorithms (which operate in a network with no global clock) being harder to design and often less efficient than the equivalent synchronous algorithms. By using a synchronizer, algorithm designers can deal with the simplified "ideal network" and then later mechanically produce a version that operates in more realistic asynchronous cases.
Hypernym
Algorithm
Is primary topic of
Synchronizer (algorithm)
Label
enSynchronizer (algorithm)
Link from a Wikipage to an external page
www.cs.uiowa.edu/~ghosh/synchronizer.pdf
Link from a Wikipage to another Wikipage
Algorithm
Asynchronous system
Baruch Awerbuch
Category:Distributed algorithms
Computer science
Synchronization (computer science)
SameAs
4w4vT
m.0b12 7
Q7662199
Synchronizer (algorithm)
Subject
Category:Distributed algorithms
WasDerivedFrom
Synchronizer (algorithm)?oldid=1055313613&ns=0
WikiPageLength
1737
Wikipage page ID
3809315
Wikipage revision ID
1055313613
WikiPageUsesTemplate
Template:Cite document
Template:Multiple issues
Template:No footnotes
Template:One source