Flávia Maristela Santos Nascimento, George Lima, Ernesto Massa
{"title":"在制品:准分区调度中的非周期任务处理","authors":"Flávia Maristela Santos Nascimento, George Lima, Ernesto Massa","doi":"10.1109/RTSS.2017.00048","DOIUrl":null,"url":null,"abstract":"Quasi-Partition Scheduling (QPS) is a new scheduling approach with low preemption and migration overhead. QPS was originally proposed taking into consideration hard periodic and sporadic tasks. In this paper we discuss a proposal for extending QPS to deal with soft aperiodic tasks.","PeriodicalId":407932,"journal":{"name":"2017 IEEE Real-Time Systems Symposium (RTSS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Work-in-Progress: Dealing with Aperiodic Tasks on Quasi-Partitioning Scheduling\",\"authors\":\"Flávia Maristela Santos Nascimento, George Lima, Ernesto Massa\",\"doi\":\"10.1109/RTSS.2017.00048\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Quasi-Partition Scheduling (QPS) is a new scheduling approach with low preemption and migration overhead. QPS was originally proposed taking into consideration hard periodic and sporadic tasks. In this paper we discuss a proposal for extending QPS to deal with soft aperiodic tasks.\",\"PeriodicalId\":407932,\"journal\":{\"name\":\"2017 IEEE Real-Time Systems Symposium (RTSS)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE Real-Time Systems Symposium (RTSS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RTSS.2017.00048\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE Real-Time Systems Symposium (RTSS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RTSS.2017.00048","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Work-in-Progress: Dealing with Aperiodic Tasks on Quasi-Partitioning Scheduling
Quasi-Partition Scheduling (QPS) is a new scheduling approach with low preemption and migration overhead. QPS was originally proposed taking into consideration hard periodic and sporadic tasks. In this paper we discuss a proposal for extending QPS to deal with soft aperiodic tasks.