A method and device for load migration
A technology of load migration and equipment, applied in the direction of network traffic/resource management, electrical components, wireless communication, etc., can solve problems such as reduced work performance
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0066] Such as figure 1 As shown in FIG. 1 , it is a schematic flowchart of a method for load migration provided by Embodiment 1 of the present invention. The method can be described as follows.
[0067] Step 101: Receive migration request information sent by a target processor.
[0068] The migration request information is used to represent the task to be processed that needs to be migrated from the source processor.
[0069] In step 101, since the current SMP environment includes multiple CPUs (Central Processing Units, central processing units), each CPU has its own scheduling domain. The Linux system searches the scheduling domain in the busiest state from the CPU scheduling domain level by level, and finds out the busiest CPU and the Run Queue corresponding to the CPU from the scheduling domain in the busiest state. The busiest CPU is used as the source processor, and some tasks need to be migrated to ensure the balance of the system's internal load. Find the least bu...
Embodiment 2
[0097] Embodiment 2 is a detailed description of each step in Embodiment 1 of the present invention.
[0098] Suppose there are N CPUs in the system, numbered as CPU 0 ,CPU 1 ,...,CPU n-1 , abbreviated as P 0 ,P 1 ,...,P n-1 ; There are N×(N-1) lock-free circular linked lists L, and L (lock-free) adopts the data structure of Ring Buffer, where there is a lock-free circular linked list between any two CPUs, for example: P i and P j The lock-free circular linked list between
[0099] Among them, each lock-free circular linked list Consists of two parts: a head pointer and tail pointer, if It means that the linked list is empty, if It means the linked list is full.
[0100] Wherein, the descriptor address of the task to be migrated is stored in the lock-free circular linked list L.
[0101] When processor P i There are tasks that need to be migrated to processor P j on, processor P i and processor P j Perform load migration corresponding to lock-free circu...
Embodiment 3
[0115] Such as figure 2 As shown, it is a schematic flowchart of a load migration method provided by Embodiment 3 of the present invention. Embodiment 3 of the present invention is an invention under the same inventive concept as Embodiment 1 to Embodiment 2 of the present invention. The method Can be as described below.
[0116] Step 201: Send migration request information to the source processor.
[0117] The migration request information is used to represent the task to be processed that needs to be migrated from the source processor.
[0118] Step 202: Obtain the descriptor address information of the task to be migrated from the intermediate table.
[0119] Wherein, the intermediate table is used by the source processor to place The source processor is determined by the rules of the task's descriptor address information.
[0120] In step 202, the intermediate table is a circular linked list, wherein the circular linked list includes first pointer information and tail ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


