一种核电厂实时计算任务调度算法

Kui Xu, Lixia Guo, Yinggang Jing, Shuan He, Fan Zhang, Yang Lan
{"title":"一种核电厂实时计算任务调度算法","authors":"Kui Xu, Lixia Guo, Yinggang Jing, Shuan He, Fan Zhang, Yang Lan","doi":"10.1109/ICPICS55264.2022.9873565","DOIUrl":null,"url":null,"abstract":"Nuclear power industrial Internet is a system that can analyze the data generated by nuclear power plants. Real-time Computational tasks refers to the calculations which is used to deal with alarms, equipment status, situations and etc. This paper focuses on the issue of scheduling computational tasks. An improved Min-min scheduling algorithm which called B-Min-min is introduced. Then we present an analysis on the model of task scheduling, where load balance especially the maximum usage of a node is considered. We evaluate these approaches by simulation and the final results are presented based on different parameters. simulation results shows that system is better load balanced.","PeriodicalId":257180,"journal":{"name":"2022 IEEE 4th International Conference on Power, Intelligent Computing and Systems (ICPICS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Real-Time Computational Task Scheduling Algorithm for Nuclear Power Plant\",\"authors\":\"Kui Xu, Lixia Guo, Yinggang Jing, Shuan He, Fan Zhang, Yang Lan\",\"doi\":\"10.1109/ICPICS55264.2022.9873565\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Nuclear power industrial Internet is a system that can analyze the data generated by nuclear power plants. Real-time Computational tasks refers to the calculations which is used to deal with alarms, equipment status, situations and etc. This paper focuses on the issue of scheduling computational tasks. An improved Min-min scheduling algorithm which called B-Min-min is introduced. Then we present an analysis on the model of task scheduling, where load balance especially the maximum usage of a node is considered. We evaluate these approaches by simulation and the final results are presented based on different parameters. simulation results shows that system is better load balanced.\",\"PeriodicalId\":257180,\"journal\":{\"name\":\"2022 IEEE 4th International Conference on Power, Intelligent Computing and Systems (ICPICS)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-07-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE 4th International Conference on Power, Intelligent Computing and Systems (ICPICS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPICS55264.2022.9873565\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 4th International Conference on Power, Intelligent Computing and Systems (ICPICS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPICS55264.2022.9873565","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

核电工业互联网是一个能够对核电站产生的数据进行分析的系统。实时计算任务是指用于处理报警、设备状态、情况等的计算。本文主要研究计算任务的调度问题。提出了一种改进的最小最小调度算法,称为b -最小最小调度算法。然后对任务调度模型进行了分析,其中考虑了负载均衡,特别是节点的最大使用率。我们通过仿真对这些方法进行了评估,并给出了基于不同参数的最终结果。仿真结果表明,该系统具有较好的负载均衡性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Real-Time Computational Task Scheduling Algorithm for Nuclear Power Plant
Nuclear power industrial Internet is a system that can analyze the data generated by nuclear power plants. Real-time Computational tasks refers to the calculations which is used to deal with alarms, equipment status, situations and etc. This paper focuses on the issue of scheduling computational tasks. An improved Min-min scheduling algorithm which called B-Min-min is introduced. Then we present an analysis on the model of task scheduling, where load balance especially the maximum usage of a node is considered. We evaluate these approaches by simulation and the final results are presented based on different parameters. simulation results shows that system is better load balanced.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信