Skip to main content Accessibility help
×
Home

Scheduling an interval ordered precedence graph with communication delays and a limited number of processors

  • Alix Munier Kordon (a1), Fadi Kacem (a2), Benoît Dupont de Dinechin (a3) and Lucian Finta (a4)

Abstract

We consider the scheduling of an interval order precedence graph of unit execution time tasks with communication delays, release dates and deadlines. Tasks must be executed by a set of processors partitioned into K classes; each task requires one processor from a fixed class. The aim of this paper is to study the extension of the Leung–Palem–Pnueli (in short LPP) algorithm to this problem. The main result is to prove that the LPP algorithm can be extended to dedicated processors and monotone communication delays. It is also proved that the problem is NP–complete for two dedicated processors if communication delays are non monotone. Lastly, we show that list scheduling algorithm cannot provide a solution for identical processors.

Copyright

References

Hide All
[1] Ali, H.H. and El.-Rewini, H.H., An optimal algorithm for scheduling interval ordered tasks with communication on processors. J. Comput. Syst. Sci. 2 (1995) 301307.
[2] P. Chrétienne and C. Picouleau, Scheduling with communication delays : a survey. in Scheduling Theory and its Applications, edited P. Chrétienne, E.G. Coffman, J.K. Lenstra and Z. Liu. John Wiley Ltd (1995) 65–89.
[3] B. Dupont de Dinechin, Scheduling monotone interval orders on typed task systems. In PLANSIG 2007, 26th Worshop of the UK Planning and Scheduling Special Interest Group (2007) 25–31.
[4] Giroudeau, R., Konig, J.-C., Moulai, F.K. and Palaysi, J., Complexity and approximation for precedence constrained scheduling problems with large communication delays. Theor. Comput. Sci. 401 (2008) 107119.
[5] Horn, W., Some simple scheduling algorithms. Naval Research Logistics Quarterly 21 (1974) 177185.
[6] Hwang, J., Chow, Y., Anger, F. and Lee, C., Scheduling precedence graphs in systems with interprocessor communication times. SIAM J. Comput. 18 (1989) 244257.
[7] Jansen, K., Analysis of Scheduling Problems with Typed Task Systems. Discrete Appl. Math. 52 (1994) 223232.
[8] Leung, A., Palem, K.V. and Pnueli, A., Scheduling Time-Constrained Instructions on Pipelined Processors. ACM Transact. Program. Languages Syst. 23 (2001) 73103.
[9] Palem, K. and Simons, B., Scheduling time-critical instructions on risc machines. ACM Transactions on Programming Languages and Systems 4 (1993) 632658.
[10] Papadimitriou, C.H and Yannakakis, M., Scheduling interval-ordered tasks. SIAM J. Comput. 8 (1979) 405409.
[11] Veltman, B., Lageweg, B.J. and Lenstra, J.K., Multiprocessor scheduling with communication delays. Parallel Comput. 16 (1990) 173182.
[12] J. Verriet, The complexity of scheduling typed task systems with and without communication delays. External Report 1998-26, UU-CS (1998).
[13] Verriet, J., Scheduling interval-ordered tasks with non-uniform deadlines subject to non-zero communication delays. Parallel Comput. 25 (1999) 321.
[14] Yu, W., Hoogeveen, H. and Lenstra, J.K., Minimizing makespan in a two-machine flow shop with delays and unit-time operations is np-hard. J. Scheduling 7 (2004) 333348.

Keywords

Related content

Powered by UNSILO

Scheduling an interval ordered precedence graph with communication delays and a limited number of processors

  • Alix Munier Kordon (a1), Fadi Kacem (a2), Benoît Dupont de Dinechin (a3) and Lucian Finta (a4)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.