Fundamentals of queueing theory (2nd ed.).
Fundamentals of queueing theory (2nd ed.).
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Dynamic file allocation in disk arrays
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Disk scheduling in a multimedia I/O system
MULTIMEDIA '93 Proceedings of the first ACM international conference on Multimedia
Cello: a disk scheduling framework for next generation operating systems
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
File Assignment in Parallel I/O Systems with Minimal Variance of Service Time
IEEE Transactions on Computers
On choosing a task assignment policy for a distributed server system
Journal of Parallel and Distributed Computing - Special issue on software support for distributed computing
Comparative Models of the File Assignment Problem
ACM Computing Surveys (CSUR)
An admission control scheme for predictable server response time for web accesses
Proceedings of the 10th international conference on World Wide Web
On maximizing service-level-agreement profits
Proceedings of the 3rd ACM conference on Electronic Commerce
Hippodrome: Running Circles Around Storage Administration
FAST '02 Proceedings of the Conference on File and Storage Technologies
Data partitioning and load balancing in parallel disk systems
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.01 |
We investigate the placement of N enterprise data-stores (e.g., database tables, application data) across an array of disks with the aim of minimizing the response time averaged over all served requests, while balancing the load evenly across all the disks in the parallel disk array. Incorporating the non-FCFS serving discipline and non-work-conserving nature of disk drives in formulation of the placement problem is difficult and current placement strategies do not take them into account. We present a novel formulation of the placement problem to incorporate these crucial features and identify the runlength of requests accessing a store as the most important criterion for placing the stores. We use these insights to design a fast (running time of NlogN) placement algorithm that is optimal under the assumption that transfer times are small. Further, we develop polynomial-time extensions of the algorithm that minimize response time even if transfer times are large, while balancing the loads across the disks. Comprehensive experimental studies establish the efficacy of the proposed algorithm under a wide variety of workloads with the proposed algorithm reducing the response time for real storage traces by more than a factor of 2 under heterogeneous workload scenarios.