Marzullo's algorithm
E234530
Marzullo's algorithm is a method for selecting the most likely correct time interval from multiple, possibly conflicting time sources, commonly used in clock synchronization systems.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Marzullo's algorithm canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T2108346 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Marzullo's algorithm Context triple: [Network Time Protocol, uses, Marzullo's algorithm]
-
A.
Thompson's algorithm
Thompson's algorithm is a classic computer science method for converting regular expressions into nondeterministic finite automata (NFAs), widely used in pattern matching and lexical analysis.
-
B.
Knuth–Morris–Pratt algorithm
The Knuth–Morris–Pratt algorithm is a classic linear-time string-searching algorithm that efficiently finds occurrences of a pattern within a text by precomputing a prefix function to avoid redundant comparisons.
-
C.
Thompson's algorithm for regular expression matching
Thompson's algorithm for regular expression matching is a classic method that converts regular expressions into nondeterministic finite automata (NFAs) to enable efficient pattern matching in text processing.
-
D.
Berlekamp–Massey algorithm
The Berlekamp–Massey algorithm is a key algorithm in coding theory and cryptography used to efficiently determine the shortest linear feedback shift register that generates a given binary sequence.
-
E.
Amdahl's law
Amdahl's law is a formula in computer architecture and parallel computing that predicts the maximum performance improvement achievable by parallelizing parts of a system, given that some portion must remain serial.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Marzullo's algorithm Target entity description: Marzullo's algorithm is a method for selecting the most likely correct time interval from multiple, possibly conflicting time sources, commonly used in clock synchronization systems.
-
A.
Thompson's algorithm
Thompson's algorithm is a classic computer science method for converting regular expressions into nondeterministic finite automata (NFAs), widely used in pattern matching and lexical analysis.
-
B.
Knuth–Morris–Pratt algorithm
The Knuth–Morris–Pratt algorithm is a classic linear-time string-searching algorithm that efficiently finds occurrences of a pattern within a text by precomputing a prefix function to avoid redundant comparisons.
-
C.
Thompson's algorithm for regular expression matching
Thompson's algorithm for regular expression matching is a classic method that converts regular expressions into nondeterministic finite automata (NFAs) to enable efficient pattern matching in text processing.
-
D.
Berlekamp–Massey algorithm
The Berlekamp–Massey algorithm is a key algorithm in coding theory and cryptography used to efficiently determine the shortest linear feedback shift register that generates a given binary sequence.
-
E.
Amdahl's law
Amdahl's law is a formula in computer architecture and parallel computing that predicts the maximum performance improvement achievable by parallelizing parts of a system, given that some portion must remain serial.
- F. None of above. chosen
Statements (38)
| Predicate | Object |
|---|---|
| instanceOf |
algorithm
ⓘ
clock synchronization algorithm ⓘ |
| advantage |
provides robust time interval estimate
ⓘ
simple to implement ⓘ |
| appliedIn |
distributed clock services
ⓘ
fault-tolerant distributed systems ⓘ network time synchronization ⓘ |
| assumes |
each time source provides an interval estimate
ⓘ
some time sources may be faulty ⓘ |
| basedOn |
interval intersection
ⓘ
voting among intervals ⓘ |
| complexity | O(n log n) ⓘ |
| field |
computer science
ⓘ
distributed systems ⓘ time synchronization ⓘ |
| goal | find an interval consistent with the maximum number of sources ⓘ |
| handles |
possibly conflicting time sources
ⓘ
uncertainty in time measurements ⓘ |
| input | set of time intervals from different sources ⓘ |
| limitation |
assumes intervals correctly model uncertainty
ⓘ
requires bound on number of faulty sources ⓘ |
| origin | proposed by Keith Marzullo ⓘ |
| output | time interval with maximum support ⓘ |
| property |
selects interval with maximum overlap count
ⓘ
tolerates a bounded number of faulty sources ⓘ works with overlapping time intervals ⓘ |
| relatedTo |
Cristian's algorithm
ⓘ
Network Time Protocol ⓘ |
| representation | time as closed intervals ⓘ |
| step |
identifies region with highest overlap
ⓘ
scans endpoints while maintaining overlap count ⓘ sorts all interval endpoints ⓘ |
| use |
clock synchronization
ⓘ
combining multiple time interval estimates ⓘ fault-tolerant time estimation ⓘ selecting the most likely correct time interval ⓘ |
| usedFor |
building reliable time services over unreliable networks
ⓘ
estimating correct time in presence of faults ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Marzullo's algorithm Description of subject: Marzullo's algorithm is a method for selecting the most likely correct time interval from multiple, possibly conflicting time sources, commonly used in clock synchronization systems.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.