Optimal performances and scheduling for parallel algorithms with equal cost tasks

  • Z. Mahjoub
  • F. Karoui-Sahtout
Part of the Lecture Notes in Computer Science book series (LNCS, volume 634)


(PA) being a parallel algorithm involving n equal cost tasks, we study the P(τ) problem of determining the minimum required number of processors π to execute (PA) in minimum time τ regardless of communication costs. We use a binary search strategy based on a critical path oriented scheduling heuristic. O(n+m) to O([nlogn+m]logn) steps are required to compute a near optimal solution where m is the number of precedence constraints. A generalization to the problem P(t) (∀t>τ) and to the non equal cost tasks case is then easily introduced.


  1. 1.
    M. Cosnard and Y. Robert, Tech. & Sc. Inf 6, 115–125 (1987)Google Scholar
  2. 2.
    K. Hwang and F. Briggs, Computer Architecture and Parallel Processing (Mc Graw-Hill, 1984)Google Scholar
  3. 3.
    Z. Mahjoub and F. Karoui-Sahtout, Par. Comp. 17, 471–481 (1991)MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Z. Mahjoub
    • 1
  • F. Karoui-Sahtout
    • 1
  1. 1.Dept InformatiqueFaculte des Sciences de TunisBelvedereTunisia

Personalised recommendations