Design, Automation &Amp; Test in Europe Conference &Amp; Exhibition (DATE), 2015 2015
DOI: 10.7873/date.2015.0286
|View full text |Cite
|
Sign up to set email alerts
|

Energy Minimization for Fault Tolerant Scheduling of Periodic Fixed-Priority Applications on Multiprocessor Platforms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
3
3
1

Relationship

1
6

Authors

Journals

citations
Cited by 14 publications
(10 citation statements)
references
References 0 publications
0
10
0
Order By: Relevance
“…This algorithm combines DVFS for optimizing energy consumption and re-execution recovery for fault tolerance, but their scope is restricted to single processor systems. In [18], authors introduced an efficient method to determine the checkpointing scheme that can tolerate k transient faults on a single processor. They also proposed a task allocation scheme to reduce energy consumption.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…This algorithm combines DVFS for optimizing energy consumption and re-execution recovery for fault tolerance, but their scope is restricted to single processor systems. In [18], authors introduced an efficient method to determine the checkpointing scheme that can tolerate k transient faults on a single processor. They also proposed a task allocation scheme to reduce energy consumption.…”
Section: Related Workmentioning
confidence: 99%
“…The best response time WCRT best of the task can be written as: (18) WCRT best ( ) = min 1≤ ≤2 WCRT( ),…”
Section: Otherwise Ormentioning
confidence: 99%
“…As shown in [55], checkpointing with roll-back recovery is a very efficient technique to reduce recovery overhead and improve system schedulability. To our best knowledge, there is no work that targets on improving system schedulability for fixed-priority tasks on multi-core platforms based on exploring the combination of task partitioning and checkpointing.…”
Section: Task Set With Checkpointingmentioning
confidence: 99%
“…Since there is no existing work in the literature that solves the exact same problem, we first extend the BFD to incorporate the checkpointing feature. The tasks are sorted in non-increasing order of utilization, the algorithm allocates one task at a time and use algorithm ECHK [55] to search for a feasible checkpointing scheme for this task and tasks on each candidate core. Among all feasible cores (a core is considered feasible if there exists a feasible checkpointing configuration among the tasks on the core and the task to be allocated), the task is assigned to the core with the least remanning utilization.…”
Section: Experiments 3 Acceptance Ratio Vs Checkpointingmentioning
confidence: 99%
See 1 more Smart Citation