Bioinspired Model for Edge-based Task Scheduling Applications

S. Nimkar, M. Khanapurkar
{"title":"Bioinspired Model for Edge-based Task Scheduling Applications","authors":"S. Nimkar, M. Khanapurkar","doi":"10.1145/3590837.3590889","DOIUrl":null,"url":null,"abstract":"Optimization of task scheduling for edge devices requires extensive analysis of task computational requirements & capacities of edge VirtOptimizingual Machines (VMs). Scheduling models are responsible for mapping edge tasks with these VMs for minimization of make-span, with higher deadline-hit-ratio, and lower computational complexity. To perform this task, a wide variety of bioinspired models are proposed by researchers, and most of them use static learning rates, which limits their task-to-edge mapping performance. Moreover, adaptive learning rate models are highly complex, which increases their convergence delays, thereby reducing scheduling efficiency under heterogeneous task types. To overcome these limitations, this text proposes design of an Improved & Adaptive Bioinspired Model for Edge-based Task Scheduling Applications, which uses League Championship Model (LCM). It optimizes its learning performance via an adaptive stochastic process. The model sets-up an initial learning rate for scheduling tasks to edge VMs, and then uses a Grey Wolf Optimizer (GWO) to continuously update learning rate for better mapping performance. The GWO Model uses low-complexity wolf behavioral functions in order to determine optimum learning rates for different VM & task types. This allows for faster convergence, and lower service delays when evaluated on standard scheduling datasets. The model was compared in terms of scheduling efficiency, make-span, computational complexity, and delay needed for scheduling, with various state-of-the-art models. It was observed that the proposed model outperformed them w.r.t. these evaluation metrics under most use cases, wherein it showcases 8.5% lower make-span, 1.5% higher efficiency, 5.9% lower computational complexity, and 8.3% lower computational delay, thereby making it useful for a wide variety of real-time use casesthey had developed.","PeriodicalId":112926,"journal":{"name":"Proceedings of the 4th International Conference on Information Management & Machine Intelligence","volume":"148 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 4th International Conference on Information Management & Machine Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3590837.3590889","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Optimization of task scheduling for edge devices requires extensive analysis of task computational requirements & capacities of edge VirtOptimizingual Machines (VMs). Scheduling models are responsible for mapping edge tasks with these VMs for minimization of make-span, with higher deadline-hit-ratio, and lower computational complexity. To perform this task, a wide variety of bioinspired models are proposed by researchers, and most of them use static learning rates, which limits their task-to-edge mapping performance. Moreover, adaptive learning rate models are highly complex, which increases their convergence delays, thereby reducing scheduling efficiency under heterogeneous task types. To overcome these limitations, this text proposes design of an Improved & Adaptive Bioinspired Model for Edge-based Task Scheduling Applications, which uses League Championship Model (LCM). It optimizes its learning performance via an adaptive stochastic process. The model sets-up an initial learning rate for scheduling tasks to edge VMs, and then uses a Grey Wolf Optimizer (GWO) to continuously update learning rate for better mapping performance. The GWO Model uses low-complexity wolf behavioral functions in order to determine optimum learning rates for different VM & task types. This allows for faster convergence, and lower service delays when evaluated on standard scheduling datasets. The model was compared in terms of scheduling efficiency, make-span, computational complexity, and delay needed for scheduling, with various state-of-the-art models. It was observed that the proposed model outperformed them w.r.t. these evaluation metrics under most use cases, wherein it showcases 8.5% lower make-span, 1.5% higher efficiency, 5.9% lower computational complexity, and 8.3% lower computational delay, thereby making it useful for a wide variety of real-time use casesthey had developed.
基于边缘的任务调度应用程序的仿生模型
优化边缘设备的任务调度需要对边缘虚拟语言机(vm)的任务计算需求和能力进行广泛的分析。调度模型负责将边缘任务与这些虚拟机进行映射,以最小化make-span,具有更高的截止时间命中率和更低的计算复杂度。为了完成这项任务,研究人员提出了各种各样的生物启发模型,其中大多数模型使用静态学习率,这限制了它们的任务到边缘映射性能。此外,自适应学习率模型非常复杂,这增加了其收敛延迟,从而降低了异构任务类型下的调度效率。为了克服这些限制,本文提出了一种基于边缘的任务调度应用程序的改进和自适应生物启发模型的设计,该模型使用联赛冠军模型(LCM)。它通过自适应随机过程优化其学习性能。该模型为边缘虚拟机调度任务设置初始学习率,然后使用灰狼优化器(GWO)不断更新学习率以获得更好的映射性能。GWO模型使用低复杂度的狼行为函数来确定不同VM和任务类型的最佳学习率。当在标准调度数据集上评估时,这允许更快的收敛和更低的服务延迟。在调度效率、调度跨度、计算复杂度和调度所需的延迟等方面,与各种先进模型进行了比较。我们观察到,在大多数用例下,所提出的模型在这些评估指标上的表现优于它们,其中它显示了8.5%的制造跨度降低,1.5%的效率提高,5.9%的计算复杂性降低,8.3%的计算延迟降低,从而使其适用于他们开发的各种实时用例。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信