In asynchronous systems where processes are prone to crash
failures, we show that fair exchange is incomparable to distributed consensus.
By incomparability we mean there exist failure detector classes
that solve fair exchange and not distributed consensus, and vice versa.
Remarkably, this is in contrast to the folklore belief that solving fair
exchange is generally harder than solving distributed consensus.
|Title of host publication||Theoretical Aspects of Computing - ICTAC 2008 (5th International Colloquium, Istanbul, Turkey, September 1-3, 2008, Proceedings)|
|Editors||J.S. Fitzgerald, A.E. Haxthausen, H. Yenigun|
|Place of Publication||Berlin|
|Publication status||Published - 2008|
|Name||Lecture Notes in Computer Science|