Article

Free access

Scheduling to minimize average stretch without migration

Authors:

Luca Becchetti,

Stefano Leonardi,

S. MuthukrishnanAuthors Info & Claims

SODA '00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms

Pages 548 - 557

Published: 01 February 2000 Publication History

PDF eReader

References

[1]

S. Acharya, S. Muthukrishnan and G. Sundaram. Scheduling data delivery over multiple channels. Bell Labs Technical Memo, 1999. Available from acharya~research, bell-labs, com.]]

Google Scholar

[2]

B. Awerbuch, Y. Azar, S. Leonardi, and O. Regev. Minimizing the Flow Time without Migration. In Proc. A CM Symposium on the Theory of Computing (STOC '99), 1999.]]

Digital Library

Google Scholar

[3]

K.R. Baker. Introduction to Sequencing and Scheduling. Wiley, 1974.]]

Google Scholar

[4]

L. Becchetti, S. Leonardi and S. Muthukrishnan. Scheduling to minimize Average Stretch without Migration. Dipartimento di informatica e sistemistica, Universith di Roma "La Sapienza", Technical Report 26-99, 1999.]]

Google Scholar

[5]

M. Bender, S. Chakrabarti, and S. Muthukrishnan. Flow and Stretch Metrics for Scheduling Continuous Job Streams. In Proc. of Annual Symposium on Discrete Algorithms (SODA '99), 1999.]]

Digital Library

Google Scholar

[6]

A. Borodin and Ran E1-Yaniv. Online computation and competitive analysis. Cambridge University Press, 1998.]]

Digital Library

Google Scholar

[7]

M. Crovella, M. Harchol-Balter, and C. Murta. Task Assignment in a Distributed System: Improving Performance by Unbalancing Load. Technical Report 97- 018, Boston University, 1997.]]

Digital Library

Google Scholar

[8]

M. Crovela, R. Frangioso, and M. Harchol-Balter. Connection Scheduling in Web Servers. Technical Report 99-003, Boston University, 1999.]]

Digital Library

Google Scholar

[9]

T.W. Doeppner. Threads, a System for the Support of Concurrent Programming. Technical Report CS-87-11, Brown University, 1987.]]

Google Scholar

[10]

J. Du, 3. Y. T. Leung, and G. H. Young. Minimizing mean flow time with release time constraint. Theoretical Computer Science, 75(3):347-355, 1990.]]

Digital Library

Google Scholar

[11]

J. E. Gehrke, S. Muthukrishnan, R. Rajaraman, and A. Shaheen. Scheduling to Minimize Average Stretch Online. To appear in Proc. Annual Symposium on Foundations of Computer Science, 1999.]]

Digital Library

Google Scholar

[12]

S. Hameed and N. Vaidya. Log-time algorithms for scheduling single and multiple channel data broadcast. Proc. Intl. Conf. on Mobile Computing and Networking (MOBICOM), 1997.]]

Digital Library

Google Scholar

[13]

G. Koren, A. Amir and E. Dar. The power of migration in multi-processor scheduling of real time systems. Proc. A CM Syrup, on Discrete Algorithms, 1998.]]

Digital Library

Google Scholar

[14]

L. Hall, D. Shmoys, and J. Wein. Scheduling to minimize average completion time: Off-line and on-line algorithms. In Proc. ol 7th A CM-SIAM Symposium on Discrete Algorithms, pages 142-151, 1996.]]

Digital Library

Google Scholar

[15]

L.A. Hall. Approximation algorithms for scheduling. In D.S. Hochbaum, editor, Approximation algorithms for NP-hard problems, pages 1-45. PWS publishing company, 1997.]]

Digital Library

Google Scholar

[16]

M. Harchol-Balter, M. CroveUa, and S. Park. The case SRPT Scheduling in Web Servers. Technical Report MIT-LCS-TR-767, Laboratory for Computer Science, Massachussets Institute of Technology, October 1998.]]

Google Scholar

[17]

M. Harchol-Balter, M. Grovella, and C. Murta. On Choosing a Task Assignment Policy for a Distributed Server System. Lecture Notes in Computer Science, Vol. 1469, 1998.]]

Digital Library

Google Scholar

[18]

Institute for Electrical and Electronic Engineers. POSIX Pl OOS.4a, Threads Extensions for Portable Operating Systems, 1994.]]

Google Scholar

[19]

R. Jain. The Art of Computer Systems Performance Analysis. John Wiley, New York, 1991.]]

Google Scholar

[20]

B. Kalyanasundaram, and K. Pruhs. Eliminating Migration in Multi-Processor Scheduling. In Proc. of A CM-SIAM Symposium on Discrete Algorithms (SODA '99), 1999.]]

Digital Library

Google Scholar

[21]

H. Kellerer, T. Tautenhahn and G.J. Woeginger. Approximabflity and nonapproximabflity results for minimizing total flow time on a single machine. Proe. of the P8th Annual A CM Symposium on the Theory o/ Computing, pp. 418-426, 1996.]]

Digital Library

Google Scholar

[22]

E.L. Lawler, J.K Lenstra, A.H.G.R. Kan, and D.B. Shmoys. Sequencing and scheduling: algorithms and complexity. In Handbooks in operations research and management science, volume 4, pages 445-522. North Holland, 1993.]]

Google Scholar

[23]

S. Leonardi and D. Raz. Approximating total flow time on parallel machines, in Proceedings of the Twenty-Ninth Annual A CM Symposium on Theory of Computin9, pages 110-119, El Paso, Texas, 1997.]]

Digital Library

Google Scholar

[24]

M. Mehta and D. J. De Witt. Dynamic memory allocation for multiple-query worloads. In Very large data bases, VLDB 1998: Proc. of the 19th International Conference on Very Large Data Bases, pp. 354- 367, S. Baker and D. Bell editors, Morgan Kaufmann Publishers, 1993.]]

Digital Library

Google Scholar

[25]

F. Mueller. A Library Implementation of POSIX Threads under UNIX. In Proc. of the Winter 1993 USENIX Technical Conference, pp. 29-41, Jan. 1993.]]

Google Scholar

[26]

Sun Microsystems. SunOS 5.3 System Services, Nov. 1993.]]

Google Scholar

[27]

D. Sleator and R.E. Tarjan. Amortized Efficiency of List Update and Paging Rules. Communications of ACM 28, 1985.]]

Digital Library

Google Scholar

[28]

H. Zhu, B. Smith and T. Yang. A schedufing framework for web server clusters with intensive dynamic content processing. Technical Report TRCS98-29. Univ. California, Santa Barbara, 1998.]]

Digital Library

Google Scholar

Cited By

View all

Beltrán MGuzmán A(2009)How to Balance the Load on Heterogeneous ClustersInternational Journal of High Performance Computing Applications10.1177/109434200810183423:1(99-118)Online publication date: 1-Feb-2009
https://dl.acm.org/doi/10.1177/1094342008101834
Bansal NDhamdhere K(2007)Minimizing weighted flow timeACM Transactions on Algorithms10.1145/1290672.12906763:4(39-es)Online publication date: 1-Nov-2007
https://dl.acm.org/doi/10.1145/1290672.1290676
Chan HLam TLiu K(2006)Extra unit-speed machines are almost as powerful as speedy machines for competitive flow time schedulingProceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm10.5555/1109557.1109595(334-343)Online publication date: 22-Jan-2006
https://dl.acm.org/doi/10.5555/1109557.1109595
Show More Cited By

Recommendations

Scheduling to Minimize Average Stretch
Online Scheduling to Minimize Average Stretch

We consider the classical problem of online job scheduling on uniprocessor and multiprocessor machines. For a given job, we measure the quality of service provided by an algorithm by the stretch of the job, which is defined as the ratio of the amount ...
Online Scheduling to Minimize Average Stretch
FOCS '99: Proceedings of the 40th Annual Symposium on Foundations of Computer Science

We consider the classical problem of online job scheduling on uniprocessor and multiprocessor machines. For a given job, we measure the quality of service provided by an algorithm by the stretch of the job, which is defined as the ratio of the amount of ...

Comments

Information & Contributors

Information

Published In

SODA '00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms

February 2000

965 pages

ISBN:0898714532

Chairman:
David Shmoys

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 February 2000

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 411 of 1,322 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
296
Total Downloads

Downloads (Last 12 months)36
Downloads (Last 6 weeks)3

Reflects downloads up to 25 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Beltrán MGuzmán A(2009)How to Balance the Load on Heterogeneous ClustersInternational Journal of High Performance Computing Applications10.1177/109434200810183423:1(99-118)Online publication date: 1-Feb-2009
https://dl.acm.org/doi/10.1177/1094342008101834
Bansal NDhamdhere K(2007)Minimizing weighted flow timeACM Transactions on Algorithms10.1145/1290672.12906763:4(39-es)Online publication date: 1-Nov-2007
https://dl.acm.org/doi/10.1145/1290672.1290676
Chan HLam TLiu K(2006)Extra unit-speed machines are almost as powerful as speedy machines for competitive flow time schedulingProceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm10.5555/1109557.1109595(334-343)Online publication date: 22-Jan-2006
https://dl.acm.org/doi/10.5555/1109557.1109595
Chan WLam TLiu KWong P(2006)New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor schedulingTheoretical Computer Science10.1016/j.tcs.2006.06.003359:1(430-439)Online publication date: 14-Aug-2006
https://dl.acm.org/doi/10.1016/j.tcs.2006.06.003
Palis M(2005)The Granularity Metric for Fine-Grain Real-Time SchedulingIEEE Transactions on Computers10.1109/TC.2005.20454:12(1572-1583)Online publication date: 1-Dec-2005
https://dl.acm.org/doi/10.1109/TC.2005.204
Leonardi SMarchetti-Spaccamela AMeyer auf der Heide FGibbons PAdler M(2004)Scheduling against an adversarial networkProceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures10.1145/1007912.1007936(151-159)Online publication date: 27-Jun-2004
https://dl.acm.org/doi/10.1145/1007912.1007936
Chekuri CGoel AKhanna SKumar ABabai L(2004)Multi-processor scheduling to minimize flow time with ε resource augmentationProceedings of the thirty-sixth annual ACM symposium on Theory of computing10.1145/1007352.1007411(363-372)Online publication date: 13-Jun-2004
https://dl.acm.org/doi/10.1145/1007352.1007411
Goel AHenzinger MPlotkin STardos E(2003)Scheduling data transfers in a network and the set scheduling problemJournal of Algorithms10.1016/S0196-6774(03)00054-348:2(314-332)Online publication date: 1-Sep-2003
https://dl.acm.org/doi/10.1016/S0196-6774%2803%2900054-3
Chekuri CKhanna SReif J(2002)Approximation schemes for preemptive weighted flow timeProceedings of the thiry-fourth annual ACM symposium on Theory of computing10.1145/509907.509954(297-305)Online publication date: 19-May-2002
https://dl.acm.org/doi/10.1145/509907.509954
Chekuri CKhanna SZhu AVitter JSpirakis PYannakakis M(2001)Algorithms for minimizing weighted flow timeProceedings of the thirty-third annual ACM symposium on Theory of computing10.1145/380752.380778(84-93)Online publication date: 6-Jul-2001
https://dl.acm.org/doi/10.1145/380752.380778

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations