Skip to main content
SpringerLink
Log in

A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 2000)

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

Included in the following conference series:

Abstract

Multiprocessor job scheduling problem has become increasingly interesting, for both theoretical study and practical applications. Theoretical study of the problem has made significant progress recently, which, however, seems not to imply practical algorithms for the problem, yet. Practical algorithms have been developed only for systems with three processors and the techniques seem dificult to extend to systems with more than three processors. This paper offers new observations and introduces new techniques for the multiprocessor job scheduling problem on systems with four processors. A very simple and practical linear time approximation algorithm of ratio bounded by 1.5 is developed for the multi-processor job scheduling problem P4|fix| C max, which significantly improves previous results. Our techniques are also useful for multiprocessor job scheduling problems on systems with more than four processors.

This work is supported by the China National Natural Science Foundation for Distinguished Young Scholars and by the Changjiang Scholar Reward Project.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. A. K. Amoura, E. Bampis, C. Kenyon, and Y. Manoussakis, Scheduling independent multiprocessor tasks, Proc. 5th Ann. European Symposium on Algorithms,Lecture Notes in Computer Science 1284, (1997), pp. 1–12.

    Google Scholar 

  2. L. Bianco, J. Blazewicz, P. Dell’Olmo, and M. Drozdowski, Schedulingmultiprocessor tasks on a dynamic configuration of dedicated processors, Annalsof Operations Research 58, (1995), pp. 493–517.

    Article  MATH  MathSciNet  Google Scholar 

  3. J. Blazewicz, P. Dell’Olmo, M. Drozdowski, and M. Speranza, Scheduling multiprocessor tasks on the three dedicated processors, Information Processing Letters 41, (1992), pp. 275–280.

    Article  MATH  MathSciNet  Google Scholar 

  4. J. Blazewicz, P. Dell’Olmo, M. Drozdowski, and M. Speranza, Corrigendum to “Scheduling multiprocessor tasks on the three dedicated processors,Information Processing Letters 41, (1992), pp. 275–280.” Information Processing Letters 49, (1994), pp. 269-270.

    Article  MATH  MathSciNet  Google Scholar 

  5. J. Blazewicz, M. Drozdowski, and J. Weglarz, Scheduling multiprocessor tasks to minimize scheduling length, IEEE Transactions on Computers 35, (1986), pp. 389–393.

    Article  MATH  Google Scholar 

  6. J. Blazewicz, W. Drozdowski, and J. Weglarz, Scheduling multiprocessor tasks — a survey, International Journal of Microcomputer Applications 13, (1994), pp. 89–97.

    Google Scholar 

  7. J. Chen and C.-Y. Lee, General multiprocessor tasks scheduling, Naval Research Logistics 46, (1999), pp. 59–74.

    Article  MathSciNet  Google Scholar 

  8. J. Chen and A. Miranda, A polynomial time approximation scheme for general multiprocessor job scheduling, Proc. 31st Annual ACM Symposium on Theory of Computing (STOC’99), (1999), pp. 418–427. Final version to appear in SIAM J. Comput.

    Google Scholar 

  9. P. Dell’Olmo, M. G. Speranza, Zs. Tuza, Efficiency and effectiveness of normal schedules on three dedicated processors, Discrete Mathematics 164, (1997), pp. 67–79.

    Article  MATH  MathSciNet  Google Scholar 

  10. G. Dobson and U. Karmarkar, Simultaneous resource scheduling to minimize weighted flow times, Operations Research 37, (1989), pp. 592–600.

    Article  MATH  MathSciNet  Google Scholar 

  11. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.

    MATH  Google Scholar 

  12. M. X. Goemans, An approximation algorithm for scheduling on three dedicated machines, Discrete Applied Mathematics 61, (1995), pp. 49–59.

    Article  MATH  MathSciNet  Google Scholar 

  13. R. L. Graham, Bounds for certain multiprocessing anomalies, Bell System Technical Journal 45, (1966), pp. 1563–1581.

    Google Scholar 

  14. L. A. Hall, Approximation algorithms for scheduling, in D. S. Hochbaum, ed., Approximation algorithms for NP-hard problems, PWS Publishing Company, 1997, pp. 1–45.

    Google Scholar 

  15. J. A. Hoogeveen, S. L. van de Velde, and B. Veltman, Complexity of scheduling multiprocessor tasks with prespecified processor allocations, Discrete Applied Mathematics 55, (1994), pp. 259–272.

    Article  MATH  MathSciNet  Google Scholar 

  16. K. Jansen and L. Porkolab, General multiprocessor task scheduling: approximate solutions in linear time, Lecture Notes in Computer Science 1663 (WADS’99), (1999), pp. 110–121.

    Google Scholar 

  17. H. Krawczyk and M. Kubale, An approximation algorithm for diagnostic test scheduling in multicomputer systems, IEEE Transactions on Computers 34, (1985), pp. 869–872.

    Article  Google Scholar 

  18. C.-Y. Lee and X. Cai, Scheduling multiprocessor tasks without prespecified processor allocations, IIE Transactions, to appear.

    Google Scholar 

  19. C.-Y. Lee, L. Lei, and M. Pinedo, Current trends in deterministic scheduling, Annals of Operations Research 70, (1997), pp. 1–42.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Information Engineering, Central-South University, ChangSha, Hunan, 410083, P. R. China

    Jingui Huang, Jianer Chen & Songqiao Chen

Authors
  1. Jingui Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jianer Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Songqiao Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Karlsruhe University, Germany

    Gerhard Goos

  2. Cornell University, NY, USA

    Juris Hartmanis

  3. Utrecht University, The Netherlands

    Jan van Leeuwen

  4. Academia Sinica, Institute of Information Science, 128 Academia Road, Section 2, Nankang, 115, Taipei, Taiwan, R.O.C.

    D. T. Lee

  5. Department of Computer Science and Akamai Technologies, University of Illinois at Urbana Champaign, 500 Technology Square, 02139, Cambridge, MA, USA

    Shang-Hua Teng

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Huang, J., Chen, J., Chen, S. (2000). A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors. In: Goos, G., Hartmanis, J., van Leeuwen, J., Lee, D.T., Teng, SH. (eds) Algorithms and Computation. ISAAC 2000. Lecture Notes in Computer Science, vol 1969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40996-3_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-40996-3_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41255-7

  • Online ISBN: 978-3-540-40996-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation