The Isomorphism of Simple File Allocation

In this paper, we show that the simple file allocation problem in computer science is isomorphic to the single commodity warehouse location problem in operations research. In simple file allocation, costs due to query and update accesses and storage are considered. Design requirements such as reliability, availability, and delay are not taken into account. Due to this isomorphism, many techniques which have been developed for the warehouse location problem can be applied to solve the simple file allocation problem. Furthermore, there are techniques and conditions developed for one problem which match closely with techniques and conditions developed for the other problem. Based on a combined set of conditions developed in computer science and operations research, a heuristic for file allocation is presented.

[1]  G. Nemhauser,et al.  Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms , 1977 .

[2]  A. M. Geoffrion,et al.  Integer Programming Algorithms: A Framework and State-of-the-Art Survey , 1972 .

[3]  Elwood S. Buffa,et al.  A Heuristic Algorithm and Simulation Approach to Relative Location of Facilities , 1963 .

[4]  B. M. Khumawala.  An Efficient Branch and Bound Algorithm for the Warehouse Location Problem , 1972 .

[5]  B. M. Khumawala,et al.  An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem , 1977 .

[6]  Donald Erlenkotter,et al.  A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..

[7]  R. Marcogliese,et al.  Module and Data Allocation Methods in Distributed Systems , 1981, ICDCS.

[8]  Katriel Dan Levin.  Organizing distributed data bases in computer networks. , 1974 .

[9]  Harold S. Stone,et al.  Multiprocessor Scheduling with the Aid of Network Flow Algorithms , 1977, IEEE Transactions on Software Engineering.

[10]  R. Snyder.  A Note on the Location of Depots , 1971 .

[11]  K. Dan Levin,et al.  Optimal program and data locations in computer networks , 1977, CACM.

[12]  E. Lawler.  The Quadratic Assignment Problem , 1963 .

[13]  T. L. Ray,et al.  Warehouse Location Under Continuous Economies of Scale , 1966 .

[14]  Erol Gelenbe,et al.  Optimization of the Number of Copies in a Distributed Data Base , 1981, IEEE Trans. Software Eng..

[15]  Keki B. Irani,et al.  A Methodology for the Design of Communication Networks and the Distribution of Data in Distributed Supercomputer Systems , 1982, IEEE Transactions on Computers.

[16]  P. Gilmore.  Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem , 1962 .

[17]  Lawrence W. Dowdy,et al.  File Assignment in a Star Network , 1977, Int. CMG Conference.

[18]  K. Mani Chandy,et al.  Computational Complexity of Network Design Algorithms , 1977, IFIP Congress.

[19]  George O. Wesolowsky,et al.  Dynamic Facility Location , 1973 .

[20]  Gilles Muratet,et al.  Optimal Location of Plants , 1976 .

[21]  Donald Erlenkotter.  Note—Dynamic Facility Location and Simple Network Models , 1974 .

[22]  B. Srinivasan,et al.  Algorithms to Distribute a Database for Parallel Searching , 1981, IEEE Transactions on Software Engineering.

[23]  Kurt Spielberg,et al.  Algorithms for the Simple Plant-Location Problem with Some Side Conditions , 1969, Oper. Res..

[24]  Leonidas J. Guibas,et al.  Optimal Placement of Identical Resources in a Distributed Network , 1981, ICDCS.

[25]  T. L. Ray,et al.  A Branch-Bound Algorithm for Plant Location , 1966, Oper. Res..

[26]  George L. Nemhauser,et al.  Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms" , 1979 .

[27]  R. G. Casey.  Allocation of copies of a file in an information network , 1899 .

[28]  Geneva G. Belford,et al.  Some theorems to aid in solving the file allocation problem , 1977, CACM.

[29]  D. Sweeney,et al.  An Improved Long-Run Model for Multiple Warehouse Location , 1976 .

[30]  Sakti P. Ghosh.  Distributing a Data Base with Logical Associations on a Computer Network for Parallel Searching , 1976, IEEE Transactions on Software Engineering.

[31]  T. Koopmans,et al.  Assignment Problems and the Location of Economic Activities , 1957 .

[32]  A. Manne.  Plant Location Under Economies-of-Scale---Decentralization and Computation , 1964 .

[33]  F. Hillier,et al.  Quadratic Assignment Problem Algorithms and the Location of Indivisible Facilities , 1966 .

[34]  Graciano Sá,et al.  Branch-and-Bound and Approximate Solutions to the Capacitated Plant-Location Problem , 1969, Oper. Res..

[35]  John G. Kollias,et al.  Criteria to Aid in Solving the Problem of Allocating Copies of a File in a Computer Network , 1981, Comput. J..

[36]  Alan Jay Smith,et al.  Optimization of I/O systems by cache disks and file migration: A summary , 1981, Perform. Evaluation.

[37]  J. Spruce Riordon,et al.  Optimal allocation of resources in distributed information networks , 1976, TODS.

[38]  Mary Elizabeth Loomis.  Data base design: object distribution and resource-constrained task scheduling. , 1975 .

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

[40]  Richard J. Giglio.  Note--A Note on the Deterministic Capacity Problem , 1973 .

[41]  W. Baumol,et al.  A Warehouse-Location Problem , 1958 .

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

[43]  Ram C. Rao,et al.  Multilocation Plant Sizing and Timing , 1977 .

[44]  Alfred A. Kuehn,et al.  A Heuristic Program for Locating Warehouses , 1963 .

[45]  Peter P. Chen,et al.  Optimal Design of Distributed Information Systems , 1980, IEEE Transactions on Computers.

[46]  Andrew Whinston,et al.  An Algorithm for the Quadratic Assignment Problem , 1970 .