The Community for Technology Leaders
Green Image
A decentralized task reallocation algorithm for hard real-time systems is developed and analyzed. The algorithm, which is fast and reliable, specifically considers deadlines of tasks, attempts to utilize all the nodes of a distributed system to achieve its objective, handles tasks in priority order, and separates policy and mechanism. An extensive performance analysis of the algorithm by means
decentralised decision-making; task reallocation; hard real-time system; deadlines; distributed system; performance analysis; simulation; distributed processing; real-time systems; scheduling.

J. Stankovic, "Decentralized Decision-Making for Task Reallocation in a Hard Real-Time System," in IEEE Transactions on Computers, vol. 38, no. , pp. 341-355, 1989.
94 ms
(Ver 3.3 (11022016))