An efficient strategy for task duplication in multiport message-passing systems

  • Dingchao Li
  • Yuji Iwahori
  • Tatsuya Hayashi
  • Naohiro Ishii
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1470)


important problem in compilers for parallel machines. In this paper, we present a duplication strategy for task scheduling in multiport message-passing systems. Through a performance gain analysis, we establish a condition under which duplicating a parent task of a task is beneficial. We also show that, by incorporating this strategy into two well-known priority-based scheduling algorithms, significant reductions in the execution time can be achieved.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    B. Kruatrachue and T.G. Lewis, Grain Size Determination for Parallel Processing, IEEE Software, pp. 23–32, Jan., 1988.Google Scholar
  2. 2.
    J.Y. Colin and P. Chritienne, C.P.M. Scheduling with Small Communication Delays and Task Duplication, Operations Research, vol. 39, no. 4, pp. 680–684, July, 1991.MATHGoogle Scholar
  3. 3.
    Y.C.Chung and S.Ranka, Application and Performance Analysis of a Compile-Time Optimization Approach for List Scheduling Algorithms on Distributed-Memory Multiprocessors, Proc. of Supercomputing’92, pp. 512–521, 1992.Google Scholar
  4. 4.
    H.B. Chen, B. Shirazi, K. Kavi, and A.R. Hurson, Static Scheduling Using Linear Clustering with Task Duplication, Proc. of ISCA International Conference on Parallel and Distributed Computing and Systems, pp. 285–290, 1993.Google Scholar
  5. 5.
    J. Siddhiwala and L.F. Chao, Path-Based Task Replication for Scheduling with Communication Costs, Proc. of the 1995 International Conference on Parallel Processing, vol. II, pp. 186–190, 1995.Google Scholar
  6. 6.
    M. A. Palis, J. Liou and D. S. L. Wei, Task Clustering and Scheduling for Distributed Memory Parallel Architectures, IEEE Trans. on Parallel and Distributed Systems, vol. 7, no. 1, pp. 46–55, Jan. 1996.CrossRefGoogle Scholar
  7. 7.
    S. Darbha and D.P. Agrawal, Optimal Scheduling Algorithm for Distributed-Memory Machines, IEEE Trans. on Parallel and Distributed Systems, vol. 9, no. 1, pp. 87–95, Jan. 1998.CrossRefGoogle Scholar
  8. 8.
    K.K. Kwok and I. Ahmad, Exploiting Duplication to Minimize the Execution Times of Parallel Programs on Message-Passing Systems, Proc. of the sixth IEEE Symposium on Parallel and Distributed Processing, pp. 426–433, 1994.Google Scholar
  9. 9.
    H.El-Rewini and T.G.Lewis, ”Scheduling Parallel Program Tasks onto Arbitrary Target Machines,” J. Parallel and Distributed Computing 9, pp. 138–153, 1990.CrossRefGoogle Scholar
  10. 10.
    G.C.Sin and E.A.Lee, ”A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures,” IEEE Trans. on Parallel and Distributed Syst., vol. 4, no. 2, pp. 175–187, 1993.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Dingchao Li
    • 1
  • Yuji Iwahori
    • 1
  • Tatsuya Hayashi
    • 2
  • Naohiro Ishii
    • 3
  1. 1.Educational Center for Information ProcessingNagoya Institute of TechnologyJapan
  2. 2.Department of Electrical and Computer EngineeringNagoya Institute of TechnologyJapan
  3. 3.Department of Intelligence and Computer ScienceNagoya Institute of TechnologyJapan

Personalised recommendations