# The Application of AI Technology in GPU Scheduling Algorithm Optimization

Authors: Zhancai Yan; Yaqiu Liu; Hongrun Shao
Journal: Wireless Communications and Mobile Computing
 (2022)

---

## Abstract

With the rapid development of integrated circuit technology, GPU computing capabilities continue to improve. Due to the continuous improvement and improvement of GPU programming capabilities, functions, and performance, GPUs have been widely used in the field of high-tech general-purpose computers. This article is aimed at studying the optimization of GPU scheduling algorithm based on AI technology. Through a combination of theoretical analysis and simulation experiments, the concepts of artificial intelligence technology and GPU scheduling are explained, and the impact of GPU architecture and GPGPU load on the energy efficiency of GPGPU is explained. On the basis of comprehensive analysis of GPU cluster characteristics, a new GA-TP scheduling algorithm based on genetic algorithm was designed, and based on the energy efficiency of the cluster, a simulation verification platform was built for the accuracy of simulation. Experimental results show that the acceleration rate of the GA-TP algorithm is significantly lower than that of the HEFT algorithm, the average acceleration rate is reduced by nearly 25%, and the scheduling efficiency of the GA-TP algorithm is higher.


---

## Body

## 1. Introduction

Nowadays, more and more artificial intelligence products are listed and integrated into people’s life. In the near future, artificial intelligence technology will have a significant impact on human society and human production and life [1, 2]. Seeing the rapid development of information industry and Internet in the past, most of the credit depends on the rapid development of integrated circuits. The rapid development of integrated circuits has changed our way of life. Among them, the difference of GPU is that it is perfect and occupies a prominent position in the established data center [3, 4].With the emergence of GPU, there are two heterogeneous computing resources in a single system. At present, many researches and applications focus on how to give full play to the computing performance of GPU, but they do not make full use of the computing power of multicore CPU, resulting in a waste of computing power and energy. In addition, GPU technology and multicore CPU technology are developing at a high speed. GPU manufacturers have successively sold GPUs with more stream processors, and CPU manufacturers have also launched processors with more integrated cores. The development of software has further promoted the application of GPU in various fields, such as CUDA, OpenCL, and openacc [5, 6]. Because GPU and CPU are different computing resources, the computing platform of multicore CPU-GPU can only exert its powerful computing power through effective scheduling algorithm. Therefore, it is becoming more and more important to study effective scheduling algorithms and realize load balancing, and these problems are becoming more and more obvious [7].Recently, a new optimization method has attracted more and more researchers’ interest because of its simplicity and efficiency. Jimeno-Morenilla et al. introduced their parallel algorithm based on Jaya GPU and analyzed the parallel performance and optimization performance using the well-known unconstrained function benchmark. The results show that the parallel Jaya implementation achieves significant acceleration for all benchmark functions and achieves up to 190 times acceleration without affecting the optimization performance [8]. Cao et al. proposed an artificial intelligence agent (AI agent) system. AI agents can be deployed at different levels of SDN to realize network service prediction, resource scheduling, and other functions. A new AI agent framework is designed, which uses AI algorithm to replace the traditional service prediction and resource scheduling strategy. At the same time, the related agent deployment scheme is proposed. Finally, a resource scheduling simulation experiment based on AI agent is designed to test the accuracy of network service prediction and the rationality of resource allocation based on this framework [9]. Considering the overall impact of memory bandwidth limitation on GPU performance, the additional performance loss caused by scheduling algorithm can not be ignored when designing scheduling algorithm.In this work, we will study parallel loop programming and propose a new scheduling method, the GA-TP algorithm. This algorithm can be applied to widely used CPU-GPU computing platforms to increase the computing power, load distribution, and programming costs of different computing sources, multicore CPUs, and GPUs. With the increasing demand for computers and the popularity of multicore CPU-GPU platforms, the application of load forecasting and scheduling algorithms plays an important role in improving the utilization of computing sources, reducing power consumption, and accelerating development speed.


## 2. .Research on AI Technology in GPU Scheduling Algorithm Optimization

### 2.1. Artificial Intelligence Technology

Artificial intelligence technology is the ability of computer-based systems to replace human intelligence and physical strength in manufacturing operations and to reduce the weight of the human body [10, 11].In terms of the vision, development, and application of artificial intelligence, its importance includes the following aspects:(1)
Traditional intelligent technology is a technology developed from human intelligence, which is the training and imitation of human intelligence, thinking, and behavior [12](2)
Artificial intelligence technology is a field where computer technology is developing and growing. In addition to the main line of computer science, it also includes science, mathematics, linguistics, government, philosophy, and other fields(3)
The development of technology is very important to the development of society. Artificial intelligence technology has also experienced innovation and optimization from laboratory research to practical application. Artificial intelligence technology has also been deeply applied in different fields such as education, medical treatment, and elderly care servicesAt present, the continuous transmission and exchange of information and knowledge between human beings and artificial intelligence have emerged in the application of artificial intelligence in many different fields. The advantage of artificial intelligence technology is to imitate human thoughts and behaviors and analyze and study based on human characteristics identification, information storage, data analysis, and other technologies. When imitating human experience in specific fields, it is considered that the research is independent. Compared with ordinary people, the application of artificial intelligence technology can make people make more accurate and faster decisions, so as to achieve higher efficiency. When machines work better than humans, people can take artificial intelligence as a simulation object to constantly examine their behavior, expand their competition, and accelerate this new field of science.


### 2.2. GPU Scheduling

Custom scheduling methods can be divided into static scheduling and dynamic scheduling. The static system does not need to compete for sources, so the overall scheduling cost is reduced, but it is more likely to cause uneven load and reduce the amount of computing resources. Create a system with the ability to share resources, instead of operating based on processor load while the system is running. This can increase load balancing, but it also increases load settings.When comparing the computing speed of multicore GPU with that of single core CPU, because the single core CPU processor has only one physical processor, the dual core has two processors, which can go hand in hand when processing data and process at the same time, which increases the data processing bandwidth. Therefore, the computing speed of multicore GPU is much faster than that of single core CPU, and the performance of multithreaded GPU is obviously better than that of single core. When the multicore GPU and CPU are divided into operations with higher computational sensitivity, the time of GPU multicore computing will be much shorter than that of single core CPU, resulting in longer performance of multicore GPU and reduced CPU use. GPU calculation includes data communication time and calculation time between memory and GPU. Only tasks with long computing time and short communication time can make full use of the GPU’s computing power. Therefore, GPU is suitable for computers with high attractiveness and low traffic. If the calculation sensitivity is too low, the communication and startup with the GPU will take too much time, the GPU performance is not fully utilized, and the calculation speed is even slower than the CPU core. Therefore, according to the characteristics of the CPU and GPU architecture, adding high-performance tasks to the GPU and adding small tasks to the CPU can improve the performance and efficiency of the system.A typical GPU system has two parts: server-side code and device-side code. The code on the side device is usually called the kernel GPU. GPU systems always have many kernels. The kernel is a code base running on the GPU, and each kernel is responsible for performing certain tasks. When calling the GPU configuration, the kernel and corresponding input parameters must be passed from the CPU to the GPU. The GPU generates multiple cables to run the same code. The number of threads generated is specified by the user, so the kernel is a typical single-instruction multithreaded program.


### 2.3. GA-TP Algorithm

The working process of the GA-TP algorithm is as follows: First, it is necessary to complete the initialization of the algorithm parameters, create a “matching population” based on the relevant parameters and the initial population, and then enter the iterative algorithm loop. Assemble and then assign the set to the processor most suitable for it, calculate its applicability, modify the genome with a new genetic function, supplement the “matching population” with population information, and finally compare the default limits to determine whether the algorithm continues to be used in loops or output. Figure1 shows the flow of the GA-TP algorithm.Figure 1
GA-TP algorithm flow chart.The GA-TP algorithm uses a crossover operator that includes all genes. After selecting the parents, perform the tasks of AND, OR, and XOR alleles on the two genomes to complete the integration. In order to further improve the connection quality, this crossover operator also improves the choice of parents. When creating the initial population, create a “corresponding population” with fewer people in the population. In a summary of previous generations of evolution, individuals are selected for excellence (where “excellence” is defined by a person’s fitness value). In the “mating” process, one parent comes from the population individual, and the other comes from the “mating population.” After the completion of the “mating” process, the “corresponding population” will be updated immediately after notification, and the applicability of each generation and the “breeding individual” will be compared. If the new one is higher, replace “number.” Otherwise, go to the next population individual and continue the comparison.Therefore, GA-TP algorithm is also a kind of genetic algorithm. It is an optimization calculation model of biological evolution process of genetic mechanism in the past. It is a method to simulate the natural evolution process and search and analyze the optimal solution, which can give an infinitely close to the optimal solution in a reasonable time.


## 2.1. Artificial Intelligence Technology

Artificial intelligence technology is the ability of computer-based systems to replace human intelligence and physical strength in manufacturing operations and to reduce the weight of the human body [10, 11].In terms of the vision, development, and application of artificial intelligence, its importance includes the following aspects:(1)
Traditional intelligent technology is a technology developed from human intelligence, which is the training and imitation of human intelligence, thinking, and behavior [12](2)
Artificial intelligence technology is a field where computer technology is developing and growing. In addition to the main line of computer science, it also includes science, mathematics, linguistics, government, philosophy, and other fields(3)
The development of technology is very important to the development of society. Artificial intelligence technology has also experienced innovation and optimization from laboratory research to practical application. Artificial intelligence technology has also been deeply applied in different fields such as education, medical treatment, and elderly care servicesAt present, the continuous transmission and exchange of information and knowledge between human beings and artificial intelligence have emerged in the application of artificial intelligence in many different fields. The advantage of artificial intelligence technology is to imitate human thoughts and behaviors and analyze and study based on human characteristics identification, information storage, data analysis, and other technologies. When imitating human experience in specific fields, it is considered that the research is independent. Compared with ordinary people, the application of artificial intelligence technology can make people make more accurate and faster decisions, so as to achieve higher efficiency. When machines work better than humans, people can take artificial intelligence as a simulation object to constantly examine their behavior, expand their competition, and accelerate this new field of science.


## 2.2. GPU Scheduling

Custom scheduling methods can be divided into static scheduling and dynamic scheduling. The static system does not need to compete for sources, so the overall scheduling cost is reduced, but it is more likely to cause uneven load and reduce the amount of computing resources. Create a system with the ability to share resources, instead of operating based on processor load while the system is running. This can increase load balancing, but it also increases load settings.When comparing the computing speed of multicore GPU with that of single core CPU, because the single core CPU processor has only one physical processor, the dual core has two processors, which can go hand in hand when processing data and process at the same time, which increases the data processing bandwidth. Therefore, the computing speed of multicore GPU is much faster than that of single core CPU, and the performance of multithreaded GPU is obviously better than that of single core. When the multicore GPU and CPU are divided into operations with higher computational sensitivity, the time of GPU multicore computing will be much shorter than that of single core CPU, resulting in longer performance of multicore GPU and reduced CPU use. GPU calculation includes data communication time and calculation time between memory and GPU. Only tasks with long computing time and short communication time can make full use of the GPU’s computing power. Therefore, GPU is suitable for computers with high attractiveness and low traffic. If the calculation sensitivity is too low, the communication and startup with the GPU will take too much time, the GPU performance is not fully utilized, and the calculation speed is even slower than the CPU core. Therefore, according to the characteristics of the CPU and GPU architecture, adding high-performance tasks to the GPU and adding small tasks to the CPU can improve the performance and efficiency of the system.A typical GPU system has two parts: server-side code and device-side code. The code on the side device is usually called the kernel GPU. GPU systems always have many kernels. The kernel is a code base running on the GPU, and each kernel is responsible for performing certain tasks. When calling the GPU configuration, the kernel and corresponding input parameters must be passed from the CPU to the GPU. The GPU generates multiple cables to run the same code. The number of threads generated is specified by the user, so the kernel is a typical single-instruction multithreaded program.


## 2.3. GA-TP Algorithm

The working process of the GA-TP algorithm is as follows: First, it is necessary to complete the initialization of the algorithm parameters, create a “matching population” based on the relevant parameters and the initial population, and then enter the iterative algorithm loop. Assemble and then assign the set to the processor most suitable for it, calculate its applicability, modify the genome with a new genetic function, supplement the “matching population” with population information, and finally compare the default limits to determine whether the algorithm continues to be used in loops or output. Figure1 shows the flow of the GA-TP algorithm.Figure 1
GA-TP algorithm flow chart.The GA-TP algorithm uses a crossover operator that includes all genes. After selecting the parents, perform the tasks of AND, OR, and XOR alleles on the two genomes to complete the integration. In order to further improve the connection quality, this crossover operator also improves the choice of parents. When creating the initial population, create a “corresponding population” with fewer people in the population. In a summary of previous generations of evolution, individuals are selected for excellence (where “excellence” is defined by a person’s fitness value). In the “mating” process, one parent comes from the population individual, and the other comes from the “mating population.” After the completion of the “mating” process, the “corresponding population” will be updated immediately after notification, and the applicability of each generation and the “breeding individual” will be compared. If the new one is higher, replace “number.” Otherwise, go to the next population individual and continue the comparison.Therefore, GA-TP algorithm is also a kind of genetic algorithm. It is an optimization calculation model of biological evolution process of genetic mechanism in the past. It is a method to simulate the natural evolution process and search and analyze the optimal solution, which can give an infinitely close to the optimal solution in a reasonable time.


## 3. Investigation and Research of AI Technology in GPU Scheduling Algorithm Optimization

### 3.1. Experimental Environment

This article uses the GPGPU-Sim simulator to implement and verify the GA-TP programming algorithm. This is a widely used GPGPU simulator with cycle-level accuracy. It can configure configuration files to simulate various popular GPUs and independently designed GPU architectures. GPGPU-Sim can perform CUDA and OpenCL reference tests for simulation testing. The simulation parameters are shown in Table1.Table 1
Simulation parameters.
GPU parametersSet valueSM parameterSet valueCore frequency1216 MHzRegister size256 kBMemory frequency7 GHzShared memory size96 kBSM quantity16Thread limit2048Number of memory controllers4 TBQuantity limit32


### 3.2. Data Preprocessing

#### 3.2.1. Algorithm Speedup

Algorithm acceleration is another important parameter for evaluating the performance of scheduling algorithms. All tasks in the DAG job graph are assigned to the processor with the shortest calculation time for the secondary job. This runtime is called the serial runtime load. Algorithm acceleration refers to the ratio of the charging time of parallel execution of DAG tasks to the loading time of serial execution. The calculation formula of the acceleration algorithm is shown as follows:(1)AS=AMSminpj∈P∑Ti∈TwTi,pj.In the formula, AMS is the task scheduling length of the algorithm,P is the processor set, and T is the task set of the DAG graph.


#### 3.2.2. Than Scheduling Length

In different application scenarios, the characteristics of DAG graphs for different computing tasks may be slightly different. Due to these differences, the experimental results of the algorithm scheduling length may have different metric scales to avoid experimental errors of different metric scales. This experiment introduces a ratio scheduling length (SLR) parameter to quantify the scheduling length and the definition of SLR as shown as follows:(2)SLR=AMS∑Ti∈CPminminpj∈wi,j.In the formula,wi and j represent the execution time of the task Ti on the processor pj, and the denominator represents the sum of the minimum computational overhead of all tasks on the critical path.


#### 3.2.3. Calculate the Toll Ratio

For a specific task graph, the calculation ratio refers to the ratio of the average cost calculated during the execution of the task to the average cost of communication between tasks, defined as follows:(3)CECER=1/t∑Ti∈Twi1/e∑edgeTi,Tj∈ECi,j.In the formula,T is the set of all tasks in the task graph, t is the number of tasks included in the task set T, wi is the calculation cost of the task, and E is the set of edges between all task nodes in the task graph.


## 3.1. Experimental Environment

This article uses the GPGPU-Sim simulator to implement and verify the GA-TP programming algorithm. This is a widely used GPGPU simulator with cycle-level accuracy. It can configure configuration files to simulate various popular GPUs and independently designed GPU architectures. GPGPU-Sim can perform CUDA and OpenCL reference tests for simulation testing. The simulation parameters are shown in Table1.Table 1
Simulation parameters.
GPU parametersSet valueSM parameterSet valueCore frequency1216 MHzRegister size256 kBMemory frequency7 GHzShared memory size96 kBSM quantity16Thread limit2048Number of memory controllers4 TBQuantity limit32


## 3.2. Data Preprocessing

### 3.2.1. Algorithm Speedup

Algorithm acceleration is another important parameter for evaluating the performance of scheduling algorithms. All tasks in the DAG job graph are assigned to the processor with the shortest calculation time for the secondary job. This runtime is called the serial runtime load. Algorithm acceleration refers to the ratio of the charging time of parallel execution of DAG tasks to the loading time of serial execution. The calculation formula of the acceleration algorithm is shown as follows:(1)AS=AMSminpj∈P∑Ti∈TwTi,pj.In the formula, AMS is the task scheduling length of the algorithm,P is the processor set, and T is the task set of the DAG graph.


### 3.2.2. Than Scheduling Length

In different application scenarios, the characteristics of DAG graphs for different computing tasks may be slightly different. Due to these differences, the experimental results of the algorithm scheduling length may have different metric scales to avoid experimental errors of different metric scales. This experiment introduces a ratio scheduling length (SLR) parameter to quantify the scheduling length and the definition of SLR as shown as follows:(2)SLR=AMS∑Ti∈CPminminpj∈wi,j.In the formula,wi and j represent the execution time of the task Ti on the processor pj, and the denominator represents the sum of the minimum computational overhead of all tasks on the critical path.


### 3.2.3. Calculate the Toll Ratio

For a specific task graph, the calculation ratio refers to the ratio of the average cost calculated during the execution of the task to the average cost of communication between tasks, defined as follows:(3)CECER=1/t∑Ti∈Twi1/e∑edgeTi,Tj∈ECi,j.In the formula,T is the set of all tasks in the task graph, t is the number of tasks included in the task set T, wi is the calculation cost of the task, and E is the set of edges between all task nodes in the task graph.


## 3.2.1. Algorithm Speedup

Algorithm acceleration is another important parameter for evaluating the performance of scheduling algorithms. All tasks in the DAG job graph are assigned to the processor with the shortest calculation time for the secondary job. This runtime is called the serial runtime load. Algorithm acceleration refers to the ratio of the charging time of parallel execution of DAG tasks to the loading time of serial execution. The calculation formula of the acceleration algorithm is shown as follows:(1)AS=AMSminpj∈P∑Ti∈TwTi,pj.In the formula, AMS is the task scheduling length of the algorithm,P is the processor set, and T is the task set of the DAG graph.


## 3.2.2. Than Scheduling Length

In different application scenarios, the characteristics of DAG graphs for different computing tasks may be slightly different. Due to these differences, the experimental results of the algorithm scheduling length may have different metric scales to avoid experimental errors of different metric scales. This experiment introduces a ratio scheduling length (SLR) parameter to quantify the scheduling length and the definition of SLR as shown as follows:(2)SLR=AMS∑Ti∈CPminminpj∈wi,j.In the formula,wi and j represent the execution time of the task Ti on the processor pj, and the denominator represents the sum of the minimum computational overhead of all tasks on the critical path.


## 3.2.3. Calculate the Toll Ratio

For a specific task graph, the calculation ratio refers to the ratio of the average cost calculated during the execution of the task to the average cost of communication between tasks, defined as follows:(3)CECER=1/t∑Ti∈Twi1/e∑edgeTi,Tj∈ECi,j.In the formula,T is the set of all tasks in the task graph, t is the number of tasks included in the task set T, wi is the calculation cost of the task, and E is the set of edges between all task nodes in the task graph.


## 4. Investigation and Research Analysis of AI Technology in GPU Scheduling Algorithm Optimization

### 4.1. The Simulator Extracts the Overall Performance Data Analysis of the GPU

The performance of the simulation architecture is highly related to the actual hardware. When GPGPU-Sim version 3.1.0 simulates the NVIDIA Fermi architecture, the simulation accuracy rate reaches 97.35%. When simulating the NVIDIA GT200 architecture, the simulation accuracy rate reached 98.37%. The GPU performance simulated by GPGPU-Sim has been strictly confirmed to be the same as the actual GPU hardware.Figure2 shows the execution path of the CUDA application on the GPU hardware and the GPGPU-Sim simulator.Figure 2
CUDA application execution path.In a normal GPU, when the CUDA application is running, the host code is executed on the CPU, and the device code calls the API from the CUDA runtime library, and then, the CUDA runtime library sends a request to the GPU to run the code. There is a function library similar to the CUDA runtime library in GPGPU-Sim. When the CUDA program calls the API, the operating system will call the corresponding API from the GPGPU-Sim function library, and the function library will send the request to the GPGPU-Sim simulator to execute the device code in the simulator.In the performance simulation mode, the GPGPU-Sim simulator extracts a lot of useful data to help us better understand the results of running the application. Some important output data are shown in Table2. Gpu_tot_ipc describes the number of commands per application cycle. This parameter is generally used to measure the overall performance of the GPU. GPGPU-Sim can also generate performance data for various components, such as cache, memory, and network interfaces.Table 2
Simulator output data.
Output dataDescribeGpu_sim_cycleThe running cycle of the current kernelgpu_sim_nsnThe number of running instructions in the current kernelgpu_tot_sim_cyleTotal running cycle of current kernelgpu_tot_ipcNumber of instructions per cycle for all kernels


### 4.2. GA-TP and HEFT Scheduling Algorithm Comparison

In order to avoid errors caused by human factors such as measurement errors, the laboratory uses 10 guided acyclic graphs, and each graph is checked 3 times. All basic parameter values are the average of 3 experiments used. In order to see the improved results of the GA-TP algorithm proposed in this article more clearly, this experiment compares the GA-TP algorithm with the HEFT algorithm. The results are shown in Table3.Table 3
Mean value of key parameters GA-TP and heft.
Scheduling lengthAcceleration ratioGA-TP109.50.598HEFT148.70.789Figure3 shows the comparison diagram of the scheduling length algorithms of GA-TP and HEFT. Through the comparison results of the scheduling length of the two algorithms, it is obvious that the scheduling length of GA-TP algorithm is significantly lower than that of HEFT algorithm at different experimental values. The results show that the scheduling length of GA-TP algorithm is significantly shortened.Figure 3
Comparison of algorithm scheduling length.The GA-TP algorithm developed at this time is much smaller than the HEFT algorithm in the vertical programming algorithm, and the vertical programming algorithm is reduced by more than 15% on average, as shown in Figure3. This part of the performance improvement mainly comes from the workload technology. By paying attention to the adjacent work sections in the work screen, the sensitivity of work is improved, the number of work sections is reduced, and the communication cost between tasks is reduced. For the horizontal axis transmission rate, the lower the transmission rate, that is, the more frequent the interaction between functional components and the higher the communication cost, the more obvious the advantages of the GA-TP algorithm, as shown in Figure 4.Figure 4
Comparison of SLR parameters of algorithm.For a given DAG model, when all functions are serial, the time cost is constant; that is, the coefficient is constant, and the acceleration corresponds to the programming length of the molecular algorithm; that is, the result and the acceleration schedule of the algorithm are negatively correlated with the coefficient (0.1), because approximate acceleration of 1 will lengthen the scheduling algorithm, and the result of the scheduling algorithm will be worse. The speed-up ratio of GA-TP algorithm is significantly lower than that of HEFT algorithm, and the average speed-up ratio has dropped by about 25%, indicating that the processing effect of GA-TP algorithm is better, as shown in Figure5. At the horizontal level, the lower the calculation rate, that is, the higher the communication load between functional components, the better the programming effect of the GA-TP algorithm.Figure 5
Algorithm speedup comparison.In short, the GA-TP algorithm is more suitable for computing tasks with frequent communication between auxiliary nodes. In addition, it needs to be noted that the fluctuation of the three basic parameter values with the calculation ratio of the horizontal axis does not matter, because the 10 points on the curve correspond to 10 DAG diagrams and the horizontal comparison of the calculation amount and the communication amount of each DAG diagram are meaningless.


## 4.1. The Simulator Extracts the Overall Performance Data Analysis of the GPU

The performance of the simulation architecture is highly related to the actual hardware. When GPGPU-Sim version 3.1.0 simulates the NVIDIA Fermi architecture, the simulation accuracy rate reaches 97.35%. When simulating the NVIDIA GT200 architecture, the simulation accuracy rate reached 98.37%. The GPU performance simulated by GPGPU-Sim has been strictly confirmed to be the same as the actual GPU hardware.Figure2 shows the execution path of the CUDA application on the GPU hardware and the GPGPU-Sim simulator.Figure 2
CUDA application execution path.In a normal GPU, when the CUDA application is running, the host code is executed on the CPU, and the device code calls the API from the CUDA runtime library, and then, the CUDA runtime library sends a request to the GPU to run the code. There is a function library similar to the CUDA runtime library in GPGPU-Sim. When the CUDA program calls the API, the operating system will call the corresponding API from the GPGPU-Sim function library, and the function library will send the request to the GPGPU-Sim simulator to execute the device code in the simulator.In the performance simulation mode, the GPGPU-Sim simulator extracts a lot of useful data to help us better understand the results of running the application. Some important output data are shown in Table2. Gpu_tot_ipc describes the number of commands per application cycle. This parameter is generally used to measure the overall performance of the GPU. GPGPU-Sim can also generate performance data for various components, such as cache, memory, and network interfaces.Table 2
Simulator output data.
Output dataDescribeGpu_sim_cycleThe running cycle of the current kernelgpu_sim_nsnThe number of running instructions in the current kernelgpu_tot_sim_cyleTotal running cycle of current kernelgpu_tot_ipcNumber of instructions per cycle for all kernels


## 4.2. GA-TP and HEFT Scheduling Algorithm Comparison

In order to avoid errors caused by human factors such as measurement errors, the laboratory uses 10 guided acyclic graphs, and each graph is checked 3 times. All basic parameter values are the average of 3 experiments used. In order to see the improved results of the GA-TP algorithm proposed in this article more clearly, this experiment compares the GA-TP algorithm with the HEFT algorithm. The results are shown in Table3.Table 3
Mean value of key parameters GA-TP and heft.
Scheduling lengthAcceleration ratioGA-TP109.50.598HEFT148.70.789Figure3 shows the comparison diagram of the scheduling length algorithms of GA-TP and HEFT. Through the comparison results of the scheduling length of the two algorithms, it is obvious that the scheduling length of GA-TP algorithm is significantly lower than that of HEFT algorithm at different experimental values. The results show that the scheduling length of GA-TP algorithm is significantly shortened.Figure 3
Comparison of algorithm scheduling length.The GA-TP algorithm developed at this time is much smaller than the HEFT algorithm in the vertical programming algorithm, and the vertical programming algorithm is reduced by more than 15% on average, as shown in Figure3. This part of the performance improvement mainly comes from the workload technology. By paying attention to the adjacent work sections in the work screen, the sensitivity of work is improved, the number of work sections is reduced, and the communication cost between tasks is reduced. For the horizontal axis transmission rate, the lower the transmission rate, that is, the more frequent the interaction between functional components and the higher the communication cost, the more obvious the advantages of the GA-TP algorithm, as shown in Figure 4.Figure 4
Comparison of SLR parameters of algorithm.For a given DAG model, when all functions are serial, the time cost is constant; that is, the coefficient is constant, and the acceleration corresponds to the programming length of the molecular algorithm; that is, the result and the acceleration schedule of the algorithm are negatively correlated with the coefficient (0.1), because approximate acceleration of 1 will lengthen the scheduling algorithm, and the result of the scheduling algorithm will be worse. The speed-up ratio of GA-TP algorithm is significantly lower than that of HEFT algorithm, and the average speed-up ratio has dropped by about 25%, indicating that the processing effect of GA-TP algorithm is better, as shown in Figure5. At the horizontal level, the lower the calculation rate, that is, the higher the communication load between functional components, the better the programming effect of the GA-TP algorithm.Figure 5
Algorithm speedup comparison.In short, the GA-TP algorithm is more suitable for computing tasks with frequent communication between auxiliary nodes. In addition, it needs to be noted that the fluctuation of the three basic parameter values with the calculation ratio of the horizontal axis does not matter, because the 10 points on the curve correspond to 10 DAG diagrams and the horizontal comparison of the calculation amount and the communication amount of each DAG diagram are meaningless.


## 5. Conclusions

Artificial intelligence technology saves people’s intellectual and physical consumption to a certain extent, improves industrial productivity, and improves human daily life. It can be said that it has made a huge contribution to the rapid development of society, and this trend will gradually strengthen over time. With the increase in the number of Internet users, the rapid expansion of data, and the introduction of new applications, different data centers are facing the challenge of improving resource utilization and providing distribution services. Therefore, the computing power of GPU has also been continuously improved under the artificial intelligence technology. Through the continuous improvement and improvement of the functional characteristics of GPU, it has been widely used in the field of intelligent computer. In order to make full use of the full range of GPU resources, this paper proposes an effective resource distribution and workflow planning framework for robust service delivery scenarios under multitask GPU distribution. Finally, the GA-TP algorithm and the HEFT algorithm are compared through the basic parameters of AMS, AS, SLR, and CECER. The result shows that the programming time of the new GA-TP programming algorithm is reduced by more than 20%.



---

*Source: 4713698-2022-05-12.xml*