Download or read book Checkpointing and Recovery for Distributed Shared Memory Applications written by and published by . This book was released on 1995 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Checkpointing and Rollback Recovery in Distributed Shared Memory Systems written by and published by . This book was released on 1994 with total page 24 pages. Available in PDF, EPUB and Kindle. Book excerpt: Checkpointing techniques in parallel systems use dependency tracking and/or message logging to ensure that a system rolls back to a consistent state. Traditional dependency tracking in distributed shared memory systems (DSM) is expensive because of high frequency of communication. In this paper we show that, because of information redundancy, not all message-passing dependences need to be considered to roll back to a consistent state in DSM systems, resulting in reduced dependency tracking overhead and reduced potential for rollback propagation. We develop a model of execution where client processes running an application interact atomically with a set of shared-memory server processes on every access to shared data. We show that under this model, dependences are significantly reduced over the message-passing model. We use results from simulation with multiprocessor address traces to demonstrate the reduction in dependences.
Download or read book Coordinated Checkpointing rollback Error Recovery for Distributed Shared Memory Multicomputers written by G. Janakiraman and published by . This book was released on 1994 with total page 10 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Checkpointing in a Virtual Shared Memory System written by Tony P. Ng and published by . This book was released on 1991 with total page 36 pages. Available in PDF, EPUB and Kindle. Book excerpt: Abstract: "In this paper we describe several checkpointing algorithms for backward error recovery in virtual shared memory systems. Counterparts to some of these algorithms can be found in message-passing systems, but a shared memory system allows a significant optimization. The read-write semantics of the shared memory can be used to distinguish network messages that do not create dependencies from those that do, whereas all messages passed in a message-passing system are assumed to create dependencies. We measure the performance of the checkpointing algorithms using a trace-driven simulation of several shared memory parallel applications.
Download or read book Using Logging and Asynchronous Checkpointing to Implement Recoverable Distributed Shared Memory written by Golden G. Richard and published by . This book was released on 1993 with total page 20 pages. Available in PDF, EPUB and Kindle. Book excerpt: The proposed scheme supports local process recovery without forcing rollback of operational processes during recovery. Our method is particularly useful in environments where taking process checkpoints is expensive (e.g., in some UNIX [trademark] environments)."
Download or read book Logging Checkpointing and Rollback for Localized Recovery in Message Passing and Distributed Shared Memory Systems written by Gaurav Suri and published by . This book was released on 1995 with total page 102 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Using Lightweight Checkpoint recovery to Improve the Availability and Designability of Shared Memory Multiprocessors written by Daniel J. Sorin and published by . This book was released on 2002 with total page 194 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book GRID AND CLUSTER COMPUTING written by C. S. R. PRABHU and published by PHI Learning Pvt. Ltd.. This book was released on 2008-02-14 with total page 180 pages. Available in PDF, EPUB and Kindle. Book excerpt: Grid Computing and Cluster Computing are advanced topics and latest trends in computer science that find a place in the computer science and information technology curricula of many engineering institutes and universities today. Divided into two parts—Part I, Grid Computing and Part II, Cluster Computing—, this compact and concise text strives to make the concepts of grid computing and cluster computing comprehensible to the students through its fine presentation and accessible style. Part I of the book enables the student not only to understand the concepts involved in grid computing but also to build their own grids for specific applications. Similarly, as today supercomputers are being built using cluster computing architectures, Part II provides an insight into the basic principles involved in cluster computing and equips the readers with the knowledge to build their own clusters in-house. Diagrams are used to illustrate the concepts discussed and to enable the reader to actually construct a grid or a cluster himself. The book is intended as a text for undergraduate and postgraduate students of computer science and engineering, information technology (B.Tech./M.Tech. Computer Science and Engineering/IT), and post-graduate students of computer science/information technology (M.Sc. Computer Science and M.Sc. IT). Besides, practising engineers and computer science professionals should find the text very useful.
Download or read book A Checkpointing Strategy for Scalable Recovery on Distributed Parallel Systems written by International Business Machines Corporation. Research Division and published by . This book was released on 1997 with total page 21 pages. Available in PDF, EPUB and Kindle. Book excerpt: Abstract: "In this paper, we describe a new scheme for checkpointing parallel applications on message-passing scalable distributed memory systems. The novelty of our scheme is that a checkpointed application can be restored, from its checkpointed state, in a reconfigured form. Thus, a parallel application may be checkpointed while executing with t1 tasks on p1 processors, and then restarted from the checkpointed state with t2 tasks on p2 processors. As a result, applications can recover from partial failures in the underlying system. Also, the reconfigurable checkpointed states can be migrated from one parallel system to anther even if they do not have the same number of processors. We describe a new programming model for implementing a reconfigurable checkpointing scheme for parallel programs. This new model is derived from the DRMS programming model, developed in the context of run-time reconfiguration of parallel applications. A key component of our implementation is the distribution-independent representation of application array data structures in persistent storage. For further optimizing the performance of checkpoint/restart operations, we provide parallel array section streaming operations for such distributed arrays. We present performance data for the reconfigurable checkpointing and restarting of parallel applications and compare that with the performance of conventional forms of checkpointing. Our results demonstrate the advantages of the new scheme we describe."
Download or read book Checkpointing in Distributed Virtual Memory by Utilizing Local Virtual Memory written by F. X. Nursalim Hadi and published by . This book was released on 1995 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: This study explores a recovery strategy using checkpointing in a distributed shared virtual memory (DVM) system. DVM shares virtual memory in a loosely-coupled multi-computer system and is implemented at the software-level. The goal of this recovery strategy is to obtain a consistent recovery line that is close to the time of failure. Therefore the system could be rolled back from the time of failure to the closest possible state of normal execution. In order to achieve the objective, this thesis proposes a checkpointing strategy that utilizes virtual memory (VM) as transient checkpoint storage in addition to commonly-used stable storage. In controllable checkpoint intervals, these additional checkpoints make checkpoint intervals shorter; in turn making the recovery line closer to the time of failure. Compared to the cost of taking checkpoints to stable storage, taking these additional checkpoints does not cost much since they are saved to virtual memory. This thesis will show that the additional cost of these transient storage checkpoints is very low, while the benefit of reducing the rollback cost is very high. The utilization of VM will be applied to commonly-used independent checkpointing and coordinated checkpointing strategies. The checkpointing protocols of both strategies are changed to accommodate additional checkpointing to VM. This thesis will show that the modified protocols still guarantee state consistency after recovery. Simulations on trace data and experiments on the Choices operating system are conducted to measure the performance of the proposed checkpointing strategies. We compare independent checkpointing strategies with and without VM utilization; we also compare coordinated checkpointing strategies with and without VM utilization. The simulations and experiments demonstrate that in the independent checkpointing strategy, utilizing of VM reduces rollback costs with only a small fraction of additional checkpoint costs. The same result also applies to the coordinated checkpointing strategy utilizing VM.
Download or read book DISTRIBUTED SYSTEM written by Garima Verma/Khusboo Saxena/Sandeep Saxena and published by BPB Publications. This book was released on 2018-06-01 with total page 199 pages. Available in PDF, EPUB and Kindle. Book excerpt: Description:The book has been written in such a way that the concepts are explained in detail, giving adequate emphasis on examples. To make clarity on the topic, diagrams are given extensively throughout the text. Various questions are included the vary widely in type and difficulty to understand the text. The book discusses design issues for phases of Distributed System in substantial depth. The stress is more on problem solving. The students preparing for PHD entrance will also get benefit from this text, for them University questions are also given.Table Of Contents:Chapter 1 : Introduction To Distributed SystemChapter 2 : System ModelsChapter 3 : Theoretical FoundationChapter 4 : Distributed Mutual ExclusionChapter 5 : Distributed Deadlock DetectionChapter 6 : Agreement ProtocolChapter 7 : Distributed File SystemChapter 8 : Distributed Shared MemoryChapter 9 : Failure Recovery In Distributed SystemChapter 10 : Fault ToleranceChapter 11 : Transaction and Concurrency ControlChapter 12 : Distributed TransactionChapter 13 : Replication
Download or read book Distributed Applications and Interoperable Systems written by Frank Eliassen and published by Springer. This book was released on 2006-05-30 with total page 365 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the 6th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable Systems, DAIS 2006, held in Bologna, Italy, June 2006. The book presents 21 revised regular and 5 revised work-in-progress papers, on architectures, models, technologies and platforms for interoperable, scalable and adaptable systems and cover subjects as methodological aspects, tools and language of building adaptable distributed and interoperable services, and many more.
Download or read book Checkpointing a Multithreaded Distributed Shared Memory Computer System written by William R. Dieter and published by . This book was released on 2001 with total page 218 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Checkpointing Shared Memory Programs at the Application level written by M. Schulz and published by . This book was released on 2004 with total page 8 pages. Available in PDF, EPUB and Kindle. Book excerpt: Trends in high-performance computing are making it necessary for long-running applications to tolerate hardware faults. The most commonly used approach is checkpoint and restart(CPR)-the state of the computation is saved periodically on disk, and when a failure occurs, the computation is restarted from the last saved state. At present, it is the responsibility of the programmer to instrument applications for CPR. Our group is investigating the use of compiler technology to instrument codes to make them self-checkpointing and self-restarting, thereby providing an automatic solution to the problem of making long-running scientific applications resilient to hardware faults. Our previous work focused on message-passing programs. In this paper, we describe such a system for shared-memory programs running on symmetric multiprocessors. The system has two components: (i)a pre-compiler for source-to-source modification of applications, and (ii) a runtime system that implements a protocol for coordinating CPR among the threads of the parallel application. For the sake of concreteness, we focus on a non-trivial subset of OpenMP that includes barriers and locks. One of the advantages of this approach is that the ability to tolerate faults becomes embedded within the application itself, so applications become self-checkpointing and self-restarting on any platform. We demonstrate this by showing that our transformed benchmarks can checkpoint and restart on three different platforms (Windows/x86, Linux/x86, and Tru64/Alpha). Our experiments show that the overhead introduced by this approach is usually quite small; they also suggest ways in which the current implementation can be tuned to reduced overheads further.
Download or read book Experimental and Efficient Algorithms written by Sotiris Nikoletseas and published by Springer Science & Business Media. This book was released on 2005-04-28 with total page 637 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the 4th International Workshop on Experimental and Efficient Algorithms, WEA 2005, held in Santorini Island, Greece in May 2005. The 47 revised full papers and 7 revised short papers presented together with extended abstracts of 3 invited talks were carefully reviewed and selected from 176 submissions. The book is devoted to the design, analysis, implementation, experimental evaluation, and engineering of efficient algorithms. Among the application areas addressed are most fields applying advanced algorithmic techniques, such as combinatorial optimization, approximation, graph theory, discrete mathematics, scheduling, searching, sorting, string matching, coding, networking, data mining, data analysis, etc.
Download or read book Proceedings written by IEEE Computer Society and published by Institute of Electrical & Electronics Engineers(IEEE). This book was released on 1997 with total page 256 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Distributed and Parallel Computing written by Andrzej Goscinski and published by Springer Science & Business Media. This book was released on 2005-09-19 with total page 463 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the 6th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2005, held in Melbourne, Australia in October 2005. The 27 revised full papers and 25 revised short papers presented were carefully reviewed and selected from 95 submissions. The book covers new architectures of parallel and distributed systems, new system management facilities, and new application algorithms with special focus on two broad areas of parallel and distributed computing, i.e., architectures, algorithms and networks, and systems and applications.
