On the weakest failure detector ever Export

@inproceedings{citeulike:4051150, abstract = {Many problems in distributed computing are impossible when no information about process failures is available. It is common to ask what information about failures is necessary and sufficient to circumvent some specific impossibility, e.g., consensus, atomic commit, mutual exclusion, etc. This paper asks what information about failures is needed to circumvent any impossibility and sufficient to circumvent some impossibility. In other words, what is the minimal yet non-trivial failure informatio.}, address = {New York, NY, USA}, author = {Guerraoui, Rachid and Herlihy, Maurice and Kouznetsov, Petr and Lynch, Nancy and Newport, Calvin}, booktitle = {PODC '07: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing}, citeulike-article-id = {4051150}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1281135}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1281100.1281135}, doi = {10.1145/1281100.1281135}, isbn = {978-1-59593-616-5}, keywords = {2007, failure\_detectors, model, weakest}, location = {Portland, Oregon, USA}, pages = {235--243}, posted-at = {2009-02-14 12:22:50}, priority = {2}, publisher = {ACM}, title = {On the weakest failure detector ever}, url = {http://dx.doi.org/10.1145/1281100.1281135}, year = {2007} }

TY - CONF ID - citeulike:4051150 L3 - citeulike-article-id:4051150 N2 - Many problems in distributed computing are impossible when no information about process failures is available. It is common to ask what information about failures is necessary and sufficient to circumvent some specific impossibility, e.g., consensus, atomic commit, mutual exclusion, etc. This paper asks what information about failures is needed to circumvent any impossibility and sufficient to circumvent some impossibility. In other words, what is the minimal yet non-trivial failure informatio. CY - Portland, Oregon, USA SN - 978-1-59593-616-5 AD - New York, NY, USA EP - 243 TI - On the weakest failure detector ever PB - ACM T2 - PODC '07: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing SP - 235 KW - 2007 KW - failure_detectors KW - model KW - weakest AU - Guerraoui, Rachid AU - Herlihy, Maurice AU - Kouznetsov, Petr AU - Lynch, Nancy AU - Newport, Calvin PY - 2007/// UR - http://dx.doi.org/10.1145/1281100.1281135 ER -