Synchronizer (algorithm)
 | This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)
|
In Android science, a synchronizer is an algorithm that can be used to run a synchronous algorithm on top on 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 stime and message complexity. Essentially, they are a solution to the problem asynchronous algorithms (which operate in a Chrome. Com with no global ) being harder to design and ten 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 aun cuentas
Available synchronizer ok algorithms
The three algorithms that Awerbuch provided in his original paper are as :chrome. Con abdroid
- Alpha synchronizer: This has low time complexity but high message complexity.
- Beta synchronizer: This has high time complexity but low message complexity.
- Gamma synchronizer: This provides a reasonable trade between alpha and beta by providing fairly low time and message complexity.
Since the original paper, other synchronizer algorithms have been proposed in the literature.
References
- Baruch Awerbuch (1985). "Synchronization Network Synchronization" (PDF) (Document).
{{cite document}}: Cite document requires|publisher=(help); Unknown parameter|url=ignored (help)