{"title":"一种改进的单处理器周期任务系统可调度性测试方法","authors":"Umamaheswari Devi","doi":"10.1109/EMRTS.2003.1212723","DOIUrl":null,"url":null,"abstract":"We present a sufficient linear-time schedulability test for preemptable, asynchronous, periodic task systems with arbitrary relative deadlines, scheduled on a uniprocessor by an optimal scheduling algorithm. We show that this test is more accurate than the commonly-used density condition. We also present and discuss the results of our test with that of a pseudo-polynomial-time schedulability test presented previously for a restricted class of task systems in which utilization is strictly less than one.","PeriodicalId":120694,"journal":{"name":"15th Euromicro Conference on Real-Time Systems, 2003. Proceedings.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"90","resultStr":"{\"title\":\"An improved schedulability test for uniprocessor periodic task systems\",\"authors\":\"Umamaheswari Devi\",\"doi\":\"10.1109/EMRTS.2003.1212723\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a sufficient linear-time schedulability test for preemptable, asynchronous, periodic task systems with arbitrary relative deadlines, scheduled on a uniprocessor by an optimal scheduling algorithm. We show that this test is more accurate than the commonly-used density condition. We also present and discuss the results of our test with that of a pseudo-polynomial-time schedulability test presented previously for a restricted class of task systems in which utilization is strictly less than one.\",\"PeriodicalId\":120694,\"journal\":{\"name\":\"15th Euromicro Conference on Real-Time Systems, 2003. Proceedings.\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-07-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"90\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"15th Euromicro Conference on Real-Time Systems, 2003. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EMRTS.2003.1212723\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"15th Euromicro Conference on Real-Time Systems, 2003. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EMRTS.2003.1212723","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An improved schedulability test for uniprocessor periodic task systems
We present a sufficient linear-time schedulability test for preemptable, asynchronous, periodic task systems with arbitrary relative deadlines, scheduled on a uniprocessor by an optimal scheduling algorithm. We show that this test is more accurate than the commonly-used density condition. We also present and discuss the results of our test with that of a pseudo-polynomial-time schedulability test presented previously for a restricted class of task systems in which utilization is strictly less than one.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
