FILE ALLOCATION PROBLEM: AN EXPANDED PERSPECTIVE.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

In designing distributed database systems an important issue is where to store the various copies of each database. This issue is known as the File Allocation Problem (FAP). This research addresses FAP from a new perspective. The main objective is to examine the impact of incorporating a specific concurrency control mechanism (CCM) into the FAP. CCM is an integral part of distributed database systems. Several mechanisms can be used for concurrency control. Depending on the specific CCM used, the communication flows in a network will vary. In order to allocate data optimally, one must identify the exact communication flows in the network. This aspect has been ignored in past research on the FAP. In this research a nonlinear integer programming model has been formulated for the FAP. The model incorporates the central node locking mechanism for concurrency control. The model has been solved using an algorithm called ZOOM/XMP. An analysis for various configurations of a network has been carried out. Assumed values have been used for the various non-decision parameters that need to be fed into the model. Several practical implications have been identified that give insight into the FAP.

Original languageEnglish (US)
Title of host publicationProceedings of the Hawaii International Conference on System Science
Pages394-405
Number of pages12
Volume3
StatePublished - 1987

Fingerprint

Concurrency control
Distributed database systems
Communication
Integer programming

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Ram, S. (1987). FILE ALLOCATION PROBLEM: AN EXPANDED PERSPECTIVE. In Proceedings of the Hawaii International Conference on System Science (Vol. 3, pp. 394-405)

FILE ALLOCATION PROBLEM : AN EXPANDED PERSPECTIVE. / Ram, Sudha.

Proceedings of the Hawaii International Conference on System Science. Vol. 3 1987. p. 394-405.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ram, S 1987, FILE ALLOCATION PROBLEM: AN EXPANDED PERSPECTIVE. in Proceedings of the Hawaii International Conference on System Science. vol. 3, pp. 394-405.
Ram S. FILE ALLOCATION PROBLEM: AN EXPANDED PERSPECTIVE. In Proceedings of the Hawaii International Conference on System Science. Vol. 3. 1987. p. 394-405
Ram, Sudha. / FILE ALLOCATION PROBLEM : AN EXPANDED PERSPECTIVE. Proceedings of the Hawaii International Conference on System Science. Vol. 3 1987. pp. 394-405
@inproceedings{2656e45c7c894555911add21ae0f8a6e,
title = "FILE ALLOCATION PROBLEM: AN EXPANDED PERSPECTIVE.",
abstract = "In designing distributed database systems an important issue is where to store the various copies of each database. This issue is known as the File Allocation Problem (FAP). This research addresses FAP from a new perspective. The main objective is to examine the impact of incorporating a specific concurrency control mechanism (CCM) into the FAP. CCM is an integral part of distributed database systems. Several mechanisms can be used for concurrency control. Depending on the specific CCM used, the communication flows in a network will vary. In order to allocate data optimally, one must identify the exact communication flows in the network. This aspect has been ignored in past research on the FAP. In this research a nonlinear integer programming model has been formulated for the FAP. The model incorporates the central node locking mechanism for concurrency control. The model has been solved using an algorithm called ZOOM/XMP. An analysis for various configurations of a network has been carried out. Assumed values have been used for the various non-decision parameters that need to be fed into the model. Several practical implications have been identified that give insight into the FAP.",
author = "Sudha Ram",
year = "1987",
language = "English (US)",
volume = "3",
pages = "394--405",
booktitle = "Proceedings of the Hawaii International Conference on System Science",

}

TY - GEN

T1 - FILE ALLOCATION PROBLEM

T2 - AN EXPANDED PERSPECTIVE.

AU - Ram, Sudha

PY - 1987

Y1 - 1987

N2 - In designing distributed database systems an important issue is where to store the various copies of each database. This issue is known as the File Allocation Problem (FAP). This research addresses FAP from a new perspective. The main objective is to examine the impact of incorporating a specific concurrency control mechanism (CCM) into the FAP. CCM is an integral part of distributed database systems. Several mechanisms can be used for concurrency control. Depending on the specific CCM used, the communication flows in a network will vary. In order to allocate data optimally, one must identify the exact communication flows in the network. This aspect has been ignored in past research on the FAP. In this research a nonlinear integer programming model has been formulated for the FAP. The model incorporates the central node locking mechanism for concurrency control. The model has been solved using an algorithm called ZOOM/XMP. An analysis for various configurations of a network has been carried out. Assumed values have been used for the various non-decision parameters that need to be fed into the model. Several practical implications have been identified that give insight into the FAP.

AB - In designing distributed database systems an important issue is where to store the various copies of each database. This issue is known as the File Allocation Problem (FAP). This research addresses FAP from a new perspective. The main objective is to examine the impact of incorporating a specific concurrency control mechanism (CCM) into the FAP. CCM is an integral part of distributed database systems. Several mechanisms can be used for concurrency control. Depending on the specific CCM used, the communication flows in a network will vary. In order to allocate data optimally, one must identify the exact communication flows in the network. This aspect has been ignored in past research on the FAP. In this research a nonlinear integer programming model has been formulated for the FAP. The model incorporates the central node locking mechanism for concurrency control. The model has been solved using an algorithm called ZOOM/XMP. An analysis for various configurations of a network has been carried out. Assumed values have been used for the various non-decision parameters that need to be fed into the model. Several practical implications have been identified that give insight into the FAP.

UR - http://www.scopus.com/inward/record.url?scp=0023214168&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0023214168&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0023214168

VL - 3

SP - 394

EP - 405

BT - Proceedings of the Hawaii International Conference on System Science

ER -