Power efficient scheduling for hard real-time systems on a multiprocessor platform
NPC'10 Proceedings of the 2010 IFIP international conference on Network and parallel computing
On best-effort utility accrual real-time scheduling on multiprocessors
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Thermal-aware global real-time scheduling and analysis on multicore systems
Journal of Systems Architecture: the EUROMICRO Journal
| Hi-index | 0.00 |
In hard-real-time environment, scheduling periodic tasksupon multiprocessors is one of the most popular problemswhere uniform multiprocessor scheduling is a well-knownone. In this platform, execution time of each task in oneprocessor is proportional to the computing capacity of thisprocessor. From previous works, we know there are only approximate feasible solutions for on-line scheduling on uniform multiprocessors. In this paper, with task migration, we first present a novelmodel called T-Ler plane to describe the behavior of tasks and processors, and two optimal on-line algorithms based on T-Ler plane to schedule real-time tasks with dynamic-priority assignment on uniform multiprocessors. To make it practical and to reduce context switches, we also present a polynomial-time algorithm to bound the times of rescheduling in a T-Ler plane. Since task migration is easier in SOC multicore processors, our result might be applicable and adapted to many asymmetric multicore platforms.