ELS:同构多核平台的硬实时调度器

Mahdi Masoudi, Amir Rajabzadeh
{"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}
引用次数: 0

摘要

本文提出了一种称为ELS的调度器(基于EDF、LLF和SJF算法的组合),用于同构多核平台中的硬实时任务,目的是提高系统性能(成功率)。为了获得合适的调度,ELS在不同的任务条件下结合了三种EDF(最早截止日期优先)、改进的LLF(最小松弛优先)和SJF(最短作业优先)调度算法。ELS背后的核心原则是根据松弛率与最坏情况执行时间的比率来选择任务。在SimSO标准模拟器中对ELS调度器进行了四核和八核两种情况下的仿真。对RandFixedSum算法生成的100个随机任务的实验结果表明,在四核平台上,与EDF、SJF、LLF和RM (rate monotonic)相比,成功率平均提高了10%、14.1%、10.8%和33.3%。与EDF、SJF、LLF和RM相比,八核平台的成功率分别提高了31.6%、21.6%、6.6%和38.3%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信