Non-clairvoyant scheduling for weighted flow time

Authors:
Jae-Hoon Kim;Kyung-Yong Chwa
Affiliations:
Department of Electrical Engineering & Computer Science, Korea Advanced Institute of Science and Technology, Taejon 305-701, Republic of Korea;Department of Electrical Engineering & Computer Science, Korea Advanced Institute of Science and Technology, Taejon 305-701, Republic of Korea
Venue:
Information Processing Letters
Year:
2003

Citing 10
Cited 1

Approximating total flow time on parallel machines

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Non-clairvoyant multiprocessor scheduling of jobs with changing execution characteristics (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Non-clairvoyant scheduling

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Scheduling to minimize average stretch without migration

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Speed is as powerful as clairvoyance

Journal of the ACM (JACM)
Scheduling in the dark

Theoretical Computer Science - Selected papers in honor of Manuel Blum
Algorithms for minimizing weighted flow time

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximation schemes for preemptive weighted flow time

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Non-clairvoyant Scheduling for Minimizing Mean Slowdown

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Online Scheduling to Minimize Average Stretch

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science

Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count

ESA '08 Proceedings of the 16th annual European symposium on Algorithms

Quantified Score

Hi-index	0.89

Visualization

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.