{"title":"保证MAFT的最后期限","authors":"M. C. McElvany","doi":"10.1109/REAL.1988.51109","DOIUrl":null,"url":null,"abstract":"The author discusses scheduling in the multicomputer architecture for fault-tolerance (MAFT), a distributed system designed to provide extremely reliable computation in real-time control systems. Scheduling in MAFT is based on a fault-tolerant variation of a priority-list schedule. The threading delay associated with agreement on task completions can cause schedules to experience Richards' anomalies, in which legitimate run-time behavior can cause tasks to miss deadlines. The author develops theory to stabilize the fault-tolerant priority list. She gives an algorithm that stabilizes a restricted class of task workloads and discusses extensions of her results to other workloads.<<ETX>>","PeriodicalId":116211,"journal":{"name":"Proceedings. Real-Time Systems Symposium","volume":"207 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Guaranteeing deadlines in MAFT\",\"authors\":\"M. C. McElvany\",\"doi\":\"10.1109/REAL.1988.51109\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The author discusses scheduling in the multicomputer architecture for fault-tolerance (MAFT), a distributed system designed to provide extremely reliable computation in real-time control systems. Scheduling in MAFT is based on a fault-tolerant variation of a priority-list schedule. The threading delay associated with agreement on task completions can cause schedules to experience Richards' anomalies, in which legitimate run-time behavior can cause tasks to miss deadlines. The author develops theory to stabilize the fault-tolerant priority list. She gives an algorithm that stabilizes a restricted class of task workloads and discusses extensions of her results to other workloads.<<ETX>>\",\"PeriodicalId\":116211,\"journal\":{\"name\":\"Proceedings. Real-Time Systems Symposium\",\"volume\":\"207 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-12-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. Real-Time Systems Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/REAL.1988.51109\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. Real-Time Systems Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/REAL.1988.51109","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The author discusses scheduling in the multicomputer architecture for fault-tolerance (MAFT), a distributed system designed to provide extremely reliable computation in real-time control systems. Scheduling in MAFT is based on a fault-tolerant variation of a priority-list schedule. The threading delay associated with agreement on task completions can cause schedules to experience Richards' anomalies, in which legitimate run-time behavior can cause tasks to miss deadlines. The author develops theory to stabilize the fault-tolerant priority list. She gives an algorithm that stabilizes a restricted class of task workloads and discusses extensions of her results to other workloads.<>