Shaula Yemini

TL;DR: Optimistic Recovery is a new technique supporting application-independent transparent recovery from processor failures in distributed systems that can tolerate the failure of an arbitrary number of processors and yields better throughput and response time than other general recovery techniques whenever failures are infrequent.

TL;DR: In this paper, a computer implemented method on a computer readable media is provided for determining the source of a problem in a complex system of managed components based upon symptoms, where the problem source identification process is split into different activities.

TL;DR: In this article, an apparatus and method is provided for efficiently determining the source of problems in a complex system based on observable events, where the problem identification process is split into two separate activities of (1) generating efficient codes for problem identification and (2) decoding the problems at runtime.

TL;DR: In this paper, a distributed system whose state space is partitioned into recovery units, wherein recovery units communicate by the exchange of messages and wherein a message received by a recovery unit may causally depend on other recovery units having received prior messages, a method of recovering from failure of any number of recovery units in the system comprising the steps of: (a) tracking the dependency of each message received in terms of the causative messages received by other receivers, and (b) restoring all recovery units to a consistent system-wide state after recovery unit failure by means of the tracked message dependencies

TL;DR: The authors introduce two enhancements to optimistic recovery which allow messages to be logged without performing any I/O to stable storage and show that the combination of these two optimizations yields a transparent n-fault-tolerant system which logs to stablestorage only those messages received from the outside world and a very small number of additional messages.