{"title":"单处理机上具有EDF非抢占调度的零星任务图最坏情况响应时间分析","authors":"H. Zhao, L. George, Serge Midonnet","doi":"10.1109/CONIELECOMP.2007.115","DOIUrl":null,"url":null,"abstract":"This paper considers the problem of non-preemptive hard realtime scheduling of sporadic task graphs on a uniprocessor with earliest deadline first (EDF) scheduling. A sporadic task graph associated to an application is characterized by a set of subtasks under precedence constraints with deadline constraints. We study feasibility conditions based on the computation of the worst case response times of any subtask of a task graph. We investigate the late deadline constraint.","PeriodicalId":288478,"journal":{"name":"Third International Conference on Autonomic and Autonomous Systems (ICAS'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Worst Case Response Time Analysis of Sporadic Task Graphs with EDF Non-preemptive Scheduling on a Uniprocessor\",\"authors\":\"H. Zhao, L. George, Serge Midonnet\",\"doi\":\"10.1109/CONIELECOMP.2007.115\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper considers the problem of non-preemptive hard realtime scheduling of sporadic task graphs on a uniprocessor with earliest deadline first (EDF) scheduling. A sporadic task graph associated to an application is characterized by a set of subtasks under precedence constraints with deadline constraints. We study feasibility conditions based on the computation of the worst case response times of any subtask of a task graph. We investigate the late deadline constraint.\",\"PeriodicalId\":288478,\"journal\":{\"name\":\"Third International Conference on Autonomic and Autonomous Systems (ICAS'07)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-06-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Third International Conference on Autonomic and Autonomous Systems (ICAS'07)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CONIELECOMP.2007.115\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Third International Conference on Autonomic and Autonomous Systems (ICAS'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CONIELECOMP.2007.115","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Worst Case Response Time Analysis of Sporadic Task Graphs with EDF Non-preemptive Scheduling on a Uniprocessor
This paper considers the problem of non-preemptive hard realtime scheduling of sporadic task graphs on a uniprocessor with earliest deadline first (EDF) scheduling. A sporadic task graph associated to an application is characterized by a set of subtasks under precedence constraints with deadline constraints. We study feasibility conditions based on the computation of the worst case response times of any subtask of a task graph. We investigate the late deadline constraint.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
