This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
March 1983 (vol. 32 no. 3)
pp. 221-232
C.V. Ramamoorthy, Computer Science Division, Department of Electrical Engineering and Computer Sciences, and the Electronics Research Laboratory, University of California
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.
Index Terms:
single commodity warehouse location, Heuristic, isomorphism, simple file allocation
Citation:
C.V. Ramamoorthy, B.W. Wah, "The Isomorphism of Simple File Allocation," IEEE Transactions on Computers, vol. 32, no. 3, pp. 221-232, March 1983, doi:10.1109/TC.1983.1676214
Usage of this product signifies your acceptance of the Terms of Use.