TL;DR: The design methodologies for fault-tolerant, real-time and responsive systems are discussed, and novel techniques for introducing redundancy for improved performance and dependability are illustrated.
Abstract: A concept of responsive computer systems is presented. The emerging responsive systems demand fault-tolerant and real-time performance in parallel and distributed computing environments. A new design framework for responsive systems is introduced. It is based on a fundamental problem of consensus. Then, a new measure of responsiveness for specifying fault tolerance and real-time requirements is described. Next, the design methodologies for fault-tolerant, real-time and responsive systems are discussed, and novel techniques for introducing redundancy for improved performance and dependability are illustrated.
TL;DR: Interestingly, distributed computing systems concepts and structures that you really wait for now is coming and it's significant to wait for the representative and beneficial books to read.
Abstract: Interestingly, distributed computing systems concepts and structures that you really wait for now is coming. It's significant to wait for the representative and beneficial books to read. Every book that is provided in better way and utterance will be expected by many peoples. Even you are a good reader or not, feeling to read this book will always appear when you find it. But, when you feel hard to find it as yours, what to do? Borrow to your friends and don't know when to give back it to her or him.
TL;DR: The principles of a new approach (Fragmented Data Processing) are presented that seems to be a promising approach to solve, at least partially, the problem of Secure and Reliable Processing in Distributed Computing Systems.
Abstract: This paper presents a new approach for solving the problem of reliable processing of sensitive information in distributed computing systems1. Distributed systems offer redundancy that can be used to enhance reliability by means of adequate fault tolerance mechanisms. For security requirements, a given computer cannot be used to run any application . Consequently, only a given set of trusted processors can be used, thus reducing the flexibility of the network. In this paper, we first discuss the problem of ensuring both security and reliability in distributed systems. Then we present the principles of a new approach (Fragmented Data Processing), which is currently being investigated at LAAS, and that seems to be a promising approach to solve, at least partially, the problem of Secure and Reliable Processing in Distributed Computing Systems.
TL;DR: ConTracts is designed to build large distributed applications from short ACID-transactions by using an explicit control flow description by the system to reliably control and manage a long-living application's execution.
Abstract: ConTracts are designed to build large distributed applications from short ACID-transactions. They provide a framework for treating the resulting computations as recoverable objects. The key idea is to use an explicit control flow description by the system to reliably control and manage a long-living application's execution. No system failure at execution time should trouble the application programmer. Even in the case of a node crash an affected application should not be aborted but should be continued in the forward direction. >
TL;DR: By year 2000, various communities of users should be provided with provably predictable computing systems, in spite of the fact that run-time conditions might not be fully characterized or might evolve significantly with time.
Abstract: By year 2000, various communities of users should be provided with provably predictable computing systems, in spite of the fact that run-time conditions might not be fully characterized or might evolve significantly with time.
TL;DR: It is illustrated that the migration of existing software towards parallel platforms is a major problem for which some experimental solutions are under development now and the importance of a further integration of distributed and parallel computing is argued.
TL;DR: In the paper a formal method of analysis of self-reconfigurating process of fault-tolerant distributed computing systems is considered and certain algebraic criteria of formal verification of reconfiguration of software part of the system are introduced.
Abstract: In the paper a formal method of analysis of self-reconfigurating process of fault-tolerant distributed computing systems is considered. On the basis of the defined algebraic model of fault-tolerant DCS we introduce certain algebraic criteria of formal verification of reconfigurating process. In order to prove proper reconfiguration of software part of the system we use the method of generation of a global description of the system from the descriptions of its subsystems.