Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
459248 | Journal of Systems and Software | 2016 | 11 Pages |
•An efficient interference-based analysis for multi-threaded tasks is introduced.•The optimal thread-level priority assignment (OTPA) algorithm is proposed.•A novel priority assignment based on deadline adjustment is suggested.•Robust experiments that show great performance of our proposed approaches are given.
The advent of multi- and many-core processors offers enormous performance potential for parallel tasks that exhibit sufficient intra-task thread-level parallelism. With a growth of novel parallel programming models (e.g., OpenMP, MapReduce), scheduling parallel tasks in the real-time context has received an increasing attention in the recent past. While most studies focused on schedulability analysis under some well-known scheduling algorithms designed for sequential tasks, little work has been introduced to design new scheduling policies that accommodate the features of parallel tasks, such as their multi-threaded structure. Motivated by this, we refine real-time scheduling algorithm categories according to the basic unit of scheduling and propose a new priority assignment method for global task-wide thread-level fixed-priority scheduling of parallel task systems. Our evaluation results show that a finer-grained, thread-level fixed-priority assignment, when properly assigned, significantly improves schedulability, compared to a coarser-grained, task-level assignment.