Distributed file allocation with consistency constraints

R Tewari; N.R Adam

doi:10.1109/ICDCS.1992.235014

Back

Conference proceeding

Distributed file allocation with consistency constraints

R Tewari and N.R Adam

[1992] Proceedings of the 12th International Conference on Distributed Computing Systems, Vol.1992-, pp.408-415

1992

DOI: https://doi.org/10.1109/ICDCS.1992.235014

Abstract

Availability

Computer network reliability

Communication system control

Distributed control

Financial advantage program

Cost function

Computer networks

Resource management

Telecommunication network reliability

Distributed computing

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.< >

Metrics

7 Record Views

Details

Title: Distributed file allocation with consistency constraints
Creators: R Tewari - Temple Univ., Philadelphia, PA, USA
N.R Adam
Publication Details: [1992] Proceedings of the 12th International Conference on Distributed Computing Systems, Vol.1992-, pp.408-415
Date published: 1992
Publisher: IEEE Comput. Soc. Press
Academic Unit: Rutgers Newark; Management Science and Information Systems (RBS)
Language: English
Resource Type: Conference proceeding
Identifiers: 991031654512404646