Permutation clustering: an approach to on-line storage reorganization

  • Authors:
  • B. T. Bennett;P. A. Franaszek

  • Affiliations:
  • IBM Thomas J. Watson Research Center, Yorktown Heights, New York;IBM Thomas J. Watson Research Center, Yorktown Heights, New York

  • Venue:
  • IBM Journal of Research and Development
  • Year:
  • 1977

Quantified Score

Hi-index 0.00

Visualization

Abstract

A class of dynamic reorganization algorithms is described which embodies a number of desirable systems properties. Experiments on a trace taken from a large data base application indicate that a member of this class may be used to obtain time-varying or quasistatic organizations that exhibit improved paging performance.