Idle regulation in non-clairvoyant scheduling of parallel jobs

  • Authors:

  • Andrei Tchernykh;Denis Trystram;Carlos Brizuela;Isaac Scherson

  • Affiliations:

  • Computer Sciences Department, CICESE Research Center, Ensenada 22860, BC, Mexico;ID- IMAG, 38330 Montbonnot St. Martin, France;Computer Sciences Department, CICESE Research Center, Ensenada 22860, BC, Mexico;Department of Computer Science, School of Information and Computer Sciences, University of California, Irvine, CA 92697, USA

  • Venue:
  • Discrete Applied Mathematics
  • Year:
  • 2009

Quantified Score

Hi-index 0.04

Visualization

Abstract

The optimization of parallel applications is difficult to achieve by classical optimization techniques because of their diversity and the variety of actual parallel and distributed platforms and/or environments. Adaptive algorithmic schemes, capable of dynamically changing the allocation of jobs during the execution to optimize global system behavior, are the best alternatives for solving this problem. In this paper, we focus on non-clairvoyant scheduling of parallel jobs with known resource requirements but unknown running times, with emphasis on the regulation of idle periods in the context of general list policies. We consider a new family of scheduling strategies based on two phases which successively combine sequential and parallel execution of jobs. We generalize known worst-case performance bounds by considering two extra parameters, in addition to the number of processors and maximum processor requirements considered in the literature, namely, job parallelization penalty and idle regulation factor. Furthermore, we prove that under certain conditions of idle regulation, the performance guarantee of parallel job scheduling in space-sharing mode can be improved.