Quantitative system performance: computer system analysis using queueing network models
Quantitative system performance: computer system analysis using queueing network models
Comparative Models of the File Assignment Problem
ACM Computing Surveys (CSUR)
Computer Performance Modeling Handbook
Computer Performance Modeling Handbook
Parameter interdependencies of file placement models in a Unix system
SIGMETRICS '84 Proceedings of the 1984 ACM SIGMETRICS conference on Measurement and modeling of computer systems
A calculus of variations approach to file allocation problems in computer systems
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Improving Disk Cache Hit-Ratios Through Cache Partitioning
IEEE Transactions on Computers
Computer Benchmark Evaluation and Design of Experiments: A Case Study
IEEE Transactions on Computers
A quantitative analysis of cache policies for scalable network file systems
SIGMETRICS '94 Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems
DASD dancing: a disk load balancing optimization scheme for video-on-demand computer systems
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Serverless network file systems
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
Serverless network file systems
ACM Transactions on Computer Systems (TOCS) - Special issue on operating system principles
Prefetching in segmented disk cache for multi-disk systems
Proceedings of the fourth workshop on I/O in parallel and distributed systems: part of the federated computing research conference
Disk load balancing for video-on-demand systems
Multimedia Systems
File Assignment in Parallel I/O Systems with Minimal Variance of Service Time
IEEE Transactions on Computers
Workfile Disk Management for Concurrent Mergesorts in a Multiprocessor Database System
Distributed and Parallel Databases
On algorithms for efficient data migration
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
On balancing the load in a clustered web farm
ACM Transactions on Internet Technology (TOIT)
Minerva: An automated resource provisioning tool for large-scale storage systems
ACM Transactions on Computer Systems (TOCS)
Analytic Modeling and Comparisons of Striping Strategies for Replicated Disk Arrays
IEEE Transactions on Computers
Replication Algorithms in a Remote Caching Architecture
IEEE Transactions on Parallel and Distributed Systems
Performance and Scalability of Client-Server Database Architectures
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
An Experimental Study of Data Migration Algorithms
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
Data partitioning and load balancing in parallel disk systems
The VLDB Journal — The International Journal on Very Large Data Bases
Data placement in shared-nothing parallel database systems
The VLDB Journal — The International Journal on Very Large Data Bases
Improving storage system availability with D-GRAID
ACM Transactions on Storage (TOS)
Hippodrome: Running Circles Around Storage Administration
FAST '02 Proceedings of the 1st USENIX Conference on File and Storage Technologies
Awarded Best Student Paper! -- Improving Storage System Availability with D-GRAID
FAST '04 Proceedings of the 3rd USENIX Conference on File and Storage Technologies
Quickly finding near-optimal storage designs
ACM Transactions on Computer Systems (TOCS)
Storage optimization for large-scale distributed stream-processing systems
ACM Transactions on Storage (TOS)
Using utility to provision storage systems
FAST'08 Proceedings of the 6th USENIX Conference on File and Storage Technologies
Evolution of storage management: transforming raw data into information
IBM Journal of Research and Development
Automated planners for storage provisioning and disaster recovery
IBM Journal of Research and Development
Higher reliability redundant disk arrays: Organization, operation, and coding
ACM Transactions on Storage (TOS)
Hippodrome: running circles around storage administration
FAST'02 Proceedings of the 1st USENIX conference on File and storage technologies
Improving storage system availability with D-GRAID
FAST'04 Proceedings of the 3rd USENIX conference on File and storage technologies
| Hi-index | 0.01 |
In this paper we describe a practical mathematical formulation and solution of the so-called “File Assignment Problem” (FAP) for computer disks. Our FAP solution has been implemented in a PL/I program known as the Placement Optimization Program (POP). The algorithm consists of three major components — two heuristic optimization models and a queueing network model. POP has been used in validation studies to assign files to disks in two IBM MVS complexes. The resulting savings in I/O response times were 22% and 25%, respectively. Throughout the paper we shall emphasize the real-world nature of our approach to the disk FAP, which we believe sets it apart from previous attempts.