Scheduling precedence task graphs with disturbances
RAIRO - Operations Research - Recherche Opérationnelle, Tome 37 (2003) no. 3, pp. 145-156.

In this paper we consider the problem of scheduling precedence task graphs in parallel processing where there can be disturbances in computation and communication times. Such a phenomenon often occurs in practice, due to our inability to exactly predict the time because of system intrusion like cache miss and packet transmission time in mediums like ethernet etc. We propose a method based on the addition of some extra edges to protect the initial scheduling from performing badly due to such changes and provide an upper bound on the performance guarantee for the scheduling algorithms. Moreover, this construction guarantees a result at least as good as the result obtained for the initial static scheduling. We also show that this construction is a minimal set in context of partially on-line scheduling.

DOI : https://doi.org/10.1051/ro:2003018
Mots clés : parallel processing, scheduling, stability, uncertainty, communication delays
@article{RO_2003__37_3_145_0,
     author = {Gupta, Apurv and Parmentier, Gilles and Trystram, Denis},
     title = {Scheduling precedence task graphs with disturbances},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {145--156},
     publisher = {EDP-Sciences},
     volume = {37},
     number = {3},
     year = {2003},
     doi = {10.1051/ro:2003018},
     zbl = {1090.68530},
     mrnumber = {2034536},
     language = {en},
     url = {http://www.numdam.org/item/RO_2003__37_3_145_0/}
}
Gupta, Apurv; Parmentier, Gilles; Trystram, Denis. Scheduling precedence task graphs with disturbances. RAIRO - Operations Research - Recherche Opérationnelle, Tome 37 (2003) no. 3, pp. 145-156. doi : 10.1051/ro:2003018. http://www.numdam.org/item/RO_2003__37_3_145_0/

[1] J. Blazewicz, K. Ecker, E. Pesch, G. Schmidt and J. Weglarz, Scheduling in Computer and Manufacturing Systems. Springer-Verlag, 3rd edn. (1996). | Zbl 0767.90033

[2] A. Gerasoulis and T. Yang, Dsc: Scheduling parallel tasks on an unbounded number of processors. IEEE Trans. Parallel Distrib. Syst. 5 (1994) 951-967.

[3] A. Gerasoulis, J. Jiao and T. Yang, Applications of graph scheduling techniques in parallelizing irregular scientific computation, in Parallel Algorithms for Irregular Problems: State of the Art, edited by A. Ferreira and J.D.P. Rolim, Chapter 13. Kluwer Academic Publishers, Netherlands (1995) 245-267. | Zbl 0856.68130

[4] F. Guinand, A. Moukrim and E. Sanlaville, Scheduling With Communication Delays and On-Line Disturbances, in Proc. of the European Conference on Parallel Computing, EuroPar'99, Aug. 31-Sept. 3, Toulouse (France). Springer-Verlag, Lecture Notes in Comput. Sci. 1685 (1999).

[5] J.-J. Hwang, Y.-C. Chow, F.D. Anger and C.-Y. Lee, Scheduling precedence graphs in systems with interprocessor communication times. SIAM J. Comput. 18 (1989) 244-257. | MR 986664 | Zbl 0677.68026

[6] P. Kouvelis and G. Yu, Robust Discrete Optimization and its Applications. Kluwer Academic Publishers (1997). | MR 1480918 | Zbl 0873.90071

[7] R.M. Kieckhafer, J.S. Deogun and A.W. Krings, The performance of inherently stable multiprocessor list scheduler. Real Time Syst. 15 (1998) 5-39.

[8] A.W. Krings and M. Dror, Real-time dispatching: Scheduling stability and precedence. Int. J. Found. Comput. Sci. 10 (1999) 313-327. | MR 1726988

[9] G.K. Manacher, Production and stabilization of real-time task schedules. J. ACM 14 (1967) 439-465.

[10] C. Papadimitriou and M. Yannakakis, Towards an architecture-independent analysis of parallel algorithms. SIAM J. Comput. 19 (1990) 322-328. | MR 1042731 | Zbl 0692.68032