Analysis of Round-Robin Implementations of Processor Sharing, Including Overhead

Analysis of Round-Robin Implementations of Processor Sharing, Including Overhead

Cached

Download Links

by Steve Thompson , Lester Lipsky , Sarah Tasneem , Feng Zhang

Versions

Version 0

Version History

Metadata Version 0

Datum	Value	Source
TITLE	Analysis of Round-Robin Implementations of Processor Sharing, Including Overhead	SVM HeaderParse 0.2
AUTHOR NAME	Steve Thompson	SVM HeaderParse 0.2
AUTHOR AFFIL	Computer Science & Engineering; University of Connecticut	SVM HeaderParse 0.2
AUTHOR ADDR	Storrs, CT 06269	SVM HeaderParse 0.2
AUTHOR NAME	Lester Lipsky	SVM HeaderParse 0.2
AUTHOR AFFIL	Computer Science & Engineering; University of Connecticut	SVM HeaderParse 0.2
AUTHOR ADDR	Storrs, CT 06269	SVM HeaderParse 0.2
AUTHOR NAME	Sarah Tasneem	SVM HeaderParse 0.2
AUTHOR AFFIL	Math and Computer Science; Eastern Connecticut State University	SVM HeaderParse 0.2
AUTHOR ADDR	Willimantic, CT 06226	SVM HeaderParse 0.2
AUTHOR NAME	Feng Zhang	SVM HeaderParse 0.2
AUTHOR AFFIL	Computer Science & Engineering; University of Connecticut	SVM HeaderParse 0.2
AUTHOR ADDR	Storrs, CT 06269	SVM HeaderParse 0.2
ABSTRACT	Abstract—It has been observed in recent years that in many applications service time demands are highly variable. Without foreknowledge of exact service times of individual jobs, processor sharing is an effective theoretical strategy for handling such demands. In practice, however, processor sharing must be implemented by time-slicing with a round-robin discipline. In this paper, we investigate how round-robin performs with the consideration of job switching overhead. Because of recent results, we assume that the best strategy is for new jobs to preempt the one in service. By analyzing time-slicing with overhead, we derive the effective utilization parameter, and give a good approximation regarding the lower bound of time-slice under a given system load and overhead. The simulation results show that for both exponential and non-exponential distributions, the system blowup points agree with what the effective utilization parameter tells us. Furthermore, with the consideration of overhead, an optimum time-slice value exists for a particular environment. I.	SVM HeaderParse 0.2
CITATIONS	13 found	ParsCit 1.0