Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines.

Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines.

Scheduling a sequence of jobs released over time when the processing time of a job is only known at its completion is a classical problem in CPU scheduling in time sharing operating systems. A widely used measure for the responsiveness of the system is the average flow time of the jobs, that is, the...

全面介紹

書目詳細資料
發表在:Journal of the ACM 51, 4 (2004).
主要作者: Becchetti, Luca
格式: Article
語言:English
主題:
Computer systems organization.
Performance of systems.
Performance attributes.
Theory of computation.
Analysis of algorithms and problem complexity.
Nonnumerical algorithms and problems.
Sequencing and scheduling.
Mathematics of computing.
Probability and statistics.
Algorithms.
Performance.
Theory.