| Efficient management of idleness in storage systems |
| Full text |
Pdf
(736 KB)
|
Source
|
ACM Transactions on Storage (TOS)
archive
Volume 5 , Issue 2 (June 2009)
table of contents
Article No. 4
Year of Publication: 2009
ISSN:1553-3077
|
|
Authors
|
|
Ningfang Mi
|
College of William and Mary, Williamsburg, VA
|
|
Alma Riska
|
Seagate Research, Pittsburgh, PA
|
|
Qi Zhang
|
Microsoft, Redmond, WA
|
|
Evgenia Smirni
|
College of William and Mary, Williamsburg, VA
|
|
Erik Riedel
|
Seagate Research, Pittsburgh, PA
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 60, Downloads (12 Months): 235, Citation Count: 1
|
|
|
ABSTRACT
Various activities that intend to enhance performance, reliability, and availability of storage systems are scheduled with low priority and served during idle times. Under such conditions, idleness becomes a valuable “resource” that needs to be efficiently managed. A common approach in system design is to be nonwork conserving by “idle waiting”, that is, delay the scheduling of background jobs to avoid slowing down upcoming foreground tasks. In this article, we complement “idle waiting” with the “estimation” of background work to be served in every idle interval to effectively manage the trade-off between the performance of foreground and background tasks. As a result, the storage system is better utilized without compromising foreground performance. Our analysis shows that if idle times have low variability, then idle waiting is not necessary. Only if idle times are highly variable does idle waiting become necessary to minimize the impact of background activity on foreground performance. We further show that if there is burstiness in idle intervals, then it is possible to predict accurately the length of incoming idle intervals and use this information to serve more background jobs without affecting foreground performance.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
 |
2
|
|
 |
3
|
Lakshmi N. Bairavasundaram , Garth R. Goodson , Shankar Pasupathy , Jiri Schindler, An analysis of latent sector errors in disk drives, Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, June 12-16, 2007, San Diego, California, USA
|
| |
4
|
|
 |
5
|
|
| |
6
|
|
 |
7
|
|
| |
8
|
Richard Golding , Peter Bosch , Carl Staelin , Tim Sullivan , John Wilkes, Idleness is not sloth, Proceedings of the USENIX 1995 Technical Conference Proceedings on USENIX 1995 Technical Conference Proceedings, p.17-17, January 16-20, 1995, New Orleans, Louisiana
|
| |
9
|
|
 |
10
|
|
 |
11
|
Ilias Iliadis , Robert Haas , Xiao-Yu Hu , Evangelos Eleftheriou, Disk scrubbing versus intra-disk redundancy for high-reliability raid storage systems, Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, June 02-06, 2008, Annapolis, MD, USA
|
| |
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
|
|
| |
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
|
|
| |
17
|
|
| |
18
|
|
| |
19
|
|
| |
20
|
|
| |
21
|
Thomas J. E. Schwarz , Qin Xin , Ethan L. Miller , Darrell D. E. Long , Andy Hospodor , Spencer Ng, Disk Scrubbing in Large Archival Storage Systems, Proceedings of the The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, p.409-418, October 04-08, 2004
|
| |
22
|
|
| |
23
|
Takagi, H. 1991. Queuing Analysis Volume 1: Vacations and Priority Systems. North-Holland, New York.
|
 |
24
|
|
| |
25
|
Eno Thereska , Jiri Schindler , John Bucy , Brandon Salmon , Christopher R. Lumb , Gregory R. Ganger, Awarded Best Student Paper! -- A Framework for Building Unobtrusive Disk Maintenance Applications, Proceedings of the 3rd USENIX Conference on File and Storage Technologies, March 31-31, 2004, San Francisco, CA
|
| |
26
|
|
 |
27
|
|
| |
28
|
|
CITED BY
|
|
Ningfang Mi , Alma Riska , Xin Li , Evgenia Smirni , Erik Riedel, Restrained utilization of idleness for transparent scheduling of background tasks, Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems, June 15-19, 2009, Seattle, WA, USA
|
INDEX TERMS
Primary Classification:
C.
Computer Systems Organization
C.4
PERFORMANCE OF SYSTEMS
Subjects:
Design studies
Additional Classification:
C.
Computer Systems Organization
C.4
PERFORMANCE OF SYSTEMS
Subjects:
Reliability, availability, and serviceability
General Terms:
Algorithms,
Design,
Management,
Performance,
Reliability
Keywords:
Resource management,
background jobs,
continuous data histogram,
foreground jobs,
idle periods,
idleness,
low priority work,
performance guarrante,
storage systems
|