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

dmtcs:367 - Discrete Mathematics & Theoretical Computer Science, January 1, 2006, Vol. 8 - https://doi.org/10.46298/dmtcs.367
New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks

Authors: Enrico Angelelli ORCID-iD; Maria Grazia Speranza ORCID-iD; Zsolt Tuza

    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.


    Volume: Vol. 8
    Published on: January 1, 2006
    Imported on: March 26, 2015
    Keywords: parallel processors,competitive analysis,semi on-line scheduling,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

    8 Documents citing this article

    Share

    Consultation statistics

    This page has been seen 425 times.
    This article's PDF has been downloaded 129 times.