Abstract
In this paper, we focus on on-line scheduling of multiprocessor jobs with emphasis on the regulation of idle periods in the frame of general list policies. We consider a new family of scheduling strategies based on two phases which successively combine sequential and parallel executions of the jobs. These strategies are part of a more generic scheme introduced in [6]. The main result is to demonstrate that it is possible to estimate the amount of resources that should remain idle for a better regulation of the load and to obtain approximation bounds.
Cite
CITATION STYLE
Tchernykh, A., & Trystram, D. (2004). Online scheduling of multiprocessor jobs with idle regulation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3019, pp. 131–144). Springer Verlag. https://doi.org/10.1007/978-3-540-24669-5_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
