作者：
Lin, James J.Liu, Ming T.Ohio State Univ
Dep of Computer & Information Science Columbus OH USA Ohio State Univ Dep of Computer & Information Science Columbus OH USA
The system design and performance evaluation of a local data network for very large distributeddatabases. The growing database problem stimulates the need of hardware support for data management in distributed system...
详细信息
The system design and performance evaluation of a local data network for very large distributeddatabases. The growing database problem stimulates the need of hardware support for data management in distributedsystems. A novel hardware configuration, the distributed Double-Loop Data Network (DDLDN), is exemplified. Concurrency control mechanisms and query processing techniques used in the DDLDN are described. Optimal strategy for disk allocation is selected. A performance comparison is made for different types of systems.under various conditions, showing superior performance of the DDLDN. Finally, a way to cope with potential growth of the system is demonstrated.
It is suggested that it is helpful to study reliable distributedsystems.from the point of view of nondeterministic sequential systems. The faulty and distributed nature of systems.can be captured by nondeterminism, s...
详细信息
ISBN:
(纸本)0818607378
It is suggested that it is helpful to study reliable distributedsystems.from the point of view of nondeterministic sequential systems. The faulty and distributed nature of systems.can be captured by nondeterminism, so there is a unity to the study of faulty and fault-free systems.faulty systems.are at one end of the spectrum and fault-free systems.are at the other. Similarly, there is a unity to the study of distributed and sequential systems. It is suggested that all systems. whether faulty or fault-free, whether distributed or sequential, can be handled in a unified way by treating the system as a nondeterministic sequential program.
The authors introduce a new concept in naming for distributedsystems. which is motivated by the need for easily-migratable objects, which is in turn motivated by the need for reliable operations. This naming scheme a...
详细信息
ISBN:
(纸本)0818605642
The authors introduce a new concept in naming for distributedsystems. which is motivated by the need for easily-migratable objects, which is in turn motivated by the need for reliable operations. This naming scheme attempts to solve certain problems associated with correcting remote references to objects which are subject to migration. A name is divided into two parts, of which the first is used to locate the possible current sites of a target object and the second is used to select the specific site (and hence the object) in which the object is to be found. The set of possible sites constitutes a cluster. The authors discuss how clusters and cluster-based naming can be applied to enhance the migratability, and thus reliability, of a system in our context. The same scheme may be applied for other purposes such as load-balancing, protection, and support of transparent services.
Efforts at achieving reliability in distributed computing include the incorporation of fault-tolerance into system software such as routing tables, and the introduction of extra software to mask processor failures, su...
详细信息
ISBN:
(纸本)0818605642
Efforts at achieving reliability in distributed computing include the incorporation of fault-tolerance into system software such as routing tables, and the introduction of extra software to mask processor failures, such as Byzantine agreement. A set of n processors running software that can tolerate k faults is called a (k,n)-resilient system. Most (k,n)-resilient systems.have a higher probability of failure in the long run, and a smaller mean time-to-failure, than one processor. Further, large systems.fail in a very well-defined period, and they fail very quickly if n is more than linear in k.
Some ideas on the construction of user applications as atomic actions are developed. Atomic actions that last a long time pose several problems if conventional ideas on concurrency control and recovery are applied. Wh...
详细信息
Some ideas on the construction of user applications as atomic actions are developed. Atomic actions that last a long time pose several problems if conventional ideas on concurrency control and recovery are applied. What is required is some means of delaying commitment without sacrificing performance. A model is proposed in which it is possible for an action to release and process as yet uncommitable objects. The impact of this on recovery is also discussed.
作者：
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.
The authors examine the various kinds of distributedsystems.and discuss some of the reliability issues involved. They first concentrate on the causes of unreliability, illustrating these with some general solutions a...
详细信息
ISBN:
(纸本)0818607378
The authors examine the various kinds of distributedsystems.and discuss some of the reliability issues involved. They first concentrate on the causes of unreliability, illustrating these with some general solutions and examples. Among the issues treated are interprocess communication, machine crashes, server redundancy, and data integrity. Then they examine one distributed operating system, Amoeba, to see how reliability issues have been handled in at least one real system, and how the pieces fit together.
作者：
Minoura, ToshimiUniv of Southern California
Dep of Electrical Engineering-Systems Los Angeles CA USA Univ of Southern California Dep of Electrical Engineering-Systems Los Angeles CA USA
Two schemes for realizing mutual exclusion in a distributed system are discussed. The ranking scheme is a common framework for the three mutual exclusion algorithms found in the literature. In the ranking scheme, the ...
详细信息
Two schemes for realizing mutual exclusion in a distributed system are discussed. The ranking scheme is a common framework for the three mutual exclusion algorithms found in the literature. In the ranking scheme, the site with the smallest rank number can enter the mutual exclusion state. Another method of realizing mutual exclusion is to let a single 'control token' float in the system and to allow only its holder to enter the mutual exclusion state. One result in this paper shows how the control token is effectively transferred by the ranking scheme.
Intuition tells us that in a distributed DBMS using two phase locking, the ratio (denoted by R/W) of read-only to update transactions affects system performance - the higher the ratio, the better the performance. Read...
详细信息
Intuition tells us that in a distributed DBMS using two phase locking, the ratio (denoted by R/W) of read-only to update transactions affects system performance - the higher the ratio, the better the performance. Read-only transactions only request share locks, and thus should cause fewer conflicts and deadlocks among all transactions. Therefore both read-only and update transactions are expected to perform better if R/W is higher. The results of a study contradicting this intuition are reported, and the relationship between the R/W ratio and system performance in detail.
A method for testing, debugging, and measuring distributedsystems.is described. The test method accompanies the implementation as well as the operation of distributedsystems. During implementation, the test tools al...
详细信息
ISBN:
(纸本)0818607378
A method for testing, debugging, and measuring distributedsystems.is described. The test method accompanies the implementation as well as the operation of distributedsystems. During implementation, the test tools allow users to monitor and control the tested system at different problem-oriented levels. The immense amount of information is graphically displayed in easy-to-read charts and graphs. During operation, the test system permanently monitors systems.behavior and measures system performance. The author views performance and analysis measurements during operation as an integral part of the system. The test method and tools promote an improved understanding of run-time behavior and possibly of functional requirements of distributedsystems. They provide performance measurements to derive qualitative and even quantitative assessments about distributedsystems.
暂无评论