Dynamic task scheduling for fog nodes based on deadline constraints and task frequency for smart factories

Malik Louail, M. Esseghir, L. Merghem
{"title":"Dynamic task scheduling for fog nodes based on deadline constraints and task frequency for smart factories","authors":"Malik Louail, M. Esseghir, L. Merghem","doi":"10.1109/NoF50125.2020.9249150","DOIUrl":null,"url":null,"abstract":"With the integration of Internet in industrial production and in manufacturing, the concept of Industrial Internet of things (IIoT) has become one of the most innovative tools for factories. Since factories generate a huge amount of data and requests that need to be treated quickly, fog computing, as a decentralized computing structure is a powerful complement to the cloud to handle this data because it has an important potential to improve factory production significantly. Fog computing handles the incoming tasks by applying a task scheduling policy in order to achieve a better performance of the factory. In this work, we propose a real time dynamic task scheduler which considers deadline and frequency constraints as an emergency degree, at the fog level, in order to process the incoming tasks correctly. Our approach considers a fog network based on auctions in which tasks rejected by a fog can be accepted at another fog. In terms of the number of rejected tasks, extensive simulations have shown good performance of the proposed task scheduler compared to similar works.","PeriodicalId":405626,"journal":{"name":"2020 11th International Conference on Network of the Future (NoF)","volume":"206 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 11th International Conference on Network of the Future (NoF)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NoF50125.2020.9249150","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

With the integration of Internet in industrial production and in manufacturing, the concept of Industrial Internet of things (IIoT) has become one of the most innovative tools for factories. Since factories generate a huge amount of data and requests that need to be treated quickly, fog computing, as a decentralized computing structure is a powerful complement to the cloud to handle this data because it has an important potential to improve factory production significantly. Fog computing handles the incoming tasks by applying a task scheduling policy in order to achieve a better performance of the factory. In this work, we propose a real time dynamic task scheduler which considers deadline and frequency constraints as an emergency degree, at the fog level, in order to process the incoming tasks correctly. Our approach considers a fog network based on auctions in which tasks rejected by a fog can be accepted at another fog. In terms of the number of rejected tasks, extensive simulations have shown good performance of the proposed task scheduler compared to similar works.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于期限约束和任务频率的智能工厂雾节点动态任务调度
随着互联网在工业生产和制造业中的融合,工业物联网(IIoT)的概念已经成为工厂最具创新性的工具之一。由于工厂产生大量需要快速处理的数据和请求,雾计算作为一种分散的计算结构,是云处理这些数据的强大补充,因为它具有显着提高工厂生产的重要潜力。雾计算通过应用任务调度策略来处理传入的任务,以达到更好的工厂性能。在这项工作中,我们提出了一种实时动态任务调度程序,它将截止日期和频率约束视为紧急程度,在雾级,以便正确处理传入的任务。我们的方法考虑了一个基于拍卖的雾网络,在这个网络中,被一个雾拒绝的任务可以被另一个雾接受。在拒绝任务数量方面,大量的仿真表明,与同类工作相比,所提出的任务调度程序具有良好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Dynamic task scheduling for fog nodes based on deadline constraints and task frequency for smart factories Experimental Performance Evaluation of Bluetooth5 for In-building Networks Accurate Classification for HPC Applications Concerning Traffic Matrix Visual Patterns A Heuristic Method for Controller Placement and Enhanced Availability between SDN Controllers Bounded Latency with Bridge-Local Stream Reservation and Strict Priority Queuing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1