Berkeley algorithm
The Berkeley algorithm is a method of clock synchronisation in distributed computing which assumes no machine has an accurate time source. It was developed by Gusella and Zatti at the University of California, Berkeley in 1989. Like Cristian's algorithm, it is intended for use within intranets.
- Comment
- enThe Berkeley algorithm is a method of clock synchronisation in distributed computing which assumes no machine has an accurate time source. It was developed by Gusella and Zatti at the University of California, Berkeley in 1989. Like Cristian's algorithm, it is intended for use within intranets.
- Has abstract
- enThe Berkeley algorithm is a method of clock synchronisation in distributed computing which assumes no machine has an accurate time source. It was developed by Gusella and Zatti at the University of California, Berkeley in 1989. Like Cristian's algorithm, it is intended for use within intranets.
- Hypernym
- Method
- Is primary topic of
- Berkeley algorithm
- Label
- enBerkeley algorithm
- Link from a Wikipage to another Wikipage
- Category:Distributed algorithms
- Chang and Roberts algorithm
- Clock synchronisation
- Cristian's algorithm
- Distributed computing
- Intranets
- Leader election
- Make (software)
- Round-trip time
- SameAs
- 2XjfH
- Algoritmo de Berkeley
- Algoritmo di Berkeley
- Algoritmos de Berkeley
- Berkeley algorithm
- Berkeley-Algorithmus
- m.043qqrg
- Q269652
- الگوریتم برکلی
- Subject
- Category:Distributed algorithms
- WasDerivedFrom
- Berkeley algorithm?oldid=1044711244&ns=0
- WikiPageLength
- 2718
- Wikipage page ID
- 17296870
- Wikipage revision ID
- 1044711244
- WikiPageUsesTemplate
- Template:Reflist
- Template:Short description