The Isomorphism of Simple File Allocation

Author

Ramamoorthy, C.V. ; Wah, Benjamin W.

Author_Institution

Computer Science Division, Department of Electrical Engineering and Computer Sciences, and the Electronics Research Laboratory, University of California

Issue

3

fYear

1983

fDate

3/1/1983 12:00:00 AM

Firstpage

221

Lastpage

232

Abstract

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.

Keywords

Heuristic; isomorphism; simple file allocation; single commodity warehouse location; Availability; Computer networks; Computer science; Costs; Delay; Distributed computing; Distributed control; Financial advantage program; Large scale integration; Operations research; Heuristic; isomorphism; simple file allocation; single commodity warehouse location;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/TC.1983.1676214

Filename

1676214