Abstract
We consider the classical problem of scheduling jobs in a multiprocessor setting in order to minimize the flow time (total time in the system). The performance of the algorithm, both in offline and online settings, can be significantly improved if we allow preemption: i.e., interrupt a job and later continue its execution. Preemption is inherent to make a scheduling algorithm efficient [7,8]. Minimizing the total flow time on parallel machines with preemption is known to be NP-hard on m ≥ 2 machines. Leonardi and Raz [8] showed that the well known heuristic shortest remaining processing time (SRPT) performs within a logarithmic factor of the optimal offline algorithm on parallel machines. It is not known if better approximation factors can be reached and thus SRPT, although it is an online algorithm, becomes the best known algorithm in the off-line setting. In fact, in the on-line setting, Leonardi and Raz showed that no algorithm can achieve a better bound.
In this work we present a nicer and simpler proof of the approximation ratio of SRPT. The proof presented in this paper combines techniques from the original paper of Leonardi and Raz [8] with those presented in a later paper on approximating total flow time when job preemption but not job migration is allowed [2] and on approximating total flow time non-clairvoyantly [3], that is when the processing time of a job is only known at time of completion.
Partially supported by the IST Programme of the EU under contract number IST-1999-14186 (ALCOM-FT), IST-2001-32007 (APPOL2), and by the MURST Projects “Algorithms for Large Data Sets: Science and Engineering” and “Resource Allocation in Computer Networks”.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Afrati, F.N., Bampis, E., Chekuri, C., Karger, D.R., Kenyon, C., Khanna, S., Milis, I., Queyranne, M., Skutella, M., Stein, C., Sviridenko, M.: Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS 1999), pp. 32–44 (1999)
Awerbuch, B., Azar, Y., Leonardi, S., Regev, O.: Minimizing the flow time without migration. In: Proc. of the 31st annual ACM Symposim on Theory of Computing, pp. 198–205 (1999)
Becchetti, L., Leonardi, S.: Non-Clairvoyant scheduling to minimize the average flow time on single and parallel machines. In: Proc. of the 33rd annual ACM Symposim on Theory of Computing, pp. 94–103 (2001)
Baker, K.R.: Introduction to Sequencing and Scheduling. Wiley, Chichester (1974)
Du, J., Leung, J.Y.T., Young, G.H.: Minimizing mean flow time with release time constraint. Theoretical Computer Science 75(3), 347–355 (1990)
Hall, L., Schulz, A.S., Shmoys, D., Wein, J.: Scheduling to minimize average completion time: off-line and on-line approximation algorithms. Mathematics of Operations Research 22, 513–544 (1997)
Kellerer, H., Tautenhahn, T., Woeginger, G.J.: Approximability and nonapproximability results for minimizing total flow time on a single machine. SIAM Journal on Computing 28(4), 1155–1166 (1999)
Leonardi, S., Raz, D.: Approximating total flow time on parallel machines. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, El Paso, Texas, pp. 110–119 (1997); To appear in Journal of Computer and System Sciences – special issue for STOC 1997 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Leonardi, S. (2006). A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines. In: Bampis, E., Jansen, K., Kenyon, C. (eds) Efficient Approximation and Online Algorithms. Lecture Notes in Computer Science, vol 3484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11671541_7
Download citation
DOI: https://doi.org/10.1007/11671541_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32212-2
Online ISBN: 978-3-540-32213-9
eBook Packages: Computer ScienceComputer Science (R0)