{"title":"故障突发容错实时系统的可调度性分析","authors":"Zhengyong Zhou, Liping Pang, Y. Fumin","doi":"10.1109/ITAIC.2014.7064998","DOIUrl":null,"url":null,"abstract":"Burst error model describes phenomena which cause potentially random faults over a bounded time interval. We study the worst response time for tasks under fixed-priority with checkpoints. Since checkpointing schemes depend on time redundancy, they could affect the correctness of the system by causing deadlines to be missed. In this paper, we provide an exact schedulability analysis for burst error model and derive the optimal number of checkpoints. We also explore the fault-tolerant priority assignment policy to get the most efficient scheme.","PeriodicalId":111584,"journal":{"name":"2014 IEEE 7th Joint International Information Technology and Artificial Intelligence Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Schedulability analysis for Fault tolerance real-time system under fault bursts\",\"authors\":\"Zhengyong Zhou, Liping Pang, Y. Fumin\",\"doi\":\"10.1109/ITAIC.2014.7064998\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Burst error model describes phenomena which cause potentially random faults over a bounded time interval. We study the worst response time for tasks under fixed-priority with checkpoints. Since checkpointing schemes depend on time redundancy, they could affect the correctness of the system by causing deadlines to be missed. In this paper, we provide an exact schedulability analysis for burst error model and derive the optimal number of checkpoints. We also explore the fault-tolerant priority assignment policy to get the most efficient scheme.\",\"PeriodicalId\":111584,\"journal\":{\"name\":\"2014 IEEE 7th Joint International Information Technology and Artificial Intelligence Conference\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE 7th Joint International Information Technology and Artificial Intelligence Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITAIC.2014.7064998\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 7th Joint International Information Technology and Artificial Intelligence Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITAIC.2014.7064998","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Schedulability analysis for Fault tolerance real-time system under fault bursts
Burst error model describes phenomena which cause potentially random faults over a bounded time interval. We study the worst response time for tasks under fixed-priority with checkpoints. Since checkpointing schemes depend on time redundancy, they could affect the correctness of the system by causing deadlines to be missed. In this paper, we provide an exact schedulability analysis for burst error model and derive the optimal number of checkpoints. We also explore the fault-tolerant priority assignment policy to get the most efficient scheme.