Abstract
This paper studies online job scheduling on multiprocessors and, in particular, investigates the algorithms SRPT and SJF for minimizing total stretch, where the stretch of a job is its flow time (response time) divided by its processing time. SRPT is perhaps the most well-studied algorithm for minimizing total flow time or stretch. This paper gives the first resource augmentation analysis of the total stretch of SRPT, showing that it is indeed O(1)-speed 1-competitive. This paper also gives a simple lower bound result that SRPT is not s-speed 1-competitive for any s < 1.5.
This paper also makes contribution to the analysis of SJF. Extending the work of [4], we are able to show that SJF is O(1)-speed 1-competitive for minimizing total stretch. More interestingly, we find that the competitiveness of SJF can be reduced arbitrarily by increasing the processor speed (precisely, SJF is O(s)-speed (1/s)-competitive for any s ≥ 1). We conjecture that SRPT also admits a similar result.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Avrahami, N., Azar, Y.: Minimizing total flow time and total completion time with immediate dispatching. In: SPAA, pp. 11–18 (2003)
Baker, K.R.: Introduction to Sequencing and Scheduling. Wiley, New York (1974)
Bansal, N., Pruhs, K.: Server scheduling in the Lp norm: a rising tide lifts all boat. In: STOC, pp. 242–250 (2003)
Becchetti, L., Leonardi, S., Marchetti-Spaccamela, A., Pruhs, K.: Online weighted flow time and deadline scheduling. In: RANDOM-APPROX, pp. 36–47 (2001)
Becchetti, L., Leonardi, S., Muthukrishnan, S.: Scheduling to minimize average stretch without migration. In: SODA, pp. 548–557 (2000)
Bender, M.A., Chakrabarti, S., Muthukrishnan, S.: Flow and stretch metrics for scheduling continuous job streams. In: SODA, pp. 270–279 (1998)
Bender, M.A., Muthukrishnan, S., Rajaraman, R.: Improved algorithms for stretch scheduling. In: SODA, pp. 762–771 (2002)
Brehob, M., Torng, E., Uthaisombut, P.: Applying extra-resource analysis to load balancing. J. Scheduling 3(5), 273–288 (2000)
Chan, H.L., Lam, T.W., To, K.K.: Non-migratory online deadline scheduling on multiprocessors. In: SODA, pp. 970–979 (2004)
Chan, W.T., Lam, T.W., Ting, H.F., Wong, P.W.H.: A unified analysis of hot video schedulers. In: STOC, pp. 179–188 (2002)
Chekuri, C., Goel, A., Khanna, S., Kumar, A.: Multi-processor scheduling to minimize flow time with _ resource augmentation. In: STOC, pp. 363–372 (2004)
Chekuri, C., Khanna, S., Zhu, A.: Algorithms for minimizing weighted flow time. In: STOC, pp. 84–93 (2001)
Chrobak, M., Epstein, L., Noga, J., Sgall, J., van Stee, R., Tichý, T., Vakhania, N.: Preemptive scheduling in overloaded systems. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 800–811. Springer, Heidelberg (2002)
Edmonds, J.: Scheduling in the dark. In: STOC, pp. 179–188 (1999)
Kalyanasundaram, B., Pruhs, K.: Maximizing job completions online. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, pp. 235–246. Springer, Heidelberg (1998)
Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. J. ACM 47(4), 617–643 (2000)
Leonardi, S., Raz, D.: Approximating total flow time on parallel machines. In: STOC, pp. 110–119 (1997)
McCullough, J., Torng, E.: SRPT optimally utilizes faster machines to minimize flow time. In: SODA, pp. 350–358 (2004)
Muthukrishnan, S., Rajaraman, R., Shaheen, A., Gehrke, J.: Online scheduling to minimize average stretch. In: FOCS, pp. 433–442 (1999)
Phillips, C.A., Stein, C., Torng, E., Wein, J.: Optimal time-critical scheduling via resource augmentation. In: STOC, pp. 140–149 (1997)
Pruhs, K., Sgall, J., Torng, E.: Online scheduling. In J. Leung, editor, Handbook of Scheduling: Algorithms. In: Models and Performance Analysis, p. 15–1–15–41. CRC Press, Boca Raton (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chan, WT., Lam, TW., Liu, KS., Wong, P.W.H. (2005). New Resource Augmentation Analysis of the Total Stretch of SRPT and SJF in Multiprocessor Scheduling. In: Jȩdrzejowicz, J., Szepietowski, A. (eds) Mathematical Foundations of Computer Science 2005. MFCS 2005. Lecture Notes in Computer Science, vol 3618. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549345_21
Download citation
DOI: https://doi.org/10.1007/11549345_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28702-5
Online ISBN: 978-3-540-31867-5
eBook Packages: Computer ScienceComputer Science (R0)