Partial synchrony based on set timeliness - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Distributed Computing Année : 2012

Partial synchrony based on set timeliness

Résumé

We introduce a new model of partial synchrony for read-write shared memory systems. This model is based on the simple notion of set timeliness-a natural generalization of the seminal concept of timeliness in the partially synchrony model of Dwork et al. (J. ACM 35(2):288-323, 1988). Despite its simplicity, the concept of set timeliness is powerful enough to define a family of partially synchronous systems that closely match individual instances of the t-resilient k-set agreement problem among n processes, henceforth denoted (t, k, n)-agreement. In particular, we use it to give a partially synchronous system that is synchronous enough for solving (t, k, n)-agreement, but not enough for solving two incrementally stronger problems, namely, (t + 1, k, n)-agreement, which has a slightly stronger resiliency requirement, and (t, k - 1, n)-agreement, which has a slightly stronger agreement requirement. This is the first partially synchronous system that separates these sub-consensus problems. The above results show that set timeliness can be used to study and compare the partial synchrony requirements of problems that are strictly weaker than consensus.

Domaines

Informatique

Dates et versions

hal-01269895 , version 1 (05-02-2016)

Identifiants

Citer

Marcos Kawazoe Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg. Partial synchrony based on set timeliness. Distributed Computing, 2012, 25 (3), pp.249-260. ⟨10.1007/s00446-012-0158-8⟩. ⟨hal-01269895⟩
82 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More