Results 1 
5 of
5
Distributed File Allocation with Consistency Constraints
 in Proceedings of the International Conference on Distributed Computing Systems
, 1992
"... We consider the resource allocation problem in distributed computing systems that have strict mutual consistency requirements. Our model incorporates the behavior of consistency control algorithms, which ensure that mutual consistency of replicated data is preserved even when communication links of ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
We consider the resource allocation problem in distributed computing systems that have strict mutual consistency requirements. Our model incorporates the behavior of consistency control algorithms, which ensure that mutual consistency of replicated data is preserved even when communication links of the computer network and/or computers on which the files reside fail. The problem of resource allocation in these networks is significant in terms of the efficiency of operations and the reliability of the network. The constrained resource allocation problem is formulated as a mixed nonlinear integer program. An efficient algorithm is proposed to solve this problem. The performance of the algorithm is evaluated in terms of the algorithm's accuracy, efficiency and execution times, using a representative problem set. 1 Introduction Consider a distributed computing system (DCS) that is made up of a set of sites (nodes) connected through communication links which transmit information from one s...
Regeneration with Virtual Copies for Replicated Databases
 In Proceedings of the 11th IEEE International Conference on Distributed Computing Systems
, 1991
"... We consider the consistency control problem for replicated data in a distributed computing system (DCS) and propose a new algorithm to dynamically regenerate copies of data objects in response to node failures and network partitioning in the system. The DCS is assumed to have strict consistency cons ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
We consider the consistency control problem for replicated data in a distributed computing system (DCS) and propose a new algorithm to dynamically regenerate copies of data objects in response to node failures and network partitioning in the system. The DCS is assumed to have strict consistency constraints for data object copies. The new algorithm combines the advantages of voting based algorithms and regeneration mechanisms to maintain mutual consistency of replicated data objects in the case of node failures and network partitioning. Our algorithm extends the feasibility of regeneration to DCS on wide area networks, and is able to satisfy user queries as long as there is one current partition in the system. 1 Introduction In a distributed computing environment, two types of failures may occur: the processor at a given site may fail (referred to as site failure), and communication between two sites may fail (referred to as communication link failure). When a site fails, processing at...
Regeneration with Virtual Copies for Distributed Computing Systems
 IEEE Trans. Softw. Eng
, 1994
"... We consider the consistency control problem for replicated data in a distributed computing system (DCS) and propose a new algorithm to dynamically regenerate copies of data objects in response to node failures and network partitioning in the system. The DCS is assumed to have strict consistency cons ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We consider the consistency control problem for replicated data in a distributed computing system (DCS) and propose a new algorithm to dynamically regenerate copies of data objects in response to node failures and network partitioning in the system. The DCS is assumed to have strict consistency constraints for data object copies. The new algorithm combines the advantages of voting based algorithms and regeneration mechanisms to maintain mutual consistency of replicated data objects in the case of node failures and network partitioning. Our algorithm extends the feasibility of regeneration to DCS on wide area networks, and is able to satisfy user queries as long as there is one current partition in the system. A stochastic availability analysis of our algorithm shows that it provides improved availability as compared to previously proposed dynamic voting algorithms. 1 Introduction In a distributed computing environment, two types of failures may occur: the processor at a given site may...
OrderP: An Algorithm to Order Network Partitionings
"... this paper, we propose an algorithm that orders network partitionings in decreasing order of probability. This algorithm is similar to the Most Probable State Enumeration (MPSE) algorithm proposed by Li and Silvester. By looking at only the most probable partitionings, a good estimate of the perform ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
this paper, we propose an algorithm that orders network partitionings in decreasing order of probability. This algorithm is similar to the Most Probable State Enumeration (MPSE) algorithm proposed by Li and Silvester. By looking at only the most probable partitionings, a good estimate of the performance of the network may be obtained. This approach also gives bounds on the network performance. Two distinct goals, both equally important, have been attained in this paper. First we have proposed an algorithm OrderP, to generate network partitionings in the order of their decreasing probabilities of occurrence. We are not aware of any other algorithm that specifically orders network partitionings. However, three algorithms (Order, OrderII, and NewOrder) that generate network states in order of their decreasing state probabilities are known, for dualmode (up/down) components. We improvised these algorithms to generate the most probable network partitionings and then made a comparison with algorithm OrderP. OrderP has a lower computational complexity than all of the three improvised algorithms. The second goal has been to apply the algorithm in the real world and demonstrate its value in performance modeling of distributed systems. We believe that with the development of this algorithm, performance modeling of fairly large systems, hitherto unattempted due to large computational costs will be feasible. Although the obtained probabilities of occurrence of various partitionings using OrderP, are estimates of their real values, we claim that the approximation is close enough and substantiate this claim with an example. A methodology to compute performance measures under conditions of network partitioning has also been proposed, and corroborated with examples in the domain ...
BUILDING DISTRIBUTED DAT ABASE SYSTEMS † by
"... Several design principles necessary to build high performance and reliable distributed database systems have evolved from conceptual research, prototype implementations, and experimentation during the eighties. This paper focuses on the important aspects of transaction processing, including: communi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Several design principles necessary to build high performance and reliable distributed database systems have evolved from conceptual research, prototype implementations, and experimentation during the eighties. This paper focuses on the important aspects of transaction processing, including: communication, concurrency, atomicity, replication, and recovery as they apply to distributed systems. Implementation of these in eleven experimental and commercial distributed systems are briefly presented. Details of atwelfth system called RAID that has been implemented by us are included to show our design and implementation strategies. The relationship between database and operating systems is discussed along with the desirable features in communication software for reliable processing. This material has been presented to demonstrate the practicality of certain successful design and implementation choices so as to benefit those who have the responsibility for making distributed systems work.