ACM Home Page
Please provide us with feedback. Feedback
Resource overbooking and application profiling in shared hosting platforms
Source Operating Systems Design and Implementation archive
Proceedings of the 5th symposium on Operating systems design and implementation

Due to copyright restrictions we are not able to make the PDFs for this conference available for downloading

table of contents
Boston, Massachusetts
SESSION: Cluster resource management table of contents
Pages: 239 - 254  
Year of Publication: 2002
ISSN:0163-5980
Authors
Bhuvan Urgaonkar  University of Massachusetts, Amherst, MA
Prashant Shenoy  University of Massachusetts, Amherst, MA
Timothy Roscoe  Intel Research at Berkeley, Berkeley, CA
Sponsor
SIGOPS: ACM Special Interest Group on Operating Systems
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 37
Additional Information:

abstract   references   cited by   collaborative colleagues  

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

ABSTRACT

In this paper, we present techniques for provisioning CPU and network resources in shared hosting platforms running potentially antagonistic third-party applications. The primary contribution of our work is to demonstrate the feasibility and benefits of overbooking resources in shared platforms, to maximize the platform yeld: the revenue generated by the available resources. We do this by first deriving an accurate estimate of application resource needs by profiling applications on dedicated nodes, and then using these profiles to guide the placement of application components onto shared nodes. By overbooking cluster resources in a controlled fashion, our platform can provide performance guarantees to applications even when overbooked, and combine these techniques with commonly used QoS resource allocation mechanisms to provide application isolation and performance guarantees at run-time. When compared to provisioning based on the worst-case, the efficiency (and consequently revenue) benefits from controlled overbooking of resources can be dramatic. Specifically, experiments on our Linux cluster implementation indicate that overbooking resources by as little as 1% can increase the utilization of the cluster by a factor of two, and a 5% overbooking yields a 300--500% improvement, while still providing useful resource guarantees to applications.


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
M. Aron, S. Iyer, and P. Druschel. A Resource Management Framework for Predictable Quality of Service in Web Servers. Submitted for publication
3
 
4
5
 
6
R. Boorstyn, A. Burchard, J. Liebeherr, and C. Oottamakorn. Statistical Service Assurances for Traffic Scheduling Algorithms. IEEE Journal on Selected Areas in Communications, 18(12):2651--2664, December 2000.
7
8
9
10
 
11
Global Grid Forum: Scheduling and Resource Management Working Group. http://www-unix.mcs.anl.gov/schopf/ggf-sched, 2002.
12
 
13
I. Leslie, D. McAuley, R. Black, T. Roscoe, P. Barham, D. Evers, R. Fairbairns, and E. Hyden. The Design and Implementation of an Operating System to Support Distributed Multimedia Applications. IEEE Journal on Selected Areas in Communication, 14(7):1280--1297, September 1996.
 
14
Linux Trace Toolkit Project Page. http://www.opersys.com/LTT/, 2002.
 
15
M. Litzkow, M. Livny, and M. Mutka. Condor - A Hunter of Idle Workstations. In Proceedings of the 8th International Conference of Distributed Computing Systems, pages 104--111, June 1988.
 
16
The pgbench man page, PostgreSQL software distribution, 2002.
17
18
 
19
B C. Smith, J F. Leimkuhler, and R M. Darrow. Yield Management at American Airlines. Interfaces, 22(1):8--31, January-February 1992.
 
20
The Standard Performance Evaluation Corporation (SPEC), http://www.spec.org. SPECWeb99 Benchmark Documentation.
21
 
22
P. Tang and T. Tai. Network Traffic Characterization Using Token Bucket Model. In Proceedings of IEEE Infocom'99, New York, NY, March 1999.
 
23
B. Urgaonkar and P. Shenoy. Sharc: Managing CPU and Network Bandwidth in Shared Clusters. Technical Report TR01-08, Department of Computer Science, University of Massachusetts, October 2001.
 
24
B. Urgaonkar, P. Shenoy, and T. Roscoe. Resource Overbooking and Application Profiling in Shared Hosting Platforms. Technical report TR02-21, Department of Computer Science, University of Massachusetts, May 2002.
25
 
26
C. A. Waldspurger and W. E. Weihl. Lottery Scheduling: Flexible Proportional-share Resource Management. In Proceedings of symposim on Operating System Design and Implementation, November 1994.
 
27

CITED BY  37
Collaborative Colleagues:
Bhuvan Urgaonkar: colleagues
Prashant Shenoy: colleagues
Timothy Roscoe: colleagues