正在进行的工作:并行处理器上混合临界系统的同步执行模型

B. Alahmad, S. Gopalakrishnan
{"title":"正在进行的工作:并行处理器上混合临界系统的同步执行模型","authors":"B. Alahmad, S. Gopalakrishnan","doi":"10.1109/RTSS.2017.00050","DOIUrl":null,"url":null,"abstract":"We propose redundancy-based execution models to address the reliability and correctness of safety/time-critical applications, and in particular, mixed-criticality systems. In our models, every job has one or more (possibly identical) versions, and all versions of a job are to run isochronously on multiple parallel machines in a lockstep fashion. The redundant machines act as monitoring coprocessors, and the execution of a job is deemed successful as soon as one of its versions completes within its worst-case execution time estimate, at which point we may terminate all the other versions. Doing so e ectively increases the chance that a job completes successfully and thus provides timing guarantees in the form of increased predictability. We present several allocation and scheduling problems with varying levels of generality, with the objective of minimizing the maximum makespan across all processors.","PeriodicalId":407932,"journal":{"name":"2017 IEEE Real-Time Systems Symposium (RTSS)","volume":"207 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Work-in-Progress: Isochronous Execution Models for Mixed-Criticality Systems on Parallel Processors\",\"authors\":\"B. Alahmad, S. Gopalakrishnan\",\"doi\":\"10.1109/RTSS.2017.00050\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose redundancy-based execution models to address the reliability and correctness of safety/time-critical applications, and in particular, mixed-criticality systems. In our models, every job has one or more (possibly identical) versions, and all versions of a job are to run isochronously on multiple parallel machines in a lockstep fashion. The redundant machines act as monitoring coprocessors, and the execution of a job is deemed successful as soon as one of its versions completes within its worst-case execution time estimate, at which point we may terminate all the other versions. Doing so e ectively increases the chance that a job completes successfully and thus provides timing guarantees in the form of increased predictability. We present several allocation and scheduling problems with varying levels of generality, with the objective of minimizing the maximum makespan across all processors.\",\"PeriodicalId\":407932,\"journal\":{\"name\":\"2017 IEEE Real-Time Systems Symposium (RTSS)\",\"volume\":\"207 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE Real-Time Systems Symposium (RTSS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RTSS.2017.00050\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE Real-Time Systems Symposium (RTSS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RTSS.2017.00050","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

我们提出了基于冗余的执行模型来解决安全/时间关键应用程序的可靠性和正确性,特别是混合关键系统。在我们的模型中,每个作业都有一个或多个(可能相同的)版本,并且作业的所有版本都将以同步的方式在多台并行机器上同步运行。冗余机器充当监视协处理器,只要其中一个版本在最坏情况下的执行时间估计内完成,就认为作业执行成功,此时我们可以终止所有其他版本。这样做有效地增加了工作成功完成的机会,从而以增加可预测性的形式提供了时间保证。我们提出了几个具有不同通用性级别的分配和调度问题,其目标是最小化所有处理器的最大makespan。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Work-in-Progress: Isochronous Execution Models for Mixed-Criticality Systems on Parallel Processors
We propose redundancy-based execution models to address the reliability and correctness of safety/time-critical applications, and in particular, mixed-criticality systems. In our models, every job has one or more (possibly identical) versions, and all versions of a job are to run isochronously on multiple parallel machines in a lockstep fashion. The redundant machines act as monitoring coprocessors, and the execution of a job is deemed successful as soon as one of its versions completes within its worst-case execution time estimate, at which point we may terminate all the other versions. Doing so e ectively increases the chance that a job completes successfully and thus provides timing guarantees in the form of increased predictability. We present several allocation and scheduling problems with varying levels of generality, with the objective of minimizing the maximum makespan across all processors.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信