Abstract
We address the problem of allocating real-time tasks subject to precedence constraints in a distributed system. The use of a list algorithm is a good trade-off between the complexity of the algorithm and the quality of the solution. The optimisation criterion is the load balancing which is linked with the fault tolerance requirements. Such a criterion guarantees that every processor will spend the same amount of time in performing self tests. The application is described by an acyclic graph giving the precedence constraints. To ensure that no deadline will be missed we have to build and check the whole sequence. Allocating and scheduling are handled together in a static approach.
Chapter PDF
References
LANET, Placement statique de tâches dans un calculateur réparti de régulation moteur. Thesis, University of Paris 6, 1995.
LANET, Task Allocation in a Hard Real Time Distributed System. Real Time Systems'95, pp. 244–252, Sklarska Poreba, Poland, Sept.-95.
LU, CAREY, Load Balanced Task Allocation in Locally Distributed Computer Systems. Computer Science Technical Report #633, University of Wisconsin, Madison, Feb.-86.
RAMAMRITHAM, Allocation and Scheduling of Complex Periodic Tasks. IEEE 10th International Conference on Distributed Computing Systems, Jan.-90, pp. 108–115.
TINDELL, BURNS, WELLINGS, Allocating Hard Real Time Tasks: an NP-Hard Problem Made Easy. The Journal of Real Time Systems, Nℴ4, 1992, pp. 145–165.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lanet, J.L. (1996). A load balancing task allocation scheme in a hard real time system. In: Bougé, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds) Euro-Par'96 Parallel Processing. Euro-Par 1996. Lecture Notes in Computer Science, vol 1124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024760
Download citation
DOI: https://doi.org/10.1007/BFb0024760
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61627-6
Online ISBN: 978-3-540-70636-6
eBook Packages: Springer Book Archive