2018 IEEE 20th International Conference on High Performance Computing and Communications; IEEE 16th International Conference On 2018
DOI: 10.1109/hpcc/smartcity/dss.2018.00117
|View full text |Cite
|
Sign up to set email alerts
|

HETERO-SCHED: A Low-Overhead Heterogeneous Multi-core Scheduler for Real-Time Periodic Tasks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 17 publications
(10 citation statements)
references
References 13 publications
0
10
0
Order By: Relevance
“…Task scheduling process belongs to one of the most important procedures during the designing of the real-time applications as it decides about appropriate and optimal resource utilisation and overall quality of the system [2,[26][27][28][29][30][31][32]. That is why this phase of the contemporary real-time system manufacturing belongs to one of the most crucial issues.…”
Section: Tasks Scheduling Mechanismmentioning
confidence: 99%
“…Task scheduling process belongs to one of the most important procedures during the designing of the real-time applications as it decides about appropriate and optimal resource utilisation and overall quality of the system [2,[26][27][28][29][30][31][32]. That is why this phase of the contemporary real-time system manufacturing belongs to one of the most crucial issues.…”
Section: Tasks Scheduling Mechanismmentioning
confidence: 99%
“…In this specific context, the template schedule is built using Mc Naughton wrap-around rule [9]. More recently, a heuristic to schedule periodic tasks on unrelated multiprocessor platforms has been proposed in [10], with in general, an exponential complexity.…”
Section: A Related Workmentioning
confidence: 99%
“…As the seminal work is focused on the feasibility, repeating the template schedule every unit of time is theoretically acceptable. Papers [8], [10] also rely on the notion of the template schedule, although it is differently built. Nevertheless, the authors propose a more applicable solution in stretching the template schedule into consecutive intervals of time delimited by absolute deadlines (referred to as deadline partitioning [5]), in a third step.…”
Section: Rate Matrixmentioning
confidence: 99%
“…Moulik et al . [20] proposed a deadline partitioning (DP)‐Fair [6] based heuristic approach for the scheduling of real‐time tasks executing on heterogeneous platforms. It may be noted that the works in [18–20] discussed above, mainly focus on satisfying timing related constraints associated with real‐time systems and they do not consider energy minimisation as part of their scheduling objective.…”
Section: Related Workmentioning
confidence: 99%