An Efficient Resource Allocation Scheme for Gang Scheduling

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by B.B. Zhou Articles by P. Mackerras Articles by C.W. Johnson Articles by D. Walsh Articles by P. Brent

1st IEEE Computer Society International Workshop on Cluster Computing

Melbourne, Australia

December 02-December 03

ISBN: 0-7695-0343-8

	ASCII Text	x
	B.B. Zhou, P. Mackerras, C.W. Johnson, D. Walsh, P. Brent, "An Efficient Resource Allocation Scheme for Gang Scheduling," Cluster Computing, International Workshop on, pp. 187, 1st IEEE Computer Society International Workshop on Cluster Computing, 1999.

	BibTex	x
	@article{ 10.1109/IWCC.1999.810824, author = {B.B. Zhou and P. Mackerras and C.W. Johnson and D. Walsh and P. Brent}, title = {An Efficient Resource Allocation Scheme for Gang Scheduling}, journal ={Cluster Computing, International Workshop on}, volume = {0}, year = {1999}, issn = {1530-1885}, pages = {187}, doi = {http://doi.ieeecomputersociety.org/10.1109/IWCC.1999.810824}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Cluster Computing, International Workshop on TI - An Efficient Resource Allocation Scheme for Gang Scheduling SN - 1530-1885 SP EP A1 - B.B. Zhou, A1 - P. Mackerras, A1 - C.W. Johnson, A1 - D. Walsh, A1 - P. Brent, PY - 1999 KW - gang scheduling KW - fragmentation KW - job re-packing and buddy allocation scheme VL - 0 JA - Cluster Computing, International Workshop on ER -

B.B. Zhou, Australian National University

P. Mackerras, Australian National University

C.W. Johnson, Australian National University

D. Walsh, Australian National University

P. Brent, Oxford University

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IWCC.1999.810824

Gang scheduling is currently the most popular scheduling scheme for parallel processing in a time shared environment. One major drawback of using gang scheduling is the problem of fragmentation. The conventional method to alleviate this problem is to allow jobs running in multiple time slots. However, our experimental results show that simply applying this method alone cannot solve the problem of fragmentation, but on the contrary it may eventually degrade the efficiency of system resource utilization.In this paper we introduce an efficient resource allocation scheme which effectively incorporates the ideas of re-packing jobs, running jobs in multiple slots and minimizing time slots into the buddy allocation system to significantly improve the system and job performance. Because there is no process migration involved in job re-packing, this scheme is particularly suitable for clustered parallel computing systems.

Index Terms:

gang scheduling, fragmentation, job re-packing and buddy allocation scheme

Citation:

B.B. Zhou, P. Mackerras, C.W. Johnson, D. Walsh, P. Brent, "An Efficient Resource Allocation Scheme for Gang Scheduling," iwcc, pp.187, 1st IEEE Computer Society International Workshop on Cluster Computing, 1999

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.