Accession Number : AD0772761

Title :   Optimal File Allocation,

Corporate Author : HARVARD UNIV CAMBRIDGE MASS

Personal Author(s) : Chen,Peter Pin-Shan

Report Date : AUG 1973

Pagination or Media Count : 151

Abstract : ROBLEMS IN MULTI-LEVEL STORAGE SYSTEMS. The storage levels are modeled as a set of parallel queuing servers. The requests for accessing file blocks are considered to be generated by a Poisson process. Three types of file allocation problems with different optimization criteria and constraints are studied. The first problem is to allocate files so as to minimize the mean system response time without considering the storage cost. The second is to allocate files in a way which minimizes the total storage cost and satisfies one mean system response time requirement. The last problem is to allocate files so as to minimize the total storage cost and satisfy an individual response time requirement for each file. Algorithms for the solution of these problems are derived. (Author)

Descriptors :   *CENTRAL PROCESSING UNITS, *MEMORY DEVICES, *ALLOCATIONS, *QUEUEING THEORY, PARALLEL PROCESSING, MATHEMATICAL PROGRAMMING, SCHEDULING, CONVEX SETS, THEOREMS, ALGORITHMS, OPTIMIZATION

Subject Categories : Operations Research
      Computer Hardware

Distribution Statement : APPROVED FOR PUBLIC RELEASE