A model for optimal database allocation in distributed computing systems

Optimal allocation of redundant resources in distributed computing systems is studied. In the model, the triple module redundancy (TMR) scheme is adopted to enhance the reliability of the operations. A retrieval request from a site for a database will be processed by three database servers. The output results will be obtained by majority voting. The objective is to find the number of database copies and their locations that optimize the total operation cost. Both static and dynamic allocation environments are considered. The problem is formulated as a zero/one integer programming problem. Preliminary test results show that the algorithm has fast convergence and provides a tight lower bound for the optimal operational cost. In particular, it offers high flexibility in terms of termination criteria, which makes it useful in a dynamic allocation environment.<<ETX>>

[1]  R. G. Casey,et al.  Allocation of copies of a file in an information network , 1899, AFIPS '72 (Spring).

[2]  Dorit S. Hochbaum,et al.  Database Location in Computer Networks , 1980, JACM.

[3]  Philip H. Enslow.  What is a "Distributed" Data Processing System? , 1978, Computer.

[4]  Lawrence W. Dowdy,et al.  Comparative Models of the File Assignment Problem , 1982, CSUR.

[5]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[6]  Wesley W. Chu,et al.  Optimal File Allocation in a Multiple Computer System , 1969, IEEE Transactions on Computers.

[7]  Hector Garcia-Molina,et al.  Database Processing with Triple Modular Redundancy , 1986, Symposium on Reliability in Distributed Software and Database Systems.

[8]  Tony P. Ng,et al.  Replicated transactions , 1989, [1989] Proceedings. The 9th International Conference on Distributed Computing Systems.

[9]  Subhash C. Narula,et al.  Technical Note - An Algorithm for the p-Median Problem , 1977, Oper. Res..

[10]  John A. Stankovic,et al.  A Perspective on Distributed Computer Systems , 1984, IEEE Transactions on Computers.

[11]  Harvey J. Everett.  Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources , 1963 .

[12]  K. Dan Levin,et al.  A Dynamic Optimization Model for Distributed Databases , 1978, Oper. Res..

[13]  Rahul Simha,et al.  A Microeconomic Approach to Optimal Resource Allocation in Distributed Computer Systems , 1989, IEEE Trans. Computers.

[14]  A. M. Geoffrion,et al.  Lagrangean Relaxation Applied to Capacitated Facility Location Problems , 1978 .

[15]  Cauligi S. Raghavendra,et al.  A model for optimal resource allocation in distributed computing systems , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.

[16]  Xiaolin Du,et al.  Data allocation in a dynamically reconfigurable environment , 1988, Proceedings. Fourth International Conference on Data Engineering.