Sequentiality and prefetching in database systems
ACM Transactions on Database Systems (TODS)
Optimal program and data locations in computer networks
Communications of the ACM
Generalized working sets for segment reference strings
Communications of the ACM
MIN—an optimal variable-space page replacement algorithm
Communications of the ACM
A cost oriented algorithm for data set allocation in storage hierarchies
Communications of the ACM
WYLBUR: an interactive text editing and remote job entry system
Communications of the ACM
The working set model for program behavior
Communications of the ACM
Operating Systems Theory
Bibliography on paging and related topics
ACM SIGOPS Operating Systems Review
Statistical methods in performance evaluation
Proceedings of the SIGOPS workshop on System performance evaluation
File migration.
Analysis of Long Term File Reference Patterns for Application to File Migration Algorithms
IEEE Transactions on Software Engineering
Characterization of branch and data dependencies on programs for evaluating pipeline performance
IEEE Transactions on Computers
Combining the concepts of compression and caching for a two-level filesystem
ASPLOS IV Proceedings of the fourth international conference on Architectural support for programming languages and operating systems
An empirical study of a wide-area distributed file system
ACM Transactions on Computer Systems (TOCS)
Measurement and analysis of locality phases in file referencing behaviour
SIGMETRICS '86/PERFORMANCE '86 Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation
Issues in the architecture of a document archiver using optical disk technology
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Towards an efficient management of objects in a distributed environment
DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
Comparative Models of the File Assignment Problem
ACM Computing Surveys (CSUR)
Query Processing in Tertiary Memory Databases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Vertical Data Migration in Large Near-Line Document Archives Based on Markov-Chain Predictions
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Cost-Effective Jukebox Storage via Hybrid File-Block Caching
NGIT '99 Proceedings of the 4th International Workshop on Next Generation Information Technologies and Systems
Integrated document caching and prefetching in storage hierarchies based on Markov-chain predictions
The VLDB Journal — The International Journal on Very Large Data Bases
HOPT: A myopic version of the STOCHOPT automatic file migration policy
SIGMETRICS '83 Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems
A study of file sizes and functional lifetimes
SOSP '81 Proceedings of the eighth ACM symposium on Operating systems principles
Database systems for efficient access to tertiary memory
MSS '95 Proceedings of the 14th IEEE Symposium on Mass Storage Systems
A virtual server queueing network method for component based performance modelling of metacomputing
Future Generation Computer Systems - Special issue: Semantic grid and knowledge grid: the next-generation web
The effective management of paging storage hierarchies
SIGMETRICS '82 Proceedings of the 1982 ACM SIGMETRICS conference on Measurement and modeling of computer systems
RAMA: easy access to a high-bandwidth massively parallel file system
TCON'95 Proceedings of the USENIX 1995 Technical Conference Proceedings
Cooperative caching: using remote client memory to improve file system performance
OSDI '94 Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation
Analysis of Workload Behavior in Scientific and Historical Long-Term Data Repositories
ACM Transactions on Storage (TOS)
A domain-dependent approach to determining file importance
Proceedings of the 2013 Grand Challenges on Modeling and Simulation Conference
| Hi-index | 48.22 |
The steady increase in the power and complexity of modern computer systems has encouraged the implementation of automatic file migration systems which move files dynamically between mass storage devices and disk in response to user reference patterns. Using information describing 13 months of user disk data set file references, we develop and evaluate (replacement) algorithms for the selection of files to be moved from disk to mass storage. Our approach is general and demonstrates a general methodology for this type of problem. We find that algorithms based on both the file size and the time since the file was last used work well. The best realizable algorithms tested condition on the empirical distribution of the times between file references. Acceptable results are also obtained by selecting for replacement that file whose size times time to most recent reference is maximal. Comparisons are made with a number of standard algorithms developed for paging, such as Working Set, VMIN, and GOPT. Sufficient information (parameter values, fitted equations) is provided so that our algorithms may be easily implemented on other systems.