By Topic

A model for optimal database allocation in distributed computing systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ge-Ming Chiu ; Dept. of Electr. Eng.-Syst., Univ. of Southern California, Los Angeles, CA, USA ; Raghavendra, C.S.

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

Published in:

INFOCOM '90, Ninth Annual Joint Conference of the IEEE Computer and Communication Societies. The Multiple Facets of Integration. Proceedings, IEEE

Date of Conference:

3-7 Jun 1990