登入選單
返回Google圖書搜尋
出版Cornell University, Department of Computer Science, 1991
URLhttp://books.google.com.hk/books?id=Lna0HAAACAAJ&hl=&source=gbs_api
註釋Abstract: "We introduce the concept of failure detectors for asynchronous systems with crash failures. We show that even with a failure detector that makes an unbounded and possibly infinite number of mistakes, we can solve the Consensus and Atomic Broadcast problems, two fundamental paradigms of fault-tolerant computing that are known to be unsolvable in asynchronous systems. We characterize failure detectors in terms of their completeness and accuracy properties, and classify them in a hierarchy ordered by a reducibility relation. We present matching upper and lower bounds on the fault-tolerance of solutions to Consensus and Atomic Broadcast for members of this hierarchy."