Provably Optimal Scheduling of Similar Tasks

  • Bast, H.
Publication date
January 2000
Publisher
Universität des Saarlandes

Abstract

We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when the processing times of the tasks are variable and not known in advance. The tasks are assigned to the processors in chunks consisting of several tasks at a time, and the difficulty lies in finding the optimal trade off between the processors' load balance, which is favoured by having small chunks, and the total scheduling overhead, which will be the lower the fewer chunks there are. Our studies are motivated by a practical problem from high-performance computing, namely parallel-loop scheduling, for which a large variety of heuristics have been proposed in the past, but hardly any rigorous analysis has been presented to...

Extracted data

Loading...

Related items

Provably Optimal Scheduling of Similar Tasks
  • Bast, Hannah
January 2000

We consider the problem of processing a given number of tasks on a given number of processors as qui...

Provably optimal scheduling of similar tasks
  • Bast, Hannah
January 2000

We consider the problem of processing a given number of tasks on a given number of processors as qui...

Beweisbares optimales Scheduling ähnlicher Prozesse
  • Bast, Hannah
September 2004

We consider the problem of processing a given number of tasks on a given number of processors as qui...

We use cookies to provide a better user experience.