Non-clairvoyant scheduling for weighted flow time

https://doi.org/10.1016/S0020-0190(03)00231-XGet rights and content

Abstract

A non-clairvoyant scheduler makes decisions having no knowledge of jobs. It does not know when the jobs will arrive in the future, that is, it is online, and how long the jobs will be executed after they arrive. For non-clairvoyant scheduling, we first study the problem to minimize the total stretch. And we also consider the case in which the weights of jobs are known when they arrive, while their lengths are still unknown. In this case, we find a schedule to minimize the total weighted flow time. The weighted versions of well-known algorithms, Round Robin and Balance, are investigated.

References (12)

  • J. Edmonds

    Scheduling in the dark

    Theoret. Comput. Sci.

    (2000)
  • N. Bansal et al.

    Minimizing weighted response time

  • N. Bansal et al.

    Non-clairvoyant scheduling for mean slowdown

  • L. Becchetti et al.

    Scheduling to minimize average stretch without migration

  • C. Chekuri et al.

    Approximation schemes for preemptive weighted flow time

  • C. Chekuri et al.

    Algorithms for weighted flow time

There are more references available in the full text version of this article.
View full text