Resumen
Ordering and time are two different aspects of consistency of shared objects in a distributed system. One avoids conflicts between operations, the other addresses how quickly the effects of an operation are perceived by the rest of the system. Consistency models such as sequential consistency and causal consistency do not consider the particular time at which an operation is executed to establish a valid order among all the operations of a computation. Timed consistency models require that if a write operation is executed at time t, it must be visible to all nodes by time t+Δ. Timed consistency generalizes several existing consistency criteria and it is well suited for interactive and collaborative applications, where the action of one user must be seen by others in a timely fashion.
Idioma original | Inglés |
---|---|
Páginas | 163-172 |
Número de páginas | 10 |
DOI | |
Estado | Publicada - 1999 |
Publicado de forma externa | Sí |
Evento | Proceedings of the 1999 18th Annual ACM Symposium on Principles of Distributed Computing (PODC), FCRC'99 - Atlanta, GA, USA Duración: 3 may 1999 → 6 may 1999 |
Conferencia
Conferencia | Proceedings of the 1999 18th Annual ACM Symposium on Principles of Distributed Computing (PODC), FCRC'99 |
---|---|
Ciudad | Atlanta, GA, USA |
Período | 3/05/99 → 6/05/99 |