Abstract
This paper deals with the problem of task allocation, subjected to precedence constraints, on multiprocessor architectures with interprocessor communication delays. Two kinds of scheduling are distinguished: the deterministic scheduling (the duration of each task and the duration of each communication delay are known and are constant) and the stochastic scheduling (the duration of each task and the duration of each communication delay is modelled by a probability law).
For each of these two scheduling problems, we propose several scheduling methods and we build several models in order first to estimate the efficiency of the obtained schedules and second to evaluate the multiprocessor architecture performances, such as the busy percentage of processors. These methods are based on the coupling between priority list algorithms and neighbourhood methods. Because neighbourhood methods are not suitable for stochastic scheduling problem, we have modified the simulated annealing algorithm in order to solve stochastic optimization problems.
For the deterministic scheduling, we use finite deterministic simulation models. In the case of stochastic scheduling, we built several models: a markovian model, a stochastic simulation model and a hybrid model (markovian analysis and simulation).
Although this scheduling problem is NP-complete, these methods compute satisfactory solutions in reasonable computing times. The mean improvement compared with classical list scheduling methods is about 10% in the deterministic case as well as in the stochastic case.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
T.L. Adam, K.M. Chandy, J.R. Dickson, “A comparison of list schedules for parallel processing systems”. Communications of the ACM, Vol 17 (n∘12), Dec 1974.
A.A. Bulgak, J.L. Sanders, “Integrating a modified simulated annealing algorithm with the simultion of a manufacturing system to optimize buffer sizes in automatic assembly systems”, Proceedings of the 1988 Winter Simulation Conference, pp. 684–690.
P. Chrétienne, “A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree like precedence constraints”, EJOR 43, 225–230, 1989.
P. Chrétienne, C. Picouleau, “The basic scheduling problem with interprocessor communication delays”, Ecole d'été sur la théorie de l'ordonnancement et ses applications, 28 Sept–20 Octobre 1992, Château de Bonas (Gers), France, pp. 81–100.
E. G. Coffman, R.L. Graham, “Optimal scheduling for two processor systems”, Acta Informatica, Vol 1, pp. 200–213, 1972.
E.G. Coffman, “Computer and jobshop scheduling theory”, John Wiley and sons, 1987.
G. Fleury, “Quelques méthodes de résolution de problèmes NP-complets”, Thèse d'université, Université Blaise Pascal, Clermont-Ferrand II, à paraître, 1993.
M.R. Garey, D.S. Johnson, “Computers and intractability: a guide to the theory of NP-completeness”, Freeman, New-York, 1983.
A. Gerasoulis, T. Yang, “A static macro-dataflow scheduling tool for scalable parallel architecture”. Ecole d'été sur la théorie de l'ordonnancement et ses applications, 28 Sept–20 Octobre 1992, Château de Bonas (Gers), France, pp. 382–417.
B. Hajeck, “Cooling schedules for optimal annealing”, Mathematics of Operations Research, 1988, pp.311–329, 1988.
T.C. Hu, “Parallel sequencing and assembly line problem”. Operational Research, Vol 9, pp. 841–843, Nov. 1961.
J.J. Hwang, Y.C. Chow, F.D. Anger, C.Y. Lee, “Scheduling precedence graphs in systems with interprocessor communication times”, SIAM JComp, 18,2,April 1989, pp. 244–257.
T.G. Lewis, W.H. Payne, “Generalized feedback shift register pseudo random number algorithm”, J. ACM, Vol 20, n∘3, pp.456–468. July 73.
M.A. Marsan, G. Balbo, G. Conte, “Performance models of multiprocessor systems”, The MIT Press, USA, 1986.
M.K. Molloy, “Performance analysis using Petri Nets”, IEEE Transactions on Computers, Vol C31. September 1984, pp. 913–917.
B. Mueller, “NUMAS: a tool for the numerical modelling of computer systems”, in Modelling Techniques and Tools for Performance Analysis, North-Holland, 1985.
S. Natkin, “Réseaux de Petri stochastiques”. Thèse de Docteur-Ingénieur, Cnam Paris. 1980.
S. Norre, “Affectation de tâches sur une architecture multiprocesseur — Méthodes stochastiques et évaluation des performances”. Thèse de doctorat,Université Clermont-Ferrand II.
D.W. Paul, “An approach toward a universal specification language for discrete stochastic systems”, in Modelling Techniques and Tools for Performance Analysis, North-Holland, 1985.
C. Picouleau, “New complexity results on the UET-UCT scheduling problems”, Ecole d'été sur la théorie de l'ordonnancement et ses applications, 28 Sept–20 Octobre 1992, Château de Bonas (Gers), France, pp. 487–502.
D. Potier, M. Véran, “The markovian solver of Qnap2 and applications”, Rapport Technique INRIA n∘49. Mars 1985, France
Qnap2 version8, manuel de référence, Société Simulog, 1991.
P. Siarry, G. Dreyfus, “La méthode du recuit simulé: théorie et applications”, ISDET, Paris, 1988.
W.J. Stewart, “A comparison of numerical techniques in markov modelling”, C. ACM 21, 2, 1978, pp. 144–152.
P.J.M. Van Laarhoven, “Simulated annealing: theory and applications”, Kluwer Academic Publishors, The Netherlands, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Norre, S. (1993). Static allocation of tasks on multiprocessor architectures with interprocessor communication delays. In: Bode, A., Reeve, M., Wolf, G. (eds) PARLE '93 Parallel Architectures and Languages Europe. PARLE 1993. Lecture Notes in Computer Science, vol 694. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56891-3_39
Download citation
DOI: https://doi.org/10.1007/3-540-56891-3_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56891-9
Online ISBN: 978-3-540-47779-2
eBook Packages: Springer Book Archive