Evaluation of Consistent Logical Checkpointing /
a consistent global state by logging messages is that we
| Main Author: | |
|---|---|
| Format: | Thesis eBook |
| Language: | English |
| Published: |
[Place of publication not identified] :
[publisher not identified] ;
1995.
|
| Subjects: | |
| Online Access: | Link to OAKTrust copy |
| Summary: | a consistent global state by logging messages is that we achieve a consistent recovery line. The reason why we obtain algorithm consists of individual physical checkpoints by all application in a reasonable amount of time, in spite of assume the processes to be deterministic. A deterministic checkpoint size, the number of messages to be logged, etc., Checkpointing is shown to give better checkpoint overheads as compared to Chandy and Lamport algorithm for the different Consistent Logical Checkpointing increases efficiency by failures. We would like to be able to deal with failures from the different variation, using heuristics, is presented. In the world of distributed processing it is desirable that major result of this thesis is that Consistent Logical mented and compared to Chandy and Lamport Algorithm. necessary to provide fault-tolerance, to complete the of this thesis is to come up with an efficient algorithm for other processes. For long-running applications, it is process is one whose state at any point in time depends only processes. Message logging is done in the second phase to scheme, called Consistent Logical Checkpointing, is imple since they formulate the heuristics for the application. staggering the checkpoints so that the contention for writing taking checkpoints with lower overheads. A new checkpointing the failure of one or more processes does not affect all the the scheme are discussed. And adaptive algorithm to choose This algorithm depends upon various factors such as the to the stable storage is minimized. The first phase of the types of applications presented. A few variations to improve upon its initial state and the messages received by it. The which in turn is made possible by checkpointing. The purpose with minimum loss. This is achieved by rollback recovery |
|---|---|
| Item Description: | "Major subject: Computer Science". Vita. |
| Physical Description: | xi, 72 leaves : illustrations ; 28 cm. Also available online. Issued also on microfiche from Lange Micrographics. |
| Bibliography: | Includes bibliographical references. |