Many proposals have been made for structuring distributed programs. This paper looks at one such proposal, the one embedded in the Argus programming language and system. The paper provides a discussion of decisions ma...
详细信息
ISBN:
(纸本)0818605014
Many proposals have been made for structuring distributed programs. This paper looks at one such proposal, the one embedded in the Argus programming language and system. The paper provides a discussion of decisions made in the two major areas of process structure and communication, and compares the chosen structures with alternatives. The paper emphasizes the rationale for decisions and the issues that must be considered in making such decisions.
This paper describes an object-oriented design model for structuring reliable distributedsystems. A system is viewed as a collection of objects that are accessed and modified by transactions. Recovery techniques are ...
详细信息
ISBN:
(纸本)0818605014
This paper describes an object-oriented design model for structuring reliable distributedsystems. A system is viewed as a collection of objects that are accessed and modified by transactions. Recovery techniques are incorporated to make transactions atomic in the presence of component crashes and concurrent operations. Atomicity of transactions is based on constructing recoverable objects using multiple versions and commit protocols. These concepts are extended to nested transactions. The operations on distributed objects are performed as remote procedure calls. This requires implementation of remote procedure calls in a reliable fashion. The facilities of reliable nested transactions and remote procedure calls are used to synthesize distributed objects that are highly reliable.
作者：
Banatre, J.P.Banatre, M.Ployette, F.INSA
Inst de Recherche en Informatique et Systemes Aleatoires Rennes Fr INSA Inst de Recherche en Informatique et Systemes Aleatoires Rennes Fr
The first part of this paper describes a distributed auction bidding system and its major requirements. The hardware and software structure of the system are quickly sketched. The second part of the paper concentrates...
详细信息
ISBN:
(纸本)0818605014
The first part of this paper describes a distributed auction bidding system and its major requirements. The hardware and software structure of the system are quickly sketched. The second part of the paper concentrates upon crash recovery aspects in the system. The three major aspects which are developed concern: (i) stable storage, (ii) implementation of commit protocol and (iii) description of recovery algorithms.
This paper describes the requirements and attributes of the Experimental distributed Processing Facility (EDPF). The EDPF will provide a flexible and dynamically reconfigurable distributed environment that will be use...
详细信息
ISBN:
(纸本)0818605014
This paper describes the requirements and attributes of the Experimental distributed Processing Facility (EDPF). The EDPF will provide a flexible and dynamically reconfigurable distributed environment that will be used to address generic distributed processing issues as applied to the needs of the future battlefield. Survivability and reliability are the key issues under investigation. The EDPF will integrate the requirements for standard hardware and software. This facility will focus on loosely coupled nodes over newly developed (e. g. , fiber optics) or transitional communications media. All designs and implementations performed on the EDPF will use the Ada programming language. The EDPF will be used in a laboratory environment where system performance analysis can be performed on various distributed processing models. The EDPF will be capable of being deployed in a field environment for future tactical demonstrations.
作者：
Thanos, C.Carlesi, C.Bertino, E.CNR
Istituto di Elaborazione della Informazione Pisa Italy CNR Istituto di Elaborazione della Informazione Pisa Italy
In this paper the relationship between average transaction response time and the static degree of interference for four concurrency control algorithms based on two-phase locking is established. In particular the incre...
详细信息
ISBN:
(纸本)0818605014
In this paper the relationship between average transaction response time and the static degree of interference for four concurrency control algorithms based on two-phase locking is established. In particular the increase in average response time has been measured with respect to the static degree of interference for a given multiprogramming level, database and transaction size. Also the increase in average probability of a lock request conflicting with another one has been measured with respect to the static degree of interference. In addition the average number of aborted transactions has been measureed for each algorithms.
作者：
York, GaryCarnegie-Mellon Univ
Dep of Electrical Engineering Pittsburgh PA USA Carnegie-Mellon Univ Dep of Electrical Engineering Pittsburgh PA USA
Many modern reliable systems.are N-modular redundancy and voting to achieve the required reliability. Most of these systems.assume that the redundant modules are synchronized. Experiments have been performed on the mu...
详细信息
ISBN:
(纸本)0818605014
Many modern reliable systems.are N-modular redundancy and voting to achieve the required reliability. Most of these systems.assume that the redundant modules are synchronized. Experiments have been performed on the multiprocessor with redundant software modules that are allowed to execute with various degrees of asynchrony. The performance of such systems.has been experimentally determined along two lines. The first experiment determined how much overhead is added to the system execution time as the voting frequency changes. The second experiment shows how much asynchrony can be tolerated in prcess execution for three different experimental paradigms. Mathematical models for the experiments have been developed that closely model the experimental results.
When a data item of a database system is updated, a typical reliable storage update mechanism performs three or four secondary storage write operations in order to update the data redundantly stored on secondary stora...
详细信息
ISBN:
(纸本)0818605014
When a data item of a database system is updated, a typical reliable storage update mechanism performs three or four secondary storage write operations in order to update the data redundantly stored on secondary storage. Thus, updating the data on secondary storage may become the bottleneck for transaction processing. We show that internal processing of transactions can be separated from secondary storage update operations, and that the database state defined by the secondary storage data can be maintained consistent if updates of transactions are moved to secondary storage according to the 'U-precedence' defined for the transaction that created them. Therefore, secondary storage update operations can be buffered as long as this requirement is satisfied. Secondary storage update buffering can enhance the performance of databasesystems.since it allows more concurrency and flexible disk scheduling.
Failures in a distributed system (such as node crashes) can give rise to unwanted computations referred to as orphans. Orphans can interfere with executions of other programs, thus giving rise to unpredictable behavio...
详细信息
ISBN:
(纸本)0818605014
Failures in a distributed system (such as node crashes) can give rise to unwanted computations referred to as orphans. Orphans can interfere with executions of other programs, thus giving rise to unpredictable behavior. In this paper a graph model of computation is utilized to discuss the orphan phenomenon in a rigorous manner. In particular, conditions are derived for interference-free executions of programs. In a distributed system consisting of 'clients' and 'servers', where clients interact with servers by making use of remote procedure calls, various techniques for treating orphans under 'at least once' and 'exactly once' call semantics are next investigated.
暂无评论