Heterogeneous CPU Services Using Differentiated Admission Control

Get BibTex-formatted data

Download

PDF

Author

D Yau, B Bhargava

Tech report number

CERIAS TR 2002-56

Entry type

article

Abstract

We present an adaptive controlled scheduler for heterogeneous applications running on general purpose computers. Our scheduler can effectively support diverse application requirements. It employs uniform rate-based sharing. Application heterogeneity is satisfied by partitioning CPU capacity into service classes, each with a different criterion for admission control. As a result, we are able to provide at once guaranteed performance, flexible allocation of rates with excellent scalability and intermediate service classes offering tradeoffs between reserved rate utilization and the strength of guarantees. Our scheduler has been implemented in Solaris 2.5.1. It runs existing applications without modifications. We present experimental results showing the scalability, efficiency, guaranteed performance, and overload performance aspects of our scheduler. We demonstrate the importance of priority inheritance implemented in our scheduler for stable system performance.

Download

PDF

Date

2002 – 07

URL

http://www.cs.purdue.edu/homes/bb/mmta2001.ps

Journal

Journal of Multimedia Tools and Applications

Key alpha

Bhargava

Note

Special Issue on QoS in Multimedia Networks

Pages

213-232

Volume

Publication Date

2002-07-01

BibTex-formatted data

To refer to this entry, you may select and copy the text below and paste it into your BibTex document. Note that the text may not contain all macros that BibTex supports.

@Article{ Bhargava,
	title = "Heterogeneous CPU Services Using Differentiated Admission Control",
	author = "D Yau, B Bhargava",
	year = "2002",
	month = "07",
	journal = "Journal of Multimedia Tools and Applications",
	note = "Special Issue on QoS in Multimedia Networks",
	pages = "213-232",
	volume = "17",
	abstract = "We present an adaptive controlled scheduler for heterogeneous applications running on general purpose computers. Our scheduler can effectively support diverse application requirements. It employs uniform rate-based sharing. 
Application heterogeneity is satisfied by partitioning CPU capacity into service classes, each with a different criterion for admission control. As a result, we are able to provide at once guaranteed performance, flexible allocation of rates with excellent scalability and intermediate service classes offering tradeoffs between reserved rate utilization and the 
strength of guarantees. Our scheduler has been implemented in Solaris 2.5.1. It runs existing applications without 
modifications. We present experimental results showing the scalability, efficiency, guaranteed performance, and overload performance aspects of our scheduler. We demonstrate the importance of priority inheritance implemented in our scheduler for stable system performance. ",
	url = "http://www.cs.purdue.edu/homes/bb/mmta2001.ps",
}