Evaluation techniques for storage hierarchies

  • Authors:
  • R. L. Mattson;J. Gecsei;D. R. Slutz;I. L. Traiger

  • Affiliations:
  • -;-;-;-

  • Venue:
  • IBM Systems Journal
  • Year:
  • 1970

Quantified Score

Hi-index 0.03

Visualization

Abstract

The design of efficient storage hierarchies generally involves the repeated running of "typical" program address traces through a simulated storage system while various hierarchy design parameters are adjusted. This paper describes a new and efficient method of determining, in one pass of an address trace, performance measures for a large class of demand-paged, multilevel storage systems utilizing a variety of mapping schemes and replacement algorithms. The technique depends on an algorithm classification, called "stack algorithms," examples of which are "least frequently used," "least recently used," "optimal," and "random replacement" algorithms. The techniques yield the exact access frequency to each storage device, which can be used to estimate the overall performance of actual storage hierarchies.