Sciweavers

JSSPP
2009
Springer

Competitive Two-Level Adaptive Scheduling Using Resource Augmentation

14 years 7 months ago
Competitive Two-Level Adaptive Scheduling Using Resource Augmentation
Abstract. As multi-core processors proliferate, it has become more important than ever to ensure efficient execution of parallel jobs on multiprocessor systems. In this paper, we study the problem of scheduling parallel jobs with arbitrary release time on multiprocessors while minimizing the jobs’ mean response time. We focus on non-clairvoyant scheduling schemes that adaptively reallocate processors based on periodic feedbacks from the individual jobs. Since it is known that no deterministic non-clairvoyant algorithm is competitive for this problem, we focus on resource augmentation analysis, and show that two adaptive algorithms, Agdeq and Abgdeq, achieve competitive performance using O(1) times faster processors than the adversary. These results are obtained through a general framework for analyzing the mean response time of any twolevel adaptive scheduler. Our simulation results verify the effectiveness of Agdeq and Abgdeq by evaluating their performances over a wide range of wo...
Hongyang Sun, Yangjie Cao, Wen-Jing Hsu
Added 27 May 2010
Updated 27 May 2010
Type Conference
Year 2009
Where JSSPP
Authors Hongyang Sun, Yangjie Cao, Wen-Jing Hsu
Comments (0)