A load balancing task allocation scheme in a hard real time system
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.
KeywordsDistributed System Real Time Load Balancing List Scheduling
Unable to display preview. Download preview PDF.
- LANET, Placement statique de tâches dans un calculateur réparti de régulation moteur. Thesis, University of Paris 6, 1995.Google Scholar
- LANET, Task Allocation in a Hard Real Time Distributed System. Real Time Systems'95, pp. 244–252, Sklarska Poreba, Poland, Sept.-95.Google Scholar
- LU, CAREY, Load Balanced Task Allocation in Locally Distributed Computer Systems. Computer Science Technical Report #633, University of Wisconsin, Madison, Feb.-86.Google Scholar
- RAMAMRITHAM, Allocation and Scheduling of Complex Periodic Tasks. IEEE 10th International Conference on Distributed Computing Systems, Jan.-90, pp. 108–115.Google Scholar