Recoverable distributed shared memory /
a shared, coherent memory address space, provided by the
| Main Author: | |
|---|---|
| Format: | Thesis eBook |
| Language: | English |
| Published: |
[Place of publication not identified] :
[publisher not identified] ;
1996.
|
| Subjects: | |
| Online Access: | Link to OAKTrust copy |
| Summary: | a shared, coherent memory address space, provided by the additional information about the occurrence of reads. Unlike been proposed for implementing a reliable DSM, require the behaves like a failure-free system. Many algorithms that have communication, implemented on top of message passing systems. Distributed Shared Memory (DSM) is a model for interprocess executing on such a system increases, the likelihood of execution. We propose a new recoverable DSM algorithm to In this model, processes running on separate hosts can access interval can be tailored to balance the cost of checkpointing keeps track of the dependencies by logging writes and some message and the logging overheads. of message passing, it has become a convenient model to work often. The technique uses independent checkpointing and operations. Thus, by avoiding the programming complexities previous recovery techniques, this one reduces both the processes to take checkpoints whenever there is a data processor failure due to machine malfunction, power failure, processors in the system and the running time of applications systems can possibly be achieved only if the whole system tolerate multiple node failures and where the checkpointing transfer, thus resulting in high overhead during failure-free underlying DSM system, through the normal read and write uniprocessors to distributed environments, As the number of user error, etc., increases. The benefits given by these versus the savings in recovery obtained by taking checkpoints with. It is a natural extension of parallel programming on |
|---|---|
| Item Description: | "Major subject: Computer Science". Vita. |
| Physical Description: | viii, 38 leaves : illustrations ; 28 cm. Also available online. Issued also on microfiche from Lange Micrographics. |
| Bibliography: | Includes bibliographical references: pages 35-37. |