Efficient management of idleness in storage systems

ACM Transactions on Storage

Volumn 5, Issue 2, 2009, Pages 1-25

  Mi, Ningfang ^a   Riska, Alma ^b   Zhang, Qi ^c   Smirni, Evgenia ^a   Riedel, Erik ^b  

^a William and Mary   (United States)

^b SEAGATE RESEARCH   (United States)

^c MICROSOFT   (United States)

Author keywords

Background jobs; Continuous data histogram; Foreground jobs; Idle periods; Idleness; Low priority work; Performance guarrante; Resource management; Storage systems

Indexed keywords

BACKGROUND JOBS; CONTINUOUS DATA HISTOGRAM; FOREGROUND JOBS; IDLE PERIODS; IDLENESS; LOW PRIORITY WORK; PERFORMANCE GUARRANTE; RESOURCE MANAGEMENT; STORAGE SYSTEMS;

NATURAL RESOURCES MANAGEMENT; RESOURCE ALLOCATION;

MOBILE TELECOMMUNICATION SYSTEMS;

EID: 67651024191     PISSN: 15533077     EISSN: 15533093     Source Type: Journal    
DOI: 10.1145/1534912.1534913     Document Type: Article

References (28)

1. Abd-El-Malek, M., Ganger, G. R., Goodson, G. R., Reiter, M. K., and Wylie, J. J. 2005. Lazy verification in fault-tolerant distributed storage systems. In Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems (SRDS).
2. Bachmat, E. and Schindler, J. 2002. Analysis of methods for scheduling low priority disk drive tasks. In Proceedings of the ACM Conference on Measurements and Modeling of Computer Systems (SIGMETRICS). ACM Press. 55--65.
3. Bairavasundaram, L. N., Goodson, G. R., Pasupathy, S., and Schindler, J. 2007. An analysis of latent sector errors in disk drives. In Proceedings of the ACM SIGMETRICS Conference. 289--300.
4. Colarelli, D. and Grunwald, D. 2002. Massive arrays of idle disks for storage archives. In Proceeding of the SuperComputing Conferences. 1--11.
5. Douceur, J. R. and Bolosky, W. J. 1999. Progress-Based regulation of low-importance processes. In Proceedings of 17th ACM Symposium on Operating Systems Principles (SOSP'99). ACM Press. 247--260.
6. Douglis, F., Krishnan, P., and Bershad, B. N. 1995. Adaptive disk spin-down policies for mobile computers. In Proceedings of the 2nd USENIX Symposium on Mobile and Location-Independent Computing. 121--137.
7. Eggert, L. and Touch, J. D. 2005. Idletime scheduling with preemption intervals. In Proceedings of the 20th ACM Symposium on Operating Systems Principles (SOSP'05). ACM Press. 249--262.
8. Golding, R., Bosch, P., Staelin, C., Sullivan, T., and Wilkes, J. 1995. Idleness is not sloth. In Proceedings of the Winter'95 USENIX Conference. 201--222.
9. Helmbold, D. P., Long, D. D. E., Sconyers, T. L., and Sherrod, B. 2000. Adaptive disk spin-down for mobile computers. Mobile Netw. Appl 5, 4, 285--297.
10. Huang, H., Hung, W., and Shin, K. G. 2005. Fs2: Dynamic data replication in free disk space for improving disk performance and energy consumption. In Proceedings of the 20th ACM Symposium on Operating Systems Principles (SOSP'05). ACM Press. 263--276.
11. Iliadis, I., Haas, R., Hu, X.-Y., and Eleftheriou, E. 2008. Disk scrubbing versus intra-disk redundancy for high-reliability raid storage systems. In Proceedings of the ACM SIGMETRICS Conference 241--252.
12. Litzkow, M. J., Livny, M., and Mutka, M. W. 1988. Condor - A hunter of idle workstations. In Proceedings of the IEEE International Conference on Distributed Computing Systems (ICDCS). 104--111.
13. Lo, V. M., Zappala, D., Zhou, D., Liu, Y., and Zhao, S. 2004. Cluster computing on the fly: P2P scheduling of idle cycles in the Internet. In Proceedings of the International Workshop on Peer-to-Peer Systems (IPTPS). 227--236.
14. Merchant, A. and Yu, P. S. 1994. An analytic model of reconstruction time in mirrored disks. Perform. Eval. J. 20, 1-3, 115--129.
15. Mi, N., Riska, A., Smirni, E., and Riedel, E. 2008. Enhancing data availability in disk drives through background activities. In Proceedings of the Symposium on the Dependability of Systems and Networks (DSN). 492--501.
16. Muntz, R. R. and Lui, J. C. S. 1990. Performance analysis of disk arrays under failures. In International Conference on Very Large Databases (VLDB). 162--173.
17. Niu, Z., Shu, T., and Takahashi, Y. 2003. A vacation queue with setup and close-down times and batch markovian arrival processes. Perform. Eval. 54, 3, 225--248.
18. Osogami, T., Harchol-Balter, M., and Scheller-Wolf, A. 2005. Analysis of cycle stealing with switching times and thresholds. Perform. Eval. J. 61, 4, 347--369.
19. Riska, A. and Riedel, E. 2006. Disk drive level workload characterization. InProceedings of the USENIX Annual Technical Conference. 97--103.
20. Riska, A. and Riedel, E. 2008. Idle read after write - IRAW. In Proceedings of the USENIX Annual Technical Conference. 43--56.
21. Schwarz, T. J. E., Xin, Q., Miller, E. L., Long, D. D. E., Hospodor, A., and Ng, S. 2004. Disk scrubbing in large archival storage systems. In Proceedings of the International Symposium on Modeling and Simulation of Computer and Communications Systems (MASCOTS). IEEE Press.
22. Sivathanu, M., Prabhakaran, V., Arpaci-Dusseau, A. C., and Arpaci-Dusseau, R. H. 2004. Improving storage system availability with D-GRAID. In Proceedings of the 3rd USENIX Symposium on File and Storage Technologies (FAST'04).
23. Takagi, H. 1991. Queuing Analysis Volume 1: Vacations and Priority Systems. North-Holland, New York.
24. Theimer, M. M., Lantz, K. A., and Cheriton, D. R. 1985. Preemptable remote execution facilities for the v-system. In Proceedings of the ACM Symposium on Operating Systems Principles (SOSP). 2--12.
25. Thereska, E., Schindler, J., Bucy, J., Salmon, B., Lumb, C. R., and Ganger, G. R. 2004. A framework for building unobtrusive disk maintenance applications. In Proceedings of the 3rd USENIX Conference on File and Storage Technologies (FAST).
26. Thomasian, A. and Nicola, V. F. 1993. Performance evaluation of a threshold policy for scheduling readers and writers. IEEE Trans. Comput. 42, 1, 83--98.
27. Venkataramani, A., Kokku, R., and Dahlin, M. 2002. TCP nice: A mechanism for background transfers. In Proceedings of the 5th Symposium on Operating Systems Design and Implementation (OSDI). 329--343.
28. Xu, E. and Alfa, A. S. 2002. A vacation model for the non-saturated readers and writers system with a threshold policy. Perform. Eval. 50, 4, 233--244.