2020
DOI: 10.1007/s11227-020-03145-w
|View full text |Cite
|
Sign up to set email alerts
|

A solution to drawbacks in capturing execution requirements on heterogeneous platforms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 23 publications
0
4
0
Order By: Relevance
“…In 2019, Zhang et al [206] implemented a linear programming algorithm and a dynamic programming algorithm for real-time task scheduling under a heterogeneous platform with task duplication. Subsequently, Devaraj [207] demonstrated that the linear programming algorithm fails to produce valid execution schedules because the proposed problem formulation does not correctly capture the execution requirements of real-time tasks. Devaraj [207] presented the necessary modifications for optimal execution of the algorithm proposed by Zhang et al [206].…”
Section: Schedulability Analysis Techniquesmentioning
confidence: 99%
See 1 more Smart Citation
“…In 2019, Zhang et al [206] implemented a linear programming algorithm and a dynamic programming algorithm for real-time task scheduling under a heterogeneous platform with task duplication. Subsequently, Devaraj [207] demonstrated that the linear programming algorithm fails to produce valid execution schedules because the proposed problem formulation does not correctly capture the execution requirements of real-time tasks. Devaraj [207] presented the necessary modifications for optimal execution of the algorithm proposed by Zhang et al [206].…”
Section: Schedulability Analysis Techniquesmentioning
confidence: 99%
“…Subsequently, Devaraj [207] demonstrated that the linear programming algorithm fails to produce valid execution schedules because the proposed problem formulation does not correctly capture the execution requirements of real-time tasks. Devaraj [207] presented the necessary modifications for optimal execution of the algorithm proposed by Zhang et al [206].…”
Section: Schedulability Analysis Techniquesmentioning
confidence: 99%
“…Dogan and Özgüner [40] analyzed the task execution reliability on heterogeneous computing systems, and combined this into applications dynamic level to implemented the scheduling algorithm. Roy et al studied the real-time precedence-constrained task scheduling problem on heterogeneous systems with multiple service levels (such as performance, reliability, cost) [34]- [36]. Zhang et al first built the heterogeneous systems communication contention and task execution reliability model.…”
Section: Related Workmentioning
confidence: 99%
“…To address these problems, this study adopts a migration method that can avoid cache misses and processor task state transitions. The study focuses on the overhead nonmigration scheduling method [8] .…”
Section: Introductionmentioning
confidence: 99%