Optimal precision in the presence of uncertainty (Q1079953): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The Distributed Firing Squad Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A characterization of the minimum cycle mean in a digraph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3048571 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An upper and lower bound for clock synchronization / rank | |||
Normal rank |
Revision as of 14:26, 17 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Optimal precision in the presence of uncertainty |
scientific article |
Statements
Optimal precision in the presence of uncertainty (English)
0 references
1985
0 references
We consider the problem of achieving coordinated actions in a real-time distributed system. In particular, we consider how closely (in terms of real time) processors can be guaranteed to perform a particular action, in a system where message transmission is guaranteed, but there is some uncertainty in message transmission time. We present an algorithm to achieve optimal precision in arbitrary networks. In networks where clocks run at the rate of real time, the optimal precision achievable in a network is exactly how tightly clocks can be guaranteed to be synchronized.
0 references
synchronization
0 references
real-time distributed system
0 references
processors
0 references
message transmission
0 references
networks
0 references
clocks
0 references