On store placement for response time minimization in parallel disks

Proceedings - International Conference on Distributed Computing Systems

Volumn 2006, Issue , 2006, Pages

  Verma, Akshat ^a   Anand, Ashok ^a  

^a IBM INDIA RESEARCH LAB   (India)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STORAGE EQUIPMENT; DATABASE SYSTEMS; PARALLEL ALGORITHMS; PROBLEM SOLVING;

DATABASE TABLES; PLACEMENT PROBLEM; REAL STORAGE;

RESPONSE TIME (COMPUTER SYSTEMS);

EID: 33947643125     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2006.59     Document Type: Conference Paper

References (22)

1. Ming-Syan Chen, Hui-I Hsiao, Chung-Sheng Li, Philip S. Yu. Using Rotational Mirr ored Declustering for Replica Placement in a Disk-Array-Based Video Server. In Multimedia Syst. 5(6): 371-379, 1997.
2. X. Chen, P. Mohapatra, and H. Chen. An Admission Control Scheme for Predictable Server Response Time for Web Accesses. In ACM WWW Conference, 2001.
3. G. Copeland, W. Alexander, E. Bougher and T. Keller. Data placement in Bubba. In ACM SIGMOD, 1988.
4. W. Dowdy and D. Foster. Comparative models of the file assignment problem. In ACM Computing Surveys, 14(2), 1982.
5. E. Anderson, M. Hobbs, K. Keeton, and S. Spence (2002). Hippodrome: Running Circles Around Storage Administration. In USENIX Conference on File and Storage Technologies (FAST).
6. R. Garg, P.N. Shahabuddin, and A. Verma (2003). Optimal Assignment of Streams in Server Farms. In IBM Technical Report.
7. G. Ganger. The Disksim Simulation Environment, at http://www.pdl.cmu. edu/Disksim/.
8. D. Gross, and C. M. Harris. Fundamentals of Queueing Theorey. In 2nd Edn., J. Wiley and Sons, 1985.
9. M. Harchol-Balter, M. Crovella, and C.D. Murta. On Choosing a Task Assignment Policy for a Distributed Server System. In Journal of Parallel and Distributed Computing, 59(2), 204-228, 1999.
10. L. Huang, and T. Chiueh. Experiences in Building a Software-Based SATF Scheduler. In Technical Report, State University of New York at Stony Brook, 2002.
11. L.W. Lee, P. Scheuermann, and R. Vingralek (2000). File Assignment in Parallel I/O Systems with Minimal Variance of Service Time. In IEEE Transactions on Computers 49(2), 127-140.
12. Z. Liu, M.S. Squillante, and J.L. Wolf. On Maximizing Service-Level Agreement Profits. In Proc. ACM Conf. on Electronic Commerce, Orlando, FL, 2001.
13. L. Muscariello, M. Mellia, M. Meo, M.A., Marsan, and R.L. C igno. An MMPP-based Hierarchical Model of Internet Traffic. In IEEE ICC, 2004.
14. The PC Technology Guide. Storage-hard disks. http://www.pctechguide. com/04disks.htm
15. The PC Technology Guide. Components-processors. http://www. pctechguide.com/02procs.htm
16. A.N. Reddy, and J. Wyllie. Disk scheduling in multi-media I /O system. In ACM Multimedia, 1993.
17. P. Scheuermann, G. Weikum, and P. Zabback. Data partitioning and load balancing in parallel disk systems. In VLDB Journal, 1998.
18. M. Seltzer, P. Chen, and J. Ousterhout. Disk Scheduling Revisited. In Proc. of the USENIX Winter 1990 Technical Conference,313-324.
19. P. Shenoy, and H. M. Vin. Cello: A Disk Scheduling Framework for Next Generation Operating Systems, In Proc. of ACM SIGMETRICS 1998, 44-55.
20. Storage Trace Repository, at http://traces.cs.umass.edu/storage.
21. A. Verma and A. Anand. General Store Placement on Parallel Disks. Personal Communication.
22. G. Weikum, P. Zabback, and P. Scheuermann (1991). Dynamic File Allocation in Disk Arrays. In Proc. ACM SIGMOD, 406-415.