ACM Home Page
Please provide us with feedback. Feedback
Restrained utilization of idleness for transparent scheduling of background tasks
Full text PdfPdf (612 KB)
Source
Joint International Conference on Measurement and Modeling of Computer Systems archive
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems table of contents
Seattle, WA, USA
SESSION: Memory and storage table of contents
Pages 205-216  
Year of Publication: 2009
ISBN:978-1-60558-511-6
Authors
Ningfang Mi  College of William and Mary, Williamsburg, VA, USA
Alma Riska  Seagate Research, Pittsburgh, PA, USA
Xin Li  University of Rochester, Rochester, NY, USA
Evgenia Smirni  College of William and Mary, Williamsburg, VA, USA
Erik Riedel  Seagate Research, Pittsburgh, PA, USA
Sponsors
ACM: Association for Computing Machinery
SIGMETRICS: ACM Special Interest Group on Measurement and Evaluation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 35,   Downloads (12 Months): 78,   Citation Count: 0
Additional Information:

abstract   references   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/1555349.1555373
What is a DOI?

ABSTRACT

A common practice in system design is to treat features intended to enhance performance and reliability as low priority tasks by scheduling them during idle periods, with the goal to keep these features transparent to the user. In this paper, we present an algorithmic framework that determines the schedulability of non-preemptable low priority tasks in storage systems. The framework estimates when and for how long idle times can be utilized by low priority background tasks, without violating pre-defined performance targets of user foreground tasks. The estimation is based on monitored system information that includes the histogram of idle times. This histogram captures accurately important statistical characteristics of the complex demands of the foreground activity. The robustness and the effectiveness of the proposed framework is corroborated via extensive trace driven simulations under a wide range of system conditions and background activities, and via experimentation on a Linux kernel 2.6.22 prototype.


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
13
 
14
15
 
16
 
17
 
18
 
19
 
20
 
21
H. Takagi. Queuing Analysis Volume 1: Vacations and Priority Systems. North-Holland, New York, 1991.
 
22
23

Collaborative Colleagues:
Ningfang Mi: colleagues
Alma Riska: colleagues
Xin Li: colleagues
Evgenia Smirni: colleagues
Erik Riedel: colleagues