Resource scheduling method and server based on idle time point

A server, comprising a scheduling component in user mode, a schedule-class function in kernel mode, a plurality of virtual network element and a plurality of computational resources;

• wherein the server further comprises a processor and a memory, the memory stores executable instructions which, when executed by the processor, cause the process to perform operations of:
• acquiring, at target scheduling time, a latest idle time point corresponding to respective virtual network element of the plurality of virtual network elements, wherein an idle time point corresponds to a time point at which no load task is polled by a worker thread in the virtual network element, and the latest idle time point is an idle time point from idle time points corresponding to the virtual network element which is closest to the target scheduling time, wherein the target scheduling time is a start time of a current scheduling period, and wherein the scheduling period is determined based on a degree of sensitivity of the virtual network elements to a latency;
• determining load status of the plurality of virtual network elements based on time differences between the target scheduling time and the latest idle time point corresponding to respective virtual network element of the plurality of virtual network elements;
• determining computational resource scheduling information of the plurality of virtual network elements based on the load status of the plurality of virtual network elements;
• sending the computational resource scheduling information to a kernel of the server;
• and
• performing, through the schedule-class function in the kernel mode, resource scheduling processing corresponding to the computational resource scheduling information.

A resource scheduling method implemented by a scheduling component in user mode, wherein the scheduling component is configured in a server comprising a plurality of virtual base stations, and the plurality of virtual base stations comprises a plurality of distributed units;

• the method comprises:
• acquiring, at target scheduling time, a latest idle time point corresponding to respective distributed unit of the plurality of distributed units, wherein an idle time point corresponds to a time point at which no load task is polled by a worker thread in the distributed unit, and the latest idle time point is an idle time point from idle time points corresponding to the virtual network element which is closest to the target scheduling time, wherein the target scheduling time is a start time of a current scheduling period, and wherein the scheduling period is determined based on a degree of sensitivity of the virtual network elements to a latency;
• determining load status of the plurality of distributed units based on time differences between the target scheduling time and the latest idle time point corresponding to respective distributed unit of the plurality of distributed units;
• determining computational resource scheduling information of the plurality of distributed units based on the load status of the plurality of distributed units;
• sending the computational resource scheduling information to a kernel of the server;
• and
• performing, through a schedule-class function in kernel mode, resource scheduling processing corresponding to the computational resource scheduling information.

A resource scheduling method implemented by a scheduling component in user mode, wherein the scheduling component is configured in a server comprising a plurality of virtual base stations, and the plurality of virtual base stations comprise a plurality of distributed units;

• the method comprises:
• based on a correspondence between vehicle terminals and the virtual base stations, storing driving data processing tasks triggered by the vehicle terminals into task queues corresponding to distributed units of corresponding virtual base stations;
• acquiring, at target scheduling time, a latest idle time point corresponding to respective distributed unit of the plurality of distributed units, wherein an idle time point corresponds to a time point at which no driving data processing task is polled by a worker thread in the distributed unit from a corresponding task queue, and the latest idle time point is an idle time point from idle time points corresponding to the virtual network element which is closest to the target scheduling time, wherein the target scheduling time is a start time of a current scheduling period, and wherein the scheduling period is determined based on a degree of sensitivity of the virtual network elements to a latency;
• determining load status of the plurality of distributed units based on time differences between the target scheduling time and the latest idle time point corresponding to respective distributed unit of the plurality of distributed units;
• determining computational resource scheduling information of the multiple distributed units based on the load status of the multiple distributed units;
• sending the computational resource scheduling information to a kernel of the server;
• and
• performing, through a schedule-class function in kernel mode, resource scheduling processing corresponding to the computational resource scheduling information, so that the plurality of distributed units process, based on computational resources after the resource scheduling processing, the received driving data processing tasks.