David Leo Presotto

EECS Department
University of California, Berkeley
Technical Report No. UCB/CSD-83-165
December 1983

http://www2.eecs.berkeley.edu/Pubs/TechRpts/1983/CSD-83-165.pdf

Today's computing environment is becoming increasingly more distributed. Due to their flexibility and inherent parallelism, distributed systems can be both more personalized and more powerful than centralized computers. However, with their qualitative and quantitative increases in complexity, distributed systems are more susceptible to failure. One way of increasing the reliability of these systems is to recover from faults before they lead to failures.

A number of methods have already been developed to perform fault recovery in distributed systems: recovery lines, recoverable transactions, and shadow processes. In order to effect time-bounded recovery, each of these methods requires interaction with the user application. This interaction may sometimes fit naturally into the application program. However, in many instances, the lack of transparency of the recovery system may significantly restrict the application programmer's style. Also, existing programs need to be rewritten to make use of these methods.

Making recovery transparent to the program being recovered is, in the most general case, a difficult and, perhaps, unsolvable problem. However, by considering only message-based systems, the problem can be greatly simplified. Message-based systems, especially those connected by low cost broadcast media, represent the most common type of distributed system. We have developed a new communications model for such systems called published communications. In this model, a passive recorder reliably stores all messages broadcast onto the network. Coupled with the idea of deterministic programs, published communications allows the transparent recovery of processes in a distributed system.

In order to evaluate the consistency of the model with message-based systems, an initial implementation has been added to an existing message-based system, DEMOS/MP to the model. However, it was not necessary to change any programs already running on the system.

The performance of published communications was determined both by evaluating a queuing model of the system under different loads and by measuring the DEMOS/MP implementations. The simulation shows that recorder, constructed from current technology, can support a system of up to 115 users. The measurements show that the steady state costs of publishing messages is low.

Advisor: Michael L. Powell

BibTeX citation:

@phdthesis{Presotto:CSD-83-165,
    Author = {Presotto, David Leo},
    Title = {PUBLISHING: A Reliable Broadcast Communication Mechanism},
    School = {EECS Department, University of California, Berkeley},
    Year = {1983},
    Month = {Dec},
    URL = {http://www2.eecs.berkeley.edu/Pubs/TechRpts/1983/5953.html},
    Number = {UCB/CSD-83-165},
    Abstract = {Today's computing environment is becoming increasingly more distributed. Due to their flexibility and inherent parallelism, distributed systems can be both more personalized and more powerful than centralized computers. However, with their qualitative and quantitative increases in complexity, distributed systems are more susceptible to failure. One way of increasing the reliability of these systems is to recover from faults before they lead to failures.  <p>  A number of methods have already been developed to perform fault recovery in distributed systems: recovery lines, recoverable transactions, and shadow processes. In order to effect time-bounded recovery, each of these methods requires interaction with the user application. This interaction may sometimes fit naturally into the application program. However, in many instances, the lack of transparency of the recovery system may significantly restrict the application programmer's style. Also, existing programs need to be rewritten to make use of these methods.  <p>  Making recovery transparent to the program being recovered is, in the most general case, a difficult and, perhaps, unsolvable problem. However, by considering only message-based systems, the problem can be greatly simplified. Message-based systems, especially those connected by low cost broadcast media, represent the most common type of distributed system. We have developed a new communications model for such systems called published communications. In this model, a passive recorder reliably stores all messages broadcast onto the network. Coupled with the idea of deterministic programs, published communications allows the transparent recovery of processes in a distributed system.  <p>  In order to evaluate the consistency of the model with message-based systems, an initial implementation has been added to an existing message-based system, DEMOS/MP to the model. However, it was not necessary to change any programs already running on the system.  <p>  The performance of published communications was determined both by evaluating a queuing model of the system under different loads and by measuring the DEMOS/MP implementations. The simulation shows that recorder, constructed from current technology, can support a system of up to 115 users. The measurements show that the steady state costs of publishing messages is low.}
}

EndNote citation:

%0 Thesis
%A Presotto, David Leo
%T PUBLISHING: A Reliable Broadcast Communication Mechanism
%I EECS Department, University of California, Berkeley
%D 1983
%@ UCB/CSD-83-165
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/1983/5953.html
%F Presotto:CSD-83-165