New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2006

New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks

Abstract

In this paper we study a semi on-line version of the classical multiprocessor scheduling problem on two identical processors. We assume that the sum of the tasks and an upper bound gamma on the size of each task are known. Each task has to be assigned upon arrival and the assignment cannot be changed later. The objective is the minimization of the maximum completion time on the processors. In this paper we propose new algorithms and improve known lower and upper bounds on the competitive ratio. Algorithms and bounds depend on the value of gamma. An optimal algorithm is obtained for gamma in the interval [ 1/n,2(n+1)/n(2n+1) ] and gamma = (2n-1)/2n(n-1), where n is any integer value larger or equal 2.
Fichier principal
Vignette du fichier
dm080101.pdf (405.52 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00961099 , version 1 (19-03-2014)

Identifiers

Cite

Enrico Angelelli, Maria Grazia Speranza, Zsolt Tuza. New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks. Discrete Mathematics and Theoretical Computer Science, 2006, Vol. 8, pp.1-16. ⟨10.46298/dmtcs.367⟩. ⟨hal-00961099⟩

Collections

TDS-MACS
69 View
740 Download

Altmetric

Share

Gmail Facebook X LinkedIn More