{"title":"A Unified Job Scheduler for Optimization of Different System Performance Metrics","authors":"Jaishree Mayank, 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.
期刊介绍:
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.