{"title":"由周期性任务集组成的实时应用程序的调度技术","authors":"Hardeep Singh","doi":"10.1109/RTA.1994.316133","DOIUrl":null,"url":null,"abstract":"Scheduling algorithms for applications consisting of hard deadlines are described. A preemptive scheduling algorithm that avoids unnecessary preemptions is presented. Also, a predictive nonpreemptive scheduling algorithm is given that looks at future arrival times of tasks, and schedules them nonpreemptively.<<ETX>>","PeriodicalId":399167,"journal":{"name":"Proceedings of 2nd IEEE Workshop on Real-Time Applications","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Scheduling techniques for real-time applications consisting of periodic task sets\",\"authors\":\"Hardeep Singh\",\"doi\":\"10.1109/RTA.1994.316133\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Scheduling algorithms for applications consisting of hard deadlines are described. A preemptive scheduling algorithm that avoids unnecessary preemptions is presented. Also, a predictive nonpreemptive scheduling algorithm is given that looks at future arrival times of tasks, and schedules them nonpreemptively.<<ETX>>\",\"PeriodicalId\":399167,\"journal\":{\"name\":\"Proceedings of 2nd IEEE Workshop on Real-Time Applications\",\"volume\":\"58 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-07-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 2nd IEEE Workshop on Real-Time Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RTA.1994.316133\",\"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 of 2nd IEEE Workshop on Real-Time Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RTA.1994.316133","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Scheduling techniques for real-time applications consisting of periodic task sets
Scheduling algorithms for applications consisting of hard deadlines are described. A preemptive scheduling algorithm that avoids unnecessary preemptions is presented. Also, a predictive nonpreemptive scheduling algorithm is given that looks at future arrival times of tasks, and schedules them nonpreemptively.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
