.png){kind=icon}
返回
Reliability versus performance for critical applications
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2008.11.002.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Applications implemented on critical systems are subject to both safety critical and real-time constraints. Classically, applications are specified as precedence task graphs that must be scheduled onto a given target multiprocessor heterogeneous architecture. We propose a new method for simultaneously optimizing two objectives: the execution time and the reliability of the schedule. The problem is decomposed into two successive steps: a spatial allocation during which the reliability is maximized (randomized algorithm), and a scheduling during which the makespan is minimized (list scheduling algorithm). It allows us to produce several trade-off solutions, among which the user can choose the solution that best fits the application's requirements. Reliability is increased by replicating adequate tasks onto well chosen processors. Our fault model assumes that processors are fail-silent, that they are subject to transient failures, and that the occurrences of failures follow a constant parameter Poisson law. We assess and validate our method by running extensive simulations on both random graphs and actual application graphs. They show that it is competitive, in terms of makespan, compared to existing reference scheduling methods for heterogeneous processors (HEFT), while providing a better reliability. (C) 2008 Elsevier Inc. All rights reserved.
Keyword:
Multi-processor scheduling
Multi-objective optimization
Reliability
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
引用论文
Sn2+ transferred hyperfine fields in the Europium monochalcogenides doped with tin monochalcogenides
PREAI
分享收藏
Mechanism of ion escape from phosphatidylcholine and phosphatidylserine single bilayer vesicles.png)
Biochemistry
BiochemistryIF0
PREAI
分享收藏Approximation results for a bicriteria job scheduling problem on a single machine without preemption
OAAI
OAAI分享收藏
查看更多内容