{"title":"可靠系统实时任务的动态调度模型","authors":"Zhang Jie, Y. Fumin, Tu Gang","doi":"10.1109/NSWCTC.2009.207","DOIUrl":null,"url":null,"abstract":"Real-time task now emerges in various reliable systems; however, most existing schedulers of real-time tasks are limited to fixed priority scheduling. A dynamic priority scheduling model is derived for the preemptive earliest deadline first scheduling of periodic real-time tasks in the real-time reliable system. Moreover, a heuristic algorithm is present for the schedulability test, which is effective when the priority inheritance protocol is considered to prevent priority inversion.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A Dynamic Scheduling Model for Real-Time Tasks in Reliable System\",\"authors\":\"Zhang Jie, Y. Fumin, Tu Gang\",\"doi\":\"10.1109/NSWCTC.2009.207\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Real-time task now emerges in various reliable systems; however, most existing schedulers of real-time tasks are limited to fixed priority scheduling. A dynamic priority scheduling model is derived for the preemptive earliest deadline first scheduling of periodic real-time tasks in the real-time reliable system. Moreover, a heuristic algorithm is present for the schedulability test, which is effective when the priority inheritance protocol is considered to prevent priority inversion.\",\"PeriodicalId\":433291,\"journal\":{\"name\":\"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing\",\"volume\":\"48 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-04-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NSWCTC.2009.207\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NSWCTC.2009.207","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Dynamic Scheduling Model for Real-Time Tasks in Reliable System
Real-time task now emerges in various reliable systems; however, most existing schedulers of real-time tasks are limited to fixed priority scheduling. A dynamic priority scheduling model is derived for the preemptive earliest deadline first scheduling of periodic real-time tasks in the real-time reliable system. Moreover, a heuristic algorithm is present for the schedulability test, which is effective when the priority inheritance protocol is considered to prevent priority inversion.