{"title":"基于松弛回收方法的功率认知算法","authors":"B. Beena, C. Prashanth","doi":"10.1109/IC3I.2014.7019696","DOIUrl":null,"url":null,"abstract":"In this paper, we present few energy-cognizant algorithms using slack reclamation method. In the present design, the Earliest-Deadline-First (EDF) scheduling policies have been employed on the both CPUs for the dynamic tasks and FIFO scheduling for static tasks. When a new task arrives and the primary processor is active then that task will be scheduled in secondary if that processor is inactive else based on priority context switching will happen. The proposed System shows significant energy saving compared to existing SSPT algorithms.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Power cognizant algorithms using slack reclamation method\",\"authors\":\"B. Beena, C. Prashanth\",\"doi\":\"10.1109/IC3I.2014.7019696\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present few energy-cognizant algorithms using slack reclamation method. In the present design, the Earliest-Deadline-First (EDF) scheduling policies have been employed on the both CPUs for the dynamic tasks and FIFO scheduling for static tasks. When a new task arrives and the primary processor is active then that task will be scheduled in secondary if that processor is inactive else based on priority context switching will happen. The proposed System shows significant energy saving compared to existing SSPT algorithms.\",\"PeriodicalId\":430848,\"journal\":{\"name\":\"2014 International Conference on Contemporary Computing and Informatics (IC3I)\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 International Conference on Contemporary Computing and Informatics (IC3I)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IC3I.2014.7019696\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IC3I.2014.7019696","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Power cognizant algorithms using slack reclamation method
In this paper, we present few energy-cognizant algorithms using slack reclamation method. In the present design, the Earliest-Deadline-First (EDF) scheduling policies have been employed on the both CPUs for the dynamic tasks and FIFO scheduling for static tasks. When a new task arrives and the primary processor is active then that task will be scheduled in secondary if that processor is inactive else based on priority context switching will happen. The proposed System shows significant energy saving compared to existing SSPT algorithms.