Abstract
A distributed computation satisfies sequential consistency if it is possible to establish a legal ordering of all the operations such that the program order of each site in the distributed system is respected. However, sequential consistency does not necessarily consider the particular real-time instant at which each operation is executed. A timed consistency model addresses how quickly the effects of an operation are perceived by the rest of the system, by requiring that if a write operation is executed at time t, it must be visible to the entire distributed system by time t + Δ. Timed consistency generalizes several existing consistency criteria and it is well suited for applications where the action of one user must be seen by others in a timely fashion.
Original language | English |
---|---|
Pages | 161-168 |
Number of pages | 8 |
DOIs | |
State | Published - 2001 |
Event | 6th International Workshop on Object-Oriented Real-Time Dependable Systems (WORDS) - Rome, Italy Duration: 8 Jan 2001 → 10 Jan 2001 |
Conference
Conference | 6th International Workshop on Object-Oriented Real-Time Dependable Systems (WORDS) |
---|---|
Country/Territory | Italy |
City | Rome |
Period | 8/01/01 → 10/01/01 |