Abstract

As today Computer Science is more and more (driven) consumed by its applications, it becomes more and more important to know what is and what is not computable. For a long time now, this has been relatively well understood in sequential computing. But today the computing world becomes more and more distributed, and consequently more and more applications are distributed. As a result, it becomes important, or even crucial, to understand what is distributed computing and which are its power and its limits. This article is a step in this direction from an agreement-oriented and fault-tolerance perspective.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call