GPU resource dynamic allocation method under multi-task concurrence condition

A dynamic allocation and multi-tasking technology, applied in the computer field, can solve problems such as inability to allocate resources independently, unreasonable resource allocation, and idle resources, etc., and achieve the effects of simple program conversion mode, accelerated multi-tasking processing, and improved use efficiency

Pending Publication Date: 2022-02-15
BEIHANG UNIV
View PDF0 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0009] The main purpose of the present invention is to provide a dynamic allocation method of GPU resources under the multi-task situation, to solve the problem that when the NVIDIA GPU multi-task is concurrent, a large amount of resources are idle due to the static resource allocation method, the system throughput rate decreases, and the resource allocation is unreasonable The problem has three obvious characteristics: (1) Configurability, the native GPU environment cannot independently configure the amount of resources occupied by the program when running, this system proposes a software method, without modifying any hardware and driver details (2) high efficiency, this method considers the affinity of tasks to different types of resources, and executes tasks with complementary resource requirements concurrently to improve the use efficiency of GPU resources , to speed up multitasking; (3) Ease of use, this method provides a simple program conversion mode, and developers only need to use fixed operation steps to migrate native programs to run under this system

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • GPU resource dynamic allocation method under multi-task concurrence condition
  • GPU resource dynamic allocation method under multi-task concurrence condition
  • GPU resource dynamic allocation method under multi-task concurrence condition

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0072] The present invention will be described in further detail below in conjunction with the accompanying drawings.

[0073] Such as figure 1 Shown is a resource configuration data structure diagram when the GPU program is running. The configuration consists of a 32-bit, 4Byte fixed resource limit segment and an indeterminate length running status segment. The first 2 bytes of the fixed resource limit section indicate the maximum number of workers that can run on each SM, and the third and fourth bytes indicate the upper limit and lower limit of the number of SMs that can be used respectively; the first three fields of the running status section store the kernel The Grid dimension, the first field after that "Number of Completed Blocks" records the number of currently completed blocks, and the second field is the total number of blocks that need to be completed for this task; starting from the third field, the saved content is numbered The number of active workers on SMs o...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention provides a GPU resource dynamic allocation method under a multi-task condition, and aims to solve the problems of lots of idle resources, reduced system throughput and unreasonable resource allocation caused by adopting a static resource allocation method during NVIDIA GPU multi-task concurrence. The method has the following three obvious characteristics: (1) configurability: a native GPU environment cannot autonomously configure the amount of occupied resources when a program runs, so that the system provides a software method, and configurability of the amount of used resources when a GPU program runs is achieved under the condition that any hardware and drive details are not modified; (2) effectiveness: the method considers affinity of tasks to different types of resources, concurrently execute the tasks with complementary resource requirements, improves the use efficiency of GPU resources, and accelerates multi-task processing; and (3) usability: the method provides a simple program conversion mode, and a developer can transfer a native program to the system to run only by adopting fixed operation steps.

Description

Technical field: [0001] The invention discloses a method for dynamically allocating GPU resources under multi-task conditions, relates to challenges faced by high-performance computing, and belongs to the technical field of computers. Background technique: [0002] As a device with a large number of computing cores that can provide high-speed parallel computing, GPU has long been used beyond the scope of graphics computing and rendering and is widely used in large-scale parallel computing such as high-performance computing, massive data processing, and artificial intelligence. As an emerging heterogeneous computing platform, many programming frameworks provide support for it, including the CUDA programming model proposed by NVIDIA, and the OpenCL programming language supported by many manufacturers. Although there is an efficient development programming model for GPU devices, the leftover resource allocation strategy adopted by GPU drivers greatly damages the parallelism of ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06F9/50G06F9/48G06F8/71
CPCG06F9/5027G06F9/5016G06F9/4881G06F8/71
Inventor 肖利民常佳辉秦广军朱乃威徐向荣
Owner BEIHANG UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products