Thread-level priority assignment in global multiprocessor scheduling for DAG tasks

Cited 5 time in webofscience Cited 0 time in scopus
  • Hit : 236
  • Download : 0
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.
Publisher
ELSEVIER SCIENCE INC
Issue Date
2016-03
Language
English
Article Type
Article
Keywords

REAL-TIME TASKS

Citation

JOURNAL OF SYSTEMS AND SOFTWARE, v.113, pp.246 - 256

ISSN
0164-1212
DOI
10.1016/j.jss.2015.12.004
URI
http://hdl.handle.net/10203/207608
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 5 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0