AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (502.3 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Article | Open Access

Adaptive Resource Planning for AI Workloads with Variable Real-Time Tasks

Sunhwa Annie Nam1Kyungwoon Cho2Hyokyung Bahn3( )
Department of Computer Science and Engineering, Ewha University, Seoul, 03760, Korea
Embedded Software Research Center, Ewha University, Seoul, 03760, Korea
Department of Computer Science and Engineering, Ewha University, Seoul, 03760, Korea
Show Author Information

Abstract

AI (Artificial Intelligence) workloads are proliferating in modern real-time systems. As the tasks of AI workloads fluctuate over time, resource planning policies used for traditional fixed real-time tasks should be re-examined. In particular, it is difficult to immediately handle changes in real-time tasks without violating the deadline constraints. To cope with this situation, this paper analyzes the task situations of AI workloads and finds the following two observations. First, resource planning for AI workloads is a complicated search problem that requires much time for optimization. Second, although the task set of an AI workload may change over time, the possible combinations of the task sets are known in advance. Based on these observations, this paper proposes a new resource planning scheme for AI workloads that supports the re-planning of resources. Instead of generating resource plans on the fly, the proposed scheme pre-determines resource plans for various combinations of tasks. Thus, in any case, the workload is immediately executed according to the resource plan maintained. Specifically, the proposed scheme maintains an optimized CPU (Central Processing Unit) and memory resource plan using genetic algorithms and applies it as soon as the workload changes. The proposed scheme is implemented in the open-source simulator SimRTS for the validation of its effectiveness. Simulation experiments show that the proposed scheme reduces the energy consumption of CPU and memory by 45.5% on average without deadline misses.

References

【1】
【1】
 
 
Computers, Materials & Continua
Pages 6823-6833

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Nam SA, Cho K, Bahn H. Adaptive Resource Planning for AI Workloads with Variable Real-Time Tasks. Computers, Materials & Continua, 2023, 74(3): 6823-6833. https://doi.org/10.32604/cmc.2023.035481

126

Views

4

Downloads

2

Crossref

4

Web of Science

5

Scopus

Received: 23 August 2022
Accepted: 04 November 2022
Published: 31 March 2023
© The Author 2024.

This work is licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.