Distributed file allocation with consistency constraints

Author

Tewari, Raj ; Adam, Nabil R.

Author_Institution

Temple Univ., Philadelphia, PA, USA

fYear

1992

fDate

9-12 Jun 1992

Firstpage

408

Lastpage

415

Abstract

The resource allocation problem in distributed computing systems that have strict mutual consistency requirements is discussed. A model that 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 is presented. 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 its accuracy, efficiency and execution times, using a representative problem set

Keywords

data integrity; distributed databases; resource allocation; computer network; computers; consistency constraints; distributed computing systems; distributed file allocation; execution times; mixed nonlinear integer program; mutual consistency requirements; replicated data; resource allocation; Availability; Communication system control; Computer network reliability; Computer networks; Cost function; Distributed computing; Distributed control; Financial advantage program; Resource management; Telecommunication network reliability;

fLanguage

English

Publisher

ieee

Conference_Titel

Distributed Computing Systems, 1992., Proceedings of the 12th International Conference on

Conference_Location

Yokohama

Print_ISBN

0-8186-2865-0

Type

conf

DOI

10.1109/ICDCS.1992.235014

Filename

235014