Trace-Based Simulations of Processor Co-Allocation Policies in Multiclusters

	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 A.I.D. Bucur Articles by D.H.J. Epema

12th IEEE International Symposium on High Performance Distributed Computing (HPDC-12 '03)

Seattle, Washington

June 22-June 24

ISBN: 0-7695-1965-2

	ASCII Text	x
	A.I.D. Bucur, D.H.J. Epema, "Trace-Based Simulations of Processor Co-Allocation Policies in Multiclusters," High-Performance Distributed Computing, International Symposium on, pp. 70, 12th IEEE International Symposium on High Performance Distributed Computing (HPDC-12 '03), 2003.

	BibTex	x
	@article{ 10.1109/HPDC.2003.1210017, author = {A.I.D. Bucur and D.H.J. Epema}, title = {Trace-Based Simulations of Processor Co-Allocation Policies in Multiclusters}, journal ={High-Performance Distributed Computing, International Symposium on}, volume = {0}, year = {2003}, issn = {1082-8907}, pages = {70}, doi = {http://doi.ieeecomputersociety.org/10.1109/HPDC.2003.1210017}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - High-Performance Distributed Computing, International Symposium on TI - Trace-Based Simulations of Processor Co-Allocation Policies in Multiclusters SN - 1082-8907 SP EP A1 - A.I.D. Bucur, A1 - D.H.J. Epema, PY - 2003 KW - null VL - 0 JA - High-Performance Distributed Computing, International Symposium on ER -

A.I.D. Bucur, Delft University of Technology

D.H.J. Epema, Delft University of Technology

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/HPDC.2003.1210017

In systems consisting of multiple clusters of processors which employ space sharing for scheduling jobs, such as our Distributed ASCI1 Supercomputer (DAS), coallocation, i.e., the simultaneous allocation of processors to single jobs in multiple clusters, may be required. In this paper we study the performance of several scheduling policies for co-allocating unordered requests in multiclusters with a workload derived from the DAS. We .nd that beside the policy, limiting the total job size significantly improves the performance, and that for a slowdown of jobs due to global communication bounded by 1.25, co-allocation is a viable choice.

Citation:

A.I.D. Bucur, D.H.J. Epema, "Trace-Based Simulations of Processor Co-Allocation Policies in Multiclusters," hpdc, pp.70, 12th IEEE International Symposium on High Performance Distributed Computing (HPDC-12 '03), 2003

Peer Review Notice | Give Us Feedback

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