{"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}
引用次数: 4
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.