ACM Home Page
Please provide us with feedback. Feedback
Efficient management of idleness in storage systems
Full text PdfPdf (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
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 60,   Downloads (12 Months): 235,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1534912.1534913
What is a DOI?

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
 
4
5
 
6
7
 
8
 
9
10
11
 
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
 
22
 
23
Takagi, H. 1991. Queuing Analysis Volume 1: Vacations and Priority Systems. North-Holland, New York.
24
 
25
 
26
27
 
28


Collaborative Colleagues:
Ningfang Mi: colleagues
Alma Riska: colleagues
Qi Zhang: colleagues
Evgenia Smirni: colleagues
Erik Riedel: colleagues