Approximation algorithm for multiprocessor parallel job scheduling

  • Chen Song-qiao 
  • Huang Jin-gui 
  • Chen Jian-er 
Article
Received:

Abstract

P k|fix|C max problem is a new scheduling problem based on the multiprocessor parallel job, and it is proved to be NP-hard problem when k⩾ 3. This paper focuses on the case of k=3. Some new observations and new techniques for P 3|fix|C max problem are offered. The concept of semi-normal schedulings is introduced, and a very simple linear time algorithm Semi-normal Algorithm for constructing semi-normal schedulings is developed. With the method of the classical Graham List Scheduling, a thorough analysis of the optimal scheduling on a special instance is provided, which shows that the algorithm is an approximation algorithm of ratio of 9/8 for any instance of P 3|fix|C max problem, and improves the previous best ratio of 7/6 by M.X. Goemans.

Key words

multiprocessor parallel job scheduling approximation algorithm NP-hard problem 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Amoura A K, Bampis E, Kenyon C, et al. Scheduling independent multiprocessor tasks[A]. In: Burkard R, Woeginger G J eds. Proc 5th Ann European Symposium on Algorithms. Lecture Notes in Computer Science[C]. Berlin: Springer-Verlag Press, 1997. 1–12.Google Scholar
  2. [2]
    Chen J, Miranda A. A polynomial time approximation scheme for general multiprocessor job scheduling[J]. SIAM (Society for Industrial and Applied Mathematics) J Computer, 2001, 31: 1–7.MATHMathSciNetGoogle Scholar
  3. [3]
    Jansen K, Porkolab L. General multiprocessor task scheduling: Approximate solutions in linear time[A]. Dehne F, Gupta A, Sack J, eds. 1999 Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science[C]. Berlin: Springer-Verlag Press, 1999, 1663: 110–121.Google Scholar
  4. [4]
    Hoogeveen J A, Van de Velde S L, Veltman B. Complexity of scheduling multiprocessor tasks with prespecified processor allocations[J]. Discrete Applied Mathematics, 1994, 55: 259–272.MATHCrossRefMathSciNetGoogle Scholar
  5. [5]
    Blazewicz J, Dell’Olmo P, Drozdowski M, et al. Scheduling multiprocessor tasks on the three dedicated processors[J]. Information Processing Letters, 1992, 41: 275–280.MATHCrossRefMathSciNetGoogle Scholar
  6. [6]
    Blazewicz J, Drozdowski M, Weglarz J. Scheduling multiprocessor tasks to minimize scheduling length[J]. IEEE Transaction on Computers, 1986, 35: 389–393.MATHGoogle Scholar
  7. [7]
    Garey M R, Johnson D S. Computers and intractability: A guide to the theory of NP-completeness[M]. San Francisco: Freeman Press, 1979.Google Scholar
  8. [8]
    Dell’Olmo P, Speranza M G, Tuza Z S. Efficiency and effectiveness of normal schedules on three dedicated processors[J]. Discrete Mathematics, 1997, 164: 67–79.MATHCrossRefMathSciNetGoogle Scholar
  9. [9]
    Huang J, Chen J, Chen S. A simple linear time approximation algorithm for multi-processor job scheduling on four processors[A]. In: Hsu Tsan Sheng ed. 12th Annual International Symposium on Algorithms and Computation. Lecture Notes in Computer Science [C]. Berlin: Springer-Verlag Press, 2000, 1969: 60–71.Google Scholar
  10. [10]
    Goemans M X. An approximation algorithm for scheduling on three dedicated machines[J]. Discrete Applied Mathematics, 1995, 61: 49–59.MATHCrossRefMathSciNetGoogle Scholar
  11. [11]
    Graham R L. Bounds for certain multiprocessing anomalies[J]. Bell System Technical Journal, 1966, 45: 1563–1581.Google Scholar

Copyright information

© Central South University 2002

Authors and Affiliations

  • Chen Song-qiao 
    • 1
  • Huang Jin-gui 
    • 1
  • Chen Jian-er 
    • 1
  1. 1.College of Information EngineeringCentral South UniversityChangshaChina

Personalised recommendations