proposed by Keith Marzullo
E815703
Marzullo's algorithm is a fault-tolerant clock synchronization method used in distributed systems to derive a consistent time interval from multiple, potentially unreliable time sources.
Observed surface forms (1)
| Surface form | Occurrences |
|---|---|
| Marzullo's algorithm | 0 |
Statements (25)
| Predicate | Object |
|---|---|
| instanceOf |
clock synchronization algorithm
ⓘ
distributed systems algorithm ⓘ fault-tolerant algorithm ⓘ |
| appliedIn |
fault-tolerant time services
ⓘ
synchronization of distributed clocks ⓘ |
| assumes | each time source provides a time interval ⓘ |
| basedOn | interval intersection ⓘ |
| computes | intersection of time intervals ⓘ |
| designedFor |
systems with message delay uncertainty
ⓘ
systems with unreliable clocks ⓘ |
| field |
distributed computing
ⓘ
fault-tolerant computing ⓘ |
| handles |
faulty time sources
ⓘ
multiple time sources ⓘ unreliable time sources ⓘ |
| hasGoal |
clock synchronization
ⓘ
derive a consistent time interval ⓘ |
| proposedBy | Keith Marzullo NERFINISHED ⓘ |
| relatedTo |
Cristian's algorithm
NERFINISHED
ⓘ
NTP NERFINISHED ⓘ |
| selects | maximally consistent subset of intervals ⓘ |
| tolerates | bounded number of faulty sources ⓘ |
| usedIn | distributed systems ⓘ |
| usesConcept |
fault model
ⓘ
uncertainty intervals ⓘ |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.