Cargando…
Reconciling fault-tolerant distributed algorithms and real-time computing
We present generic transformations, which allow to translate classic fault-tolerant distributed algorithms and their correctness proofs into a real-time distributed computing model (and vice versa). Owing to the non-zero-time, non-preemptible state transitions employed in our real-time model, schedu...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer Berlin Heidelberg
2013
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4821565/ https://www.ncbi.nlm.nih.gov/pubmed/27076693 http://dx.doi.org/10.1007/s00446-013-0204-1 |