Skip to main content
SpringerLink
Log in

On-Line Scheduling of Parallel Jobs

  • Conference paper
Structural Information and Communication Complexity (SIROCCO 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3104))

Abstract

We study an on-line parallel job scheduling problem, where jobs arrive over list. A parallel job may require a number of machines for its processing at the same time. Upon arrival of a job, its processing time and the number of requested machines become known, and it must be scheduled immediately without any knowledge of future jobs. We present a 8-competitive on-line algorithm, which improves the previous upper bound of 12 by Johannes [8]. Furthermore, we investigate two special cases in which jobs arrive in non-increasing order of processing times or jobs arrive in non-increasing order of sizes. Better bounds are shown.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bischof, S., Mayr, E.W.: On-line scheduling of parallel jobs with runtime restrictions. Theoretical Computer Science 268, 67–90 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  2. Drozdowski, M.: Scheduling multiprocessor tasks – an overview. European Journal on Operations Research 94, 215–230 (1996)

    Article  MATH  Google Scholar 

  3. Du, J., Leung, J.: Complexity of Scheduling Parallel Task System. SIAM Journal on Discrete Mathematics 2, 473–487 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  4. Feldmann, A., Kao, M.-Y., Sgall, J., Teng, S.-H.: Optimal online scheduling of parallel jobs with dependencies. Journal of Combinatorial Optimization 1, 393–411 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  5. Feldmann, A., Sgall, J., Teng, S.-H.: Dynamic scheduling on parallel machines. Theoretical Computer Science 130, 49–72 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  6. Fleischer, R., Wahl, M.: Online scheduling revisited. In: Proceedings of the 8th Annual European Symposium on Algorithms (ESA), pp. 202–210 (2000)

    Google Scholar 

  7. Gormley, T., Reingold, N., Torng, E., Westbrook, J.: Generating adversaries for request-answer games. In: Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 564–565 (2000)

    Google Scholar 

  8. Johannes, B.: Scheduling parallel jobs to minimize makespan, Technical Report 723- 2001, TU Berlin, http://www.math.tu-berlin.de/coga/publications/techreports/

  9. Johnson, D.S., Demers, A., Ullman, J.D., Garey, M.R., Graham, R.L.: Worst-case performance bounds for simple one-dimensional packing algorithm. SIAM Journal on Computing 3, 299–325 (1974)

    Article  MathSciNet  Google Scholar 

  10. Ludwig, W., Tiwari, P.: Scheduling malleable and nonmalleable parallel tasks. In: Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 167–176 (1994)

    Google Scholar 

  11. Naroska, E., Schwiegelshohn, U.: On an on-line scheduling problem for parallel jobs. Information Processing Letters 81, 297–304 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  12. Simchi-Levi, D.: New worst-case results for the bin packing problem. Naval Research Logistics 41, 79–585 (1994)

    Article  Google Scholar 

  13. Zhang, G.: Absolute worst-case analysis for on-line bin packing (2002) (manuscript)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Zhejiang University, Hangzhou, 310027, China

    Deshi Ye

  2. Institut für Informatik und Praktische Mathematik, Universität Kiel, Olshausenstr. 40, 24098, Kiel, Germany

    Deshi Ye

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

    Guochuan Zhang

Authors
  1. Deshi Ye
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guochuan Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Faculty of Mathematics, Physics and Informatics, Comenius University, Research partially funded by grant APVV, 0433-06, Bratislava, Slovakia

    Ratislav Královic̆

  2. Department of Computer Science, University of Loughborough, Loughborough, UK

    Ondrej Sýkora

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ye, D., Zhang, G. (2004). On-Line Scheduling of Parallel Jobs. In: Královic̆, R., Sýkora, O. (eds) Structural Information and Communication Complexity. SIROCCO 2004. Lecture Notes in Computer Science, vol 3104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27796-5_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27796-5_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22230-9

  • Online ISBN: 978-3-540-27796-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation