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 the File Allocation Problem (FAP) from a new perspective. The main objective in this paper 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. Any of 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. It is this aspect that has been ignored in past research on the FAP. In this research a linear mixed-integer programming model has been formulated for the FAP. The model incorporates the “WRITE LOCKS ALL-READ LOCKS ONE” mechanism for concurrency control. A special algorithm based on the implicit representation of Variable Upper Bounds has been developed to solve the model. Detailed analysis for various configurations of a network has been carried out. Several potential applications have been identified for the model.
|Number of pages
|IEEE Transactions on Knowledge and Data Engineering
|Published - Sep 1991
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Computational Theory and Mathematics