ACM Home Page
Please provide us with feedback. Feedback
Efficient network and I/O throttling for fine-grain cycle stealing
Full text PdfPdf (128 KB)
Source Conference on High Performance Networking and Computing archive
Proceedings of the 2001 ACM/IEEE conference on Supercomputing (CDROM) table of contents
Denver, Colorado
Pages: 3 - 3  
Year of Publication: 2001
ISBN:1-58113-293-X
Authors
Kyung D. Ryu  Arizona State University, Tempe AZ
Jeffrey K. Hollingsworth  University of Maryland, College Park, MD
Peter J. Keleher  University of Maryland, College Park, MD
Sponsors
ACM: Association for Computing Machinery
SIGARCH: ACM Special Interest Group on Computer Architecture
IEEE-CS\DATC : IEEE Computer Society
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 20,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

This paper proposes and evaluates a new mechanism, rate windows, for I/O and network rate policing. The goal of the proposed system is to provide a simple, yet effective way to enforce resource limits on target classes of jobs in a system. This work was motivated by our Linger Longer infrastructure, which harvests idle cycles in networks of workstations. Network and I/O throttling is crucial because Linger Longer can leave guest jobs on non-idle nodes and machine owners should not be adversely affected. Our approach is quite simple. We use a sliding window of recent events to compute the average rate for a target resource. The assigned limit is enforced by the simple expedient of putting application processes to sleep when they issue requests that would bring their resource utilization out of the allowable profile. Our I/O system call intercept model makes the rate windows mechanism light-weight and highly portable. Our experimental results show that we are able to limit resource usage to within a few percent of target usages.


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
J. Bruno, E. Gabber, B. Ozden, and A. Silberschatz, "The Eclipse operating system: Providing Quality of Service via Reservation Domains," USENIX 1998 Annual Technical Conference. June 1998, New Orleans, Louisiana.
6
7
 
8
 
9
R. P. Goldberg, "Survey of Virtual Machine Research," IEEE Computer Magazine,7(6), 1974, pp. 34-45.
10
 
11
P. Krueger and R. Chawla, "The Stealth Distributed Scheduler," International Conference on Distributed Computing Systems (ICDCS). May 1991, Arlington, TX, pp. 336-343.
 
12
M. Litzkow, M. Livny, and M. Mutka, "Condor --- A Hunter of Idle Workstations," International Conference on Distributed Computing Systems. June 1988, pp. 104-111.
 
13
 
14
V. N. Padmanabhan and R. H. Katz, "TCP Fast Start: A Techniques for Speeding Up Web Transfers," IEEE GLOBECOMM. Nov. 1998, Sydney, Australia, pp. 41-46.
 
15
D. Reed and R. Fairbairns, The Nemesis KernelOverview, http://citeseer.nj.nec.com/reed97nemesis.html, May 20, 1997.
 
16
17
 
18
SiliconGraphics, IRIX 6.4 Technical Brief, http://www.sgi.com/software/irix6.5/techbrief.pdf, 1998.
 
19
J. S. Turner, "New Directions in Communications (or Which Way to the Information Age?)," IEEE Communications Magazine,24(10), 1986, pp. 8-15.
20
21
 
22


Collaborative Colleagues:
Kyung D. Ryu: colleagues
Jeffrey K. Hollingsworth: colleagues
Peter J. Keleher: colleagues