The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks

  • Authors:

  • E. Angelelli;Á B. Nagy;M. G. Speranza;Zs. Tuza

  • Affiliations:

  • Department of Quantitative Methods, University of Brescia, C.da S. Chiara 50, I-25122 Brescia, Italy. angele@eco.unibs.it.;Department of Computer Science, University of Veszprém, Hungary. Research supported in part by the Hungarian Scientific Research Fund, grant OTKA T029309;Department of Quantitative Methods, University of Brescia, C.da S. Chiara 50, I-25122 Brescia, Italy. speranza@eco.unibs.it;Comp. and Autom. Inst., Hungarian Academy of Sciences, Budapest, Hungary and Department of Computer Science, University of Veszprém, Hungary. Research supported in part by the Hungarian Scien ...

  • Venue:
  • Journal of Scheduling
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we investigate a semi on-line multiprocessor scheduling problem. The problem is the classical on-line multiprocessor problem where the total sum of the tasks is known in advance. We show an asymptotic lower bound on the performance ratio of any algorithm (as the number of processors gets large), and present an algorithm which has performance ratio at most ({\sqrt 6} + 1)/2