Advertisement

Annals of Operations Research

, Volume 58, Issue 7, pp 493–517 | Cite as

Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors

  • L. Bianco
  • J. Blazewicz
  • P. Dell'Olmo
  • M. Drozdowski
Scheduling and Routing

Abstract

In the classical scheduling theory, it is widely assumed that a task can be processed by only one processor at a time. With the rapid development of technology, this assumption is no longer valid. In this work we present a problem of scheduling tasks, each of which requires for its processing a set of processors simultaneously and which can be executed on several alternative sets of processors. Scheduling algorithms based on dynamic and linear programming are presented that construct minimum length non-preemptive and preemptive schedules, respectively. Results of computational experiments are also reported.

Keywords

Rapid Development Schedule Algorithm Computational Experiment Minimum Length Schedule Task 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    M.J. Atallah, C. Lock Black and D.C. Marinescu, Models and algorithms for coscheduling computer-intensive tasks on a network of workstations, J. Parallel Distributed Comput. 16(1992)319–327.Google Scholar
  2. [2]
    K.R. Baker,Introduction to Sequencing and Scheduling, (Wiley, New York, 1974).Google Scholar
  3. [3]
    L. Bianco, J. Blażewicz, P. Dell'Olmo and M. Drozdowski, Scheduling preemptive multiprocessor tasks on dedicated processors, Perf. Eval. 20(1994)361–371.Google Scholar
  4. [4]
    G. Bozoki and J.P. Richard, A branch-and-bound algorithm for continuous-process task shop scheduling problem, AIIE Trans. 2(1970)246–252.Google Scholar
  5. [5]
    J. Blażewicz, W. Cellary, R. Slowiński and J. Węglarz,Scheduling under Resource Constraints: Deterministic Models (J.C. Baltzer, Basel, 1986).Google Scholar
  6. [6]
    J. Blażewicz, P. Dell'Olmo, M. Drozdowski and M.G. Speranza, Scheduling multiprocessor tasks on three dedicated processors, IPL 41(1992)275–280.Google Scholar
  7. [7]
    J. Blażewicz, M. Drabowski and J. Węglarz, Scheduling multiprocessor tasks to minimize schedule length, IEEE Trans. Comput. C-35(1986)389–393.Google Scholar
  8. [8]
    J. Blażewicz, M. Drozdowski, G. Schmidt and D. de Werra, Scheduling independent multiprocessor tasks on a uniformk-processor system, Parallel Comput. 20(1994)15–28.Google Scholar
  9. [9]
    J. Blażewicz, K. Ecker, G. Schmidt and J. Węglarz,Scheduling in Computer and Manufacturing Systems (Springer, New York, 1993).Google Scholar
  10. [10]
    J. Blażewicz, J.K. Lenstra and A.H.G. Rinnooy Kan, Scheduling subject to resource constraints: Classification of complexity, Discr. Appl. Math. 5(1983)11–24.Google Scholar
  11. [11]
    G.I. Chen and T.H. Lai, Preemptive scheduling of independent jobs on a hypercube, IPL 28(1988)201–206.Google Scholar
  12. [12]
    E.G. Coffman, Jr. (ed.),Computer and Job-Shop Scheduling Theory (Wiley, New York, 1976).Google Scholar
  13. [13]
    J. Du and J.Y.-T. Leung, Complexity of scheduling parallel task systems, SIAM J. Discr. Math. 2(1989)473–487.Google Scholar
  14. [14]
    R.I. Graham, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: A survey, Ann. Discr. Math. 5(1979)287–326.Google Scholar
  15. [15]
    D.G. Feitelson and L. Rudoloh, Gang scheduling performance benefits for fine-grain synchronization, J. Parallel Distributed Comput. 16(1992)306–318.Google Scholar
  16. [16]
    R. Jain, K. Somalwar, J. Werth and J.C. Browne, Scheduling parallel I/O operations in multiple bus systems, J. Parallel Distributed Comput. 16(1992)352–362.Google Scholar
  17. [17]
    H. Krawczyk and M. Kubale, An approximation algorithm for diagnostic test scheduling in multicomputer systems, IEEE Trans. Comput. C-34(1985)869–872.Google Scholar
  18. [18]
    M. Kubale, The complexity of scheduling independent two-processor tasks on dedicated processors, IPL 24(1987)141–147.Google Scholar
  19. [19]
    M. Kubale, Preemptive scheduling of two-processor tasks on dedicated processors, Zeszyty Naukowe Politechniki Śląskiej, Seria: Automatyka z. 100, No. 1082 (1990) 147–153, in Polish.Google Scholar
  20. [20]
    J. Plehn, Preemptive scheduling of independent jobs with release times and deadlines on a hypercube IPL 34(1990)161–166.Google Scholar
  21. [21]
    B. Veltman, B.J. Lageweg and J.K. Lenstra, Multiprocessor scheduling with communication delays, Parallel Comput. 16(1990)173–182.Google Scholar
  22. [22]
    B. Veltman, Multiprocessor scheduling with communication delays, Ph.D. Thesis, CWI, Amsterdam (1993).Google Scholar
  23. [23]
    Q. Wang and K.H. Cheng, A heuristic of scheduling parallel tasks and its analysis, SIAM J. Comput. 21(1992)281–294.Google Scholar

Copyright information

© J.C. Baltzer AG, Science Publishers 1995

Authors and Affiliations

  • L. Bianco
    • 1
  • J. Blazewicz
    • 2
  • P. Dell'Olmo
    • 1
  • M. Drozdowski
    • 2
  1. 1.Istituto di Analisi dei Sistemi ed Informatica del CNRRomeItaly
  2. 2.Instytut Informatyki Politechniki PoznańskiejPoznańPoland

Personalised recommendations