{"title":"P_FENP:一个多处理器实时调度算法","authors":"E. A. Capota, C. Stângaciu, M. Micea, V. Cretu","doi":"10.1109/SACI.2018.8440932","DOIUrl":null,"url":null,"abstract":"This paper addresses the problem of real-time scheduling on multiprocessor systems for periodic tasks when scheduling jitter is not allowed. A partitioned real-time scheduling method based on a table-driven uniprocessor algorithm called fixed execution non-preemptive (FENP) is proposed as a solution for this problem. An analysis of the new proposed algorithm is provided in terms of scheduling jitter and schedulability ratio, by comparison against other popular partitioned real-time scheduling algorithms.","PeriodicalId":126087,"journal":{"name":"2018 IEEE 12th International Symposium on Applied Computational Intelligence and Informatics (SACI)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"P_FENP: A Multiprocessor Real-Time Scheduling Algorithm\",\"authors\":\"E. A. Capota, C. Stângaciu, M. Micea, V. Cretu\",\"doi\":\"10.1109/SACI.2018.8440932\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper addresses the problem of real-time scheduling on multiprocessor systems for periodic tasks when scheduling jitter is not allowed. A partitioned real-time scheduling method based on a table-driven uniprocessor algorithm called fixed execution non-preemptive (FENP) is proposed as a solution for this problem. An analysis of the new proposed algorithm is provided in terms of scheduling jitter and schedulability ratio, by comparison against other popular partitioned real-time scheduling algorithms.\",\"PeriodicalId\":126087,\"journal\":{\"name\":\"2018 IEEE 12th International Symposium on Applied Computational Intelligence and Informatics (SACI)\",\"volume\":\"95 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE 12th International Symposium on Applied Computational Intelligence and Informatics (SACI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SACI.2018.8440932\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 12th International Symposium on Applied Computational Intelligence and Informatics (SACI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SACI.2018.8440932","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
P_FENP: A Multiprocessor Real-Time Scheduling Algorithm
This paper addresses the problem of real-time scheduling on multiprocessor systems for periodic tasks when scheduling jitter is not allowed. A partitioned real-time scheduling method based on a table-driven uniprocessor algorithm called fixed execution non-preemptive (FENP) is proposed as a solution for this problem. An analysis of the new proposed algorithm is provided in terms of scheduling jitter and schedulability ratio, by comparison against other popular partitioned real-time scheduling algorithms.