Results 1 
2 of
2
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...
The DeltaWye Approximation Procedure for Twoterminal Reliability
, 1996
"... The DeltaWye Approximation Procedure (DWAP) is a procedure for estimating the twoterminal reliability of an undirected planar network G = (V; E) by reducing the network to a single edge via a sequence of local graph transformations. It combines the probability equations of Lehman  whose sol ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
The DeltaWye Approximation Procedure (DWAP) is a procedure for estimating the twoterminal reliability of an undirected planar network G = (V; E) by reducing the network to a single edge via a sequence of local graph transformations. It combines the probability equations of Lehman  whose solutions provide bounds and approximations of twoterminal reliability for the individual transformations  with the DeltaWye Reduction Algorithm of the second two authors  which performs the corresponding graph reduction in O(jV j 2 ) time. A computational study is made comparing the DWAP to one of the best currently known methods for approximating twoterminal reliability, and it is shown that the DWAP produces approximations that are between 10 and 80 times as accurate. (Figures not included.) 1 Department of Mathematics, Louisiana State University, Baton Rouge, Louisiana. Work partially supported by LEQSF grant no. (9294)RDA09 from the Louisiana Board of Regents. 2 Op...