Issue No. 11 - November (2006 vol. 17)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2006.160
Angela C. Sodan , IEEE
<p><b>Abstract</b>—Job scheduling typically focuses on the CPU with little work existing to include I/O or memory. Time-shared execution provides the chance to hide I/O and long-communication latencies though potentially creating a memory conflict. Hyperthreaded CPUs support coscheduling without any context switches and provide additional options for CPU-internal resource sharing. We present an approach that includes all possible resources into the schedule optimization and improves utilization by coscheduling two jobs if feasible. Our LOMARC approach partially reorders the queue by lookahead to increase the potential to find good matches. In simulations based on the workload model of Lublin and Feitelson [CHECK END OF SENTENCE], we have obtained improvements between 30 percent and 50 percent in both response times and relative bounded response times on hyperthreaded CPUs (i.e., cut times to two third or to half).</p>
Distributed architecture, multiprocessing, scheduling, threads, performance measures.
L. Lan and A. C. Sodan, "LOMARC: Lookahead Matchmaking for Multiresource Coscheduling on Hyperthreaded CPUs," in IEEE Transactions on Parallel & Distributed Systems, vol. 17, no. , pp. 1360-1375, 2006.