{"title":"ELS:同构多核平台的硬实时调度器","authors":"Mahdi Masoudi, Amir Rajabzadeh","doi":"10.1109/ICCKE48569.2019.8964674","DOIUrl":null,"url":null,"abstract":"This paper presents a scheduler, called ELS (based on the combination of EDF, LLF, and SJF algorithms), for hard real-time tasks in a homogeneous multi-core platform with the aim of increasing system performance (success rate). To obtain a suitable scheduling, ELS exploits the combination of three EDF (Earliest Deadline First), modified LLF (Least Laxity First) and SJF (Shortest Job First) scheduling algorithms in different task conditions. The core principle behind the ELS is choosing tasks based on the laxity ratio to the worst case execution time. The ELS scheduler was simulated in SimSO standard simulator in two cases, i.e., quad and eight-core platforms. The results of the experiments on 100 randomized tasks generated by the RandFixedSum algorithm showed that the success rate has improved on average 10%, 14.1%, 10.8%, and 33.3% compared to the EDF, SJF, LLF, and RM (Rate monotonic) respectively in a quad-core platform. Also, the success rate in an eight-core platform has improved about 31.6%, 21.6%, 6.6%, and 38.3% compared to EDF, SJF, LLF, and RM respectively.","PeriodicalId":6685,"journal":{"name":"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"167 1","pages":"339-344"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"ELS: An Hard Real-time Scheduler for Homogeneous Multi-core Platforms\",\"authors\":\"Mahdi Masoudi, Amir Rajabzadeh\",\"doi\":\"10.1109/ICCKE48569.2019.8964674\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a scheduler, called ELS (based on the combination of EDF, LLF, and SJF algorithms), for hard real-time tasks in a homogeneous multi-core platform with the aim of increasing system performance (success rate). To obtain a suitable scheduling, ELS exploits the combination of three EDF (Earliest Deadline First), modified LLF (Least Laxity First) and SJF (Shortest Job First) scheduling algorithms in different task conditions. The core principle behind the ELS is choosing tasks based on the laxity ratio to the worst case execution time. The ELS scheduler was simulated in SimSO standard simulator in two cases, i.e., quad and eight-core platforms. The results of the experiments on 100 randomized tasks generated by the RandFixedSum algorithm showed that the success rate has improved on average 10%, 14.1%, 10.8%, and 33.3% compared to the EDF, SJF, LLF, and RM (Rate monotonic) respectively in a quad-core platform. Also, the success rate in an eight-core platform has improved about 31.6%, 21.6%, 6.6%, and 38.3% compared to EDF, SJF, LLF, and RM respectively.\",\"PeriodicalId\":6685,\"journal\":{\"name\":\"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)\",\"volume\":\"167 1\",\"pages\":\"339-344\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCKE48569.2019.8964674\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCKE48569.2019.8964674","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
ELS: An Hard Real-time Scheduler for Homogeneous Multi-core Platforms
This paper presents a scheduler, called ELS (based on the combination of EDF, LLF, and SJF algorithms), for hard real-time tasks in a homogeneous multi-core platform with the aim of increasing system performance (success rate). To obtain a suitable scheduling, ELS exploits the combination of three EDF (Earliest Deadline First), modified LLF (Least Laxity First) and SJF (Shortest Job First) scheduling algorithms in different task conditions. The core principle behind the ELS is choosing tasks based on the laxity ratio to the worst case execution time. The ELS scheduler was simulated in SimSO standard simulator in two cases, i.e., quad and eight-core platforms. The results of the experiments on 100 randomized tasks generated by the RandFixedSum algorithm showed that the success rate has improved on average 10%, 14.1%, 10.8%, and 33.3% compared to the EDF, SJF, LLF, and RM (Rate monotonic) respectively in a quad-core platform. Also, the success rate in an eight-core platform has improved about 31.6%, 21.6%, 6.6%, and 38.3% compared to EDF, SJF, LLF, and RM respectively.