Slack Reclamation in Pipelined Schedule

• Main Authors: Shih-Jie Zhuo, 卓士傑
• Other Authors: Chi-Sheng Shih
• Format: Others
• Language: en_US
• Published: 2009
• Online Access: http://ndltd.ncl.edu.tw/handle/93636975988042416585

碩士 === 國立臺灣大學 === 資訊網路與多媒體研究所 === 97 === On a heterogeneous multi-core platform, pipelined schedule is an important approach to enhance system performance. However, for several modern applications, they are soft real-time tasks with highly variable execution time. Designing and executing a pipelined schedule for these kinds of tasks becomes an important challenge due to the uncertainty of their execution time. As a result, an efficient approach for scheduling soft real-time tasks without constant execution time is required. In this thesis, we present a scheduling algorithm for scheduling tasks of highly variable execution time in a pipelined schedule. The proposed algorithm employs the reservation-based approach to isolate tasks and provide the guaranteed computing resource. Furthermore, an effective resource utilization in pipelined schedule is achieved by reserving an average-case resource usage for soft real-time tasks with variable execution time. Under the schedule of proposed approach, overrun of soft real-time task is properly handled and redundant context switches are also eliminated by an effective slack reclaiming without interfering others’ guaranteed resource. The effectiveness of proposed algorithm in decreasing deadline miss rate and number of context switch is demonstrated by extensive set of simulations.