loading...
Trace-Based Simulations of Processor Co-Allocation Policies in Multiclusters
Seattle, Washington June 22-June 24
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/HPDC.2003.121001712th IEEE International Symposium on ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A.I.D. Bucur, Delft University of Technology
D.H.J. Epema, Delft University of Technology
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
Usage of this product signifies your acceptance of the Terms of Use.