A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Partial synchrony based on set timeliness
2009
Proceedings of the 28th ACM symposium on Principles of distributed computing - PODC '09
We introduce a new model of partial synchrony for read-write shared memory systems. This model is based on the notion of set timeliness-a natural and straightforward generalization of the seminal concept of timeliness in the partially synchrony model of Dwork, Lynch and Stockmeyer [11] . 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
doi:10.1145/1582716.1582737
dblp:conf/podc/AguileraDFT09
fatcat:v5qo4357rzhqxmu4a2fckudkf4