IBM Journal of Research and Development
IBM Skip to main content
  Home     Products & services     Support & downloads     My account  

  Select a country  
Journals Home  
  Systems Journal  
Journal of Research
and Development
    Current Issue  
    Recent Issues  
    Papers in Progress  
    Search/Index  
    Orders  
    Description  
    Patents  
    Recent publications  
    Author's Guide  
  Staff  
  Contact Us  
  Related links:  
     IBM Research  

IBM Journal of Research and Development  
Volume 16, Number 6, Page 579 (1972)
Nontopical Issue
  Full article: arrowPDF   arrowCopyright info





   

Optimum Storage Allocation for Initial Loading of a File

by J. A. vanderPool
When a file is loaded into a direct access storage device using key-to-address transformations, the number and size of storage blocks can be selected. In this study, a selection that minimizes the combined cost of storage space and accesses to the storage device is determined for the case where no record additions or deletions occur after loading.

The analysis is based on the assumption that for a given set of keys, a transformation exists that gives a uniform probability distribution over the available addresses. Under this assumption, formulas are derived for the average number of overflow records and for the average number of accesses required to retrieve a record.

Given these formulas, the costs are expressed as a function of storage used, number of accesses, cost per unit of storage, and cost per access. Minima are computed for a range of block sizes and operational conditions. The results seem to indicate that current file design practices are abundant with storage space.

Finally, the results are condensed in an easy to use approximate formula.

Related Subjects: Magnetic recording; Mathematics (applied); Storage (computer) devices and systems