On the definition of "on-line" in job scheduling problems

Authors:
Dror G. Feitelson;Ahuva W. Mu'alem
Affiliations:
The Hebrew University of Jerusalem, Jerusalem, Israel;The Hebrew University of Jerusalem, Jerusalem, Israel
Venue:
ACM SIGACT News
Year:
2005

Citing 8
Cited 2

Approximating total flow time on parallel machines

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximation techniques for average completion time scheduling

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Adversarial queuing theory

Journal of the ACM (JACM)
The Derivation and Experimental Verification of Clock Synchronization Theory

IEEE Transactions on Computers
The ANL/IBM SP Scheduling System

IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Theory and Practice in Parallel Job Scheduling

IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
On-line Scheduling

Developments from a June 1996 seminar on Online algorithms: the state of the art
Theory, Volume 1, Queueing Systems

Theory, Volume 1, Queueing Systems

Pitfalls in parallel job scheduling evaluation

JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing
Job scheduling using successive linear programming approximations of a sparse model

Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The conventional model of on-line scheduling postulates that jobs have non-trivial release dates, and are not known in advance. However, it fails to impose any stability constraints, leading to algorithms and analyses that must deal with unrealistic load conditions arising from trivial release dates as a special case. In an effort to make the model more realistic, we show how stability can be expressed as a simple constraint on release times and processing times. We then give empirical and theoretical justifications that such a constraint can close the gap between the theory and practice. As it turns out, this constraint seems to trivialize the scheduling problem.