Indulgent algorithms (preliminary version) Export

@inproceedings{citeulike:4059078, abstract = {Informally, an indulgent algorithm is a distributed algorithm that tolerates unreliable failure detection: the algorithm is indulgent towards its failure detector. This paper formally characterises such algorithms and states some of their interesting features. We show that indulgent algorithms are inherently safe and uniform . We also state impossibility results for indulgent solutions to divergent problems like consensus, and failure-sensitive problems like non-blocking atomic commit and terminating reliable broadcast.}, address = {New York, NY, USA}, author = {Guerraoui, Rachid}, booktitle = {PODC '00: Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing}, citeulike-article-id = {4059078}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=343630}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/343477.343630}, doi = {10.1145/343477.343630}, isbn = {1-58113-183-6}, keywords = {2000, algorithms, asynchronous, consensus, indulgent, model}, location = {Portland, Oregon, United States}, pages = {289--297}, posted-at = {2009-02-16 15:27:28}, priority = {2}, publisher = {ACM}, title = {Indulgent algorithms (preliminary version)}, url = {http://dx.doi.org/10.1145/343477.343630}, year = {2000} }

TY - CONF ID - citeulike:4059078 L3 - citeulike-article-id:4059078 N2 - Informally, an indulgent algorithm is a distributed algorithm that tolerates unreliable failure detection: the algorithm is indulgent towards its failure detector. This paper formally characterises such algorithms and states some of their interesting features. We show that indulgent algorithms are inherently safe and uniform . We also state impossibility results for indulgent solutions to divergent problems like consensus, and failure-sensitive problems like non-blocking atomic commit and terminating reliable broadcast. CY - Portland, Oregon, United States SN - 1-58113-183-6 AD - New York, NY, USA EP - 297 TI - Indulgent algorithms (preliminary version) PB - ACM T2 - PODC '00: Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing SP - 289 KW - 2000 KW - algorithms KW - asynchronous KW - consensus KW - indulgent KW - model AU - Guerraoui, Rachid PY - 2000/// UR - http://dx.doi.org/10.1145/343477.343630 ER -