Skip to main content
SpringerLink
Log in
Book cover

Efficient Algorithms pp 187–198Cite as

Minimizing Average Flow-Time

  • Chapter

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5760))

Abstract

This article looks at the problem of scheduling jobs on multiple machines both in the online and offline settings. It attempts to identify the key ideas in recent work on this problem for different machine models.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Avrahami, N., Azar, Y.: Minimizing total flow time and total completion time with immediate dispatching. In: SPAA, pp. 11–18. ACM, New York (2003)

    Google Scholar 

  2. Awerbuch, B., Azar, Y., Leonardi, S., Regev, O.: Minimizing the flow time without migration. In: STOC, pp. 198–205 (1999)

    Google Scholar 

  3. Bansal, N., Chan, H.-L.: Weighted flow time does not admit o(1)-competitive algorithms. In: SODA, pp. 1238–1244 (2009)

    Google Scholar 

  4. Bansal, N., Chan, H.-L., Pruhs, K.: Speed scaling with an arbitrary power function. In: SODA 2009: Proceedings of the Nineteenth Annual ACM -SIAM Symposium on Discrete Algorithms, Philadelphia, PA, USA, pp. 693–701. Society for Industrial and Applied Mathematics (2009)

    Google Scholar 

  5. Bansal, N., Dhamdhere, K.: Minimizing weighted flow time. ACM Transactions on Algorithms 3(4) (2007)

    Google Scholar 

  6. Chadha, J., Garg, N., Kumar, A., Muralidhara, V.N.: A competitive algorithm for minimizing weighted flow time on unrelated machines with speed augmentation. In: STOC (2009)

    Google Scholar 

  7. Chekuri, C., Khanna, S.: Approximation schemes for preemptive weighted flow time. In: STOC, pp. 297–305 (2002)

    Google Scholar 

  8. Chekuri, C., Khanna, S., Zhu, A.: Algorithms for minimizing weighted flow time. In: STOC, pp. 84–93 (2001)

    Google Scholar 

  9. Dinitz, Y., Garg, N., Goemans, M.: On the single-source unsplittable flow problem. In: FOCS 1998: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, Washington, DC, USA, p. 290. IEEE Computer Society, Los Alamitos (1998)

    Google Scholar 

  10. Garg, N., Kumar, A.: Better algorithms for minimizing average flow-time on related machines. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 181–190. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  11. Garg, N., Kumar, A.: Minimizing average flow time on related machines. In: STOC, pp. 730–738 (2006)

    Google Scholar 

  12. Garg, N., Kumar, A.: Minimizing average flow-time: Upper and lower bounds. In: FOCS, pp. 603–613 (2007)

    Google Scholar 

  13. Garg, N., Kumar, A., Muralidhara, V.N.: Minimizing total flow-time: The unrelated case. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 424–435. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  14. Leonardi, S., Raz, D.: Approximating total flow time on parallel machines. In: STOC, pp. 110–119 (1997)

    Google Scholar 

  15. Motwani, R., Phillips, S., Torng, E.: Non-clairvoyant scheduling. Theoretical Computer Science 130(1), 17–47 (1994)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Indian Institute of Technology Delhi, India

    Naveen Garg

Authors
  1. Naveen Garg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität Freiburg, Georges-Köhler-Allee 79, 79110, Freiburg, Germany

    Susanne Albers

  2. Institut für Informatik, Freie Universität Berlin, Takustr. 9, 14195, Berlin, Germany

    Helmut Alt

  3. Fachbereich IV - Informatik, Universität Trier, 54286, Trier, Germany

    Stefan Näher

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Garg, N. (2009). Minimizing Average Flow-Time. In: Albers, S., Alt, H., Näher, S. (eds) Efficient Algorithms. Lecture Notes in Computer Science, vol 5760. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03456-5_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03456-5_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03455-8

  • Online ISBN: 978-3-642-03456-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation