Cristian's algorithm
E815702
Cristian's algorithm is a clock synchronization method in distributed systems that estimates accurate time on client machines by querying a time server and adjusting for message delays.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Cristian's algorithm canonical | 2 |
How this entity was disambiguated
This entity first appeared as the object of triple T9690898 — 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: Cristian's algorithm Context triple: [Marzullo's algorithm, relatedTo, Cristian's algorithm]
-
A.
Marzullo's algorithm
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.
-
B.
Benettin algorithm
The Benettin algorithm is a numerical method used in dynamical systems theory to estimate Lyapunov exponents, which quantify the rate of separation of nearby trajectories and indicate chaos.
-
C.
Scarf algorithm
The Scarf algorithm is a combinatorial method in mathematical economics and game theory used to compute fixed points and prove the existence of equilibria in markets and games.
-
D.
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.
-
E.
Warnock algorithm
The Warnock algorithm is a classic hidden surface determination technique in computer graphics that recursively subdivides a scene into smaller regions to efficiently resolve visibility.
- 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: Cristian's algorithm Target entity description: Cristian's algorithm is a clock synchronization method in distributed systems that estimates accurate time on client machines by querying a time server and adjusting for message delays.
-
A.
Marzullo's algorithm
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.
-
B.
Benettin algorithm
The Benettin algorithm is a numerical method used in dynamical systems theory to estimate Lyapunov exponents, which quantify the rate of separation of nearby trajectories and indicate chaos.
-
C.
Scarf algorithm
The Scarf algorithm is a combinatorial method in mathematical economics and game theory used to compute fixed points and prove the existence of equilibria in markets and games.
-
D.
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.
-
E.
Warnock algorithm
The Warnock algorithm is a classic hidden surface determination technique in computer graphics that recursively subdivides a scene into smaller regions to efficiently resolve visibility.
- F. None of above. chosen
Statements (45)
| Predicate | Object |
|---|---|
| instanceOf |
clock synchronization algorithm
ⓘ
distributed systems algorithm ⓘ |
| accuracyDependsOn |
network latency stability
ⓘ
precision of time server clock ⓘ |
| advantage |
low communication overhead
ⓘ
requires only one time server ⓘ simple to implement ⓘ |
| appliesTo |
client-server architectures
ⓘ
distributed systems ⓘ |
| assumes |
bounded message delay
ⓘ
reliable time server ⓘ symmetric network delay ⓘ |
| basedOn | client-server model ⓘ |
| category |
client-initiated synchronization
ⓘ
time synchronization protocol ⓘ |
| computes |
offset between client clock and server clock
ⓘ
one-way delay estimate ⓘ round-trip time ⓘ |
| designedFor | systems without specialized time hardware ⓘ |
| field |
computer science
ⓘ
distributed systems ⓘ |
| goal | estimate accurate time on client machines ⓘ |
| input |
reply message from time server to client
ⓘ
request message from client to time server ⓘ |
| limitation |
assumes symmetric delays that may not hold in practice
ⓘ
depends on single time server availability ⓘ sensitive to variable network delays ⓘ |
| method |
client estimates network delay as half of round-trip time
ⓘ
client records send and receive timestamps ⓘ client sends time request to server ⓘ client sets its clock to server time plus estimated delay ⓘ server responds with its current time ⓘ |
| output |
adjusted client time
ⓘ
synchronized client clock ⓘ |
| purpose | clock synchronization ⓘ |
| relatedTo |
Berkeley algorithm
ⓘ
Network Time Protocol ⓘ |
| requires |
client ability to adjust local clock
ⓘ
network connectivity between client and time server ⓘ |
| synchronizationType | external synchronization ⓘ |
| timeModel | synchronous approximation of message delays ⓘ |
| typicalUse |
synchronizing clocks in small distributed systems
ⓘ
synchronizing workstation clocks to a central server ⓘ |
| uses |
message delay estimation
ⓘ
time server ⓘ |
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: Cristian's algorithm Description of subject: Cristian's algorithm is a clock synchronization method in distributed systems that estimates accurate time on client machines by querying a time server and adjusting for message delays.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject linked to:
proposed by Keith Marzullo