A Unified Job Scheduler for Optimization of Different System Performance Metrics

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Jaishree Mayank, Arijit Mondal
{"title":"A Unified Job Scheduler for Optimization of Different System Performance Metrics","authors":"Jaishree Mayank,&nbsp;Arijit Mondal","doi":"10.1002/cpe.70111","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>Internet-of-Things-enabled frameworks have eased the development of complex systems, but they throw a significant challenge for efficient resource utilization, thereby improving the system performance. An intelligent scheduler is essential for managing the resources and allocating the same resources to different requests or tasks. This work proposes a generic methodology to optimize system performance metrics such as throughput, utilization, and reward achieved. We present an integer linear programming formulation of the problem to find an optimal solution. We present offline heuristic methods to quickly find reasonable solutions, given the intractable nature of the problem. These heuristics yield promising outcomes, with deviations from optimal solutions below 20% in scenarios with task overlap and high utilization. In scenarios with minimal overlap and utilization, deviations remain under 10%. However, as variables and constraints increase in ILP, the demand for time and memory resources rises substantially. We conduct a comparative analysis of heuristic performance across various scenarios and large test cases. Additionally, we extend our methods to handle resources in online mode, presenting an extensive comparative study with encouraging results.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 12-14","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2025-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.70111","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

Internet-of-Things-enabled frameworks have eased the development of complex systems, but they throw a significant challenge for efficient resource utilization, thereby improving the system performance. An intelligent scheduler is essential for managing the resources and allocating the same resources to different requests or tasks. This work proposes a generic methodology to optimize system performance metrics such as throughput, utilization, and reward achieved. We present an integer linear programming formulation of the problem to find an optimal solution. We present offline heuristic methods to quickly find reasonable solutions, given the intractable nature of the problem. These heuristics yield promising outcomes, with deviations from optimal solutions below 20% in scenarios with task overlap and high utilization. In scenarios with minimal overlap and utilization, deviations remain under 10%. However, as variables and constraints increase in ILP, the demand for time and memory resources rises substantially. We conduct a comparative analysis of heuristic performance across various scenarios and large test cases. Additionally, we extend our methods to handle resources in online mode, presenting an extensive comparative study with encouraging results.

用于优化不同系统性能指标的统一作业调度器
支持物联网的框架简化了复杂系统的开发,但它们对有效利用资源提出了重大挑战,从而提高了系统性能。智能调度器对于管理资源和将相同的资源分配给不同的请求或任务至关重要。这项工作提出了一种通用的方法来优化系统性能指标,如吞吐量、利用率和实现的奖励。给出了该问题的整数线性规划公式,以求其最优解。鉴于问题的棘手性质,我们提出了离线启发式方法来快速找到合理的解决方案。这些启发式方法产生了有希望的结果,在任务重叠和高利用率的情况下,与最优解决方案的偏差低于20%。在重叠和利用率最小的情况下,偏差保持在10%以下。然而,随着ILP中变量和约束的增加,对时间和内存资源的需求也会大幅增加。我们对各种场景和大型测试用例的启发式性能进行了比较分析。此外,我们将我们的方法扩展到在线模式下的资源处理,进行了广泛的比较研究,并取得了令人鼓舞的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of: Parallel and distributed computing; High-performance computing; Computational and data science; Artificial intelligence and machine learning; Big data applications, algorithms, and systems; Network science; Ontologies and semantics; Security and privacy; Cloud/edge/fog computing; Green computing; and Quantum computing.
×
引用
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学术官方微信