| Summary: | 碩士 === 國立臺灣大學 === 資訊工程學研究所 === 96 === In hard-real-time environment, scheduling periodic tasks upon multiprocessors is one of the most popular problems where uniform multiprocessor scheduling is a well-known one. In uniform multiprocessor scheduling, execution
time of each task in one processor is proportional to the computing capacity of this processor. From previous works, there are only approximate feasible solutions for on-line scheduling on uniform multiprocessors. In this thesis, with task migration, we first present a novel model called T-Ler plane for uniform multiprocessors to describe the behavior of tasks and processors, and two optimal algorithms based on T-Ler plane to schedule dynamic-priority real-time tasks on uniform multiprocessors. To make it practical and reduce context switches, we also present a polynomial-time algorithm to bound the times of rescheduling or task migration in a T-Ler plane and give an experimental evaluation for it. Since task migration is easier in SOC multicore processors, our result might be applicable and adapted to many asymmetric multicore platforms.
|
|---|
