HOPT: A myopic version of the STOCHOPT automatic file migration policy

Authors:
Frank Olken
Affiliations:
Computer Science and Mathematics Dept., Lawrence Berkeley Laboratory, University of California, Berkeley, California
Venue:
SIGMETRICS '83 Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Year:
1983

Citing 2
Cited 2

Long term file migration: development and evaluation of algorithms

Communications of the ACM
A study of file sizes and functional lifetimes

SOSP '81 Proceedings of the eighth ACM symposium on Operating systems principles

Disk cache replacement algorithm for storage resource managers in data grids

Proceedings of the 2002 ACM/IEEE conference on Supercomputing
Accurate Modeling of Cache Replacement Policies in a Data Grid

MSS '03 Proceedings of the 20 th IEEE/11 th NASA Goddard Conference on Mass Storage Systems and Technologies (MSS'03)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The STOCHOPT automatic file migration policy (proposed by A.J. Smith) minimizes the expected retention and recall costs of an abitrarily sized file. We consider the application of the STOCHOPT policy to a file system in which the file inter-reference time (IRT) distributions are characterized by strictly monotonically decreasing hazard rates (SDHR) (also known as decreasing failure rates, DFR). We show that in this case the STOCHOPT policy can be simply stated in terms of a scaled hazard rate, i.e., the hazard rate divided by the file size. Such decreasing failure rate distributions have been used by Smith to model empirically observed file inter-reference times.