Article

Free access

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

Author:

Frank OlkenAuthors Info & Claims

SIGMETRICS '83: Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems

Pages 39 - 43

https://doi.org/10.1145/800040.801393

Published: 29 August 1983 Publication History

PDF eReader

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.

References

[1]

Barlow, Richard E. and Frank Proschan, Statistical Theory Reliablity and Life Testing, Holt, Rhinehart and Winston New York, 1975

Google Scholar

[2]

Jewell, Nicholas P., Mixtures of Exponential Distributions, Annals of Statistics vol. 10, no. 2, 1982, pp. 479-484

Crossref

Google Scholar

[3]

Olken, Frank, "Efficient Methods for Calculating the Success Function of Fixed Space Replacement Policies", LBL-12370, Lawrence Berkeley Lab Berkeley, May 1981

Google Scholar

[4]

Satyanarayanan, M., "A study of File Sizes and Functional Lifetimes" in Proceedings of the Eighth Symposium on Operating Systems Principles, Assoc. for Computing Machinery, December 1981, pp. 96 ff.

Digital Library

Google Scholar

[5]

Smith, A.J., "Analysis of Long Term File Reference Patterns for Application to File Migration Algorithms", IEEE Transactions on Software Engineering vol. SE-7, no. 4, July 1981, pp. 403-417

Digital Library

Google Scholar

[6]

Smith, A.J., "Long Term File Migration: Development and Evaluation of Algorithms", Communications of the ACM, vol. 24, no. 8, August 1981, pp. 521-532

Digital Library

Google Scholar

Cited By

View all

Otoo EShoshani A(2003)Accurate Modeling of Cache Replacement Policies in a Data GridProceedings of the 20 th IEEE/11 th NASA Goddard Conference on Mass Storage Systems and Technologies (MSS'03)10.5555/824467.824997Online publication date: 7-Apr-2003
https://dl.acm.org/doi/10.5555/824467.824997
Otoo EShoshani A(2003)Accurate modeling of cache replacement policies in a data grid20th IEEE/11th NASA Goddard Conference on Mass Storage Systems and Technologies, 2003. (MSST 2003). Proceedings.10.1109/MASS.2003.1194831(10-19)Online publication date: 2003
https://doi.org/10.1109/MASS.2003.1194831
Otoo EOlken FShoshani AGiles RReed DKelley K(2002)Disk cache replacement algorithm for storage resource managers in data gridsProceedings of the 2002 ACM/IEEE conference on Supercomputing10.5555/762761.762824(1-15)Online publication date: 16-Nov-2002
https://dl.acm.org/doi/10.5555/762761.762824
Show More Cited By

Index Terms

HOPT: A myopic version of the STOCHOPT automatic file migration policy
1. Software and its engineering
  1. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        File systems management
        Memory management
        Distributed memory
    2. Software system structures
      1. Distributed systems organizing principles

Recommendations

Higher reliability redundant disk arrays: Organization, operation, and coding

Parity is a popular form of data protection in redundant arrays of inexpensive/independent disks (RAID). RAID5 dedicates one out of N disks to parity to mask single disk failures, that is, the contents of a block on a failed disk can be reconstructed by ...
HPDA: A hybrid parity-based disk array for enhanced performance and reliability

Flash-based Solid State Drive (SSD) has been productively shipped and deployed in large scale storage systems. However, a single flash-based SSD cannot satisfy the capacity, performance and reliability requirements of the modern storage systems that ...
The Design and Implementation of a Log-structured File System

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SIGMETRICS '83: Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems

August 1983

286 pages

ISBN:0897911121

DOI:10.1145/800040

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 29 August 1983

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 459 of 2,691 submissions, 17%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
152
Total Downloads

Downloads (Last 12 months)27
Downloads (Last 6 weeks)3

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Otoo EShoshani A(2003)Accurate Modeling of Cache Replacement Policies in a Data GridProceedings of the 20 th IEEE/11 th NASA Goddard Conference on Mass Storage Systems and Technologies (MSS'03)10.5555/824467.824997Online publication date: 7-Apr-2003
https://dl.acm.org/doi/10.5555/824467.824997
Otoo EShoshani A(2003)Accurate modeling of cache replacement policies in a data grid20th IEEE/11th NASA Goddard Conference on Mass Storage Systems and Technologies, 2003. (MSST 2003). Proceedings.10.1109/MASS.2003.1194831(10-19)Online publication date: 2003
https://doi.org/10.1109/MASS.2003.1194831
Otoo EOlken FShoshani AGiles RReed DKelley K(2002)Disk cache replacement algorithm for storage resource managers in data gridsProceedings of the 2002 ACM/IEEE conference on Supercomputing10.5555/762761.762824(1-15)Online publication date: 16-Nov-2002
https://dl.acm.org/doi/10.5555/762761.762824
Otoo EOlken FShoshani A(2002)Disk Cache Replacement Algorithm for Storage Resource Managers in Data GridsACM/IEEE SC 2002 Conference (SC'02)10.1109/SC.2002.10043(12-12)Online publication date: 2002
https://doi.org/10.1109/SC.2002.10043

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Higher reliability redundant disk arrays: Organization, operation, and coding

HPDA: A hybrid parity-based disk array for enhanced performance and reliability

The Design and Implementation of a Log-structured File System