4 results about "Fair queuing" patented technology

The invention discloses a channel scheduling and bandwidth allocation method, system and device for cloud desktop communication, and the method comprises the steps: obtaining a data frame set, allocating a corresponding priority identifier according to a channel type to which each data frame belongs, and embedding the priority identifier of each data frame into a special field of a frame structure; the data frames are inserted into the corresponding sending queues according to the priority identifiers, each priority corresponds to one sending queue, the data frames are extracted from all the sending queues in sequence according to a preset scheduling strategy to be sent, and the preset scheduling strategy at least supports a priority preemptive mode or a weighted fair queuing mode; and collecting network state parameters in real time, and dynamically adjusting the bandwidth quota of the channel corresponding to each data frame through a feedback closed-loop mechanism based on the network state parameters. According to the invention, the rapid transmission of high-priority data frames is ensured, and the delay of real-time interaction is reduced; resources are flexibly allocated according to the network state, and the bandwidth utilization rate is improved.

The present application relates to GPU task scheduling technical field, especially to a kind of GPU dynamic task efficient scheduling method for quantum-resistant cryptography operation, the method when when scheduler receives new task request, construct execution length correction factor, to the baseline prediction length of new task request is dynamically corrected, obtain target execution length, and target execution length is applied to the weighted fair queuing of cross queue;Batch scheduling adaptive factor is constructed, if any queue in weighted fair queuing is selected to enter task launch, the deficit counter quota of any queue is adjusted using batch scheduling adaptive factor, obtain target deficit counter quota;The target execution length of each task in any queue is compared with target deficit counter quota, according to the comparison result carries out task scheduling, so that scheduler is simultaneously optimized on two levels of cross queue selection and queue internal rotation, to realize the efficient use of graphics processor resource.

The invention relates to the technical field of GPU task scheduling, in particular to a GPU dynamic task efficient scheduling method for resisting quantum cryptography operation, which comprises the following steps: when a scheduler receives a new task request, constructing an execution length correction factor to dynamically correct a baseline prediction length of the new task request to obtain a target execution length; the target execution length is applied to cross-queue weighted fair queuing; constructing a batch scheduling adaptive factor, and if any queue in the weighted fair queues is selected to enter task emission, adjusting the deficit counter quota of any queue by using the batch scheduling adaptive factor to obtain a target deficit counter quota; and comparing the target execution length of each task in any queue with the target deficit counter quota, and performing task scheduling according to a comparison result, so that a scheduler is optimized at the same time on two levels of cross-queue selection and queue internal rotation, thereby realizing efficient utilization of graphics processor resources.

The present disclosure relates generally to time-deterministic packet forwarding technology, and more particularly, to an apparatus and method for time-deterministic packet forwarding using a non-work-conserving stateless core fair queuing method in a network. The method includes comparing the reception time of the packet with the finish time of the previous packet when receiving the packet, setting the larger value as the eligible time of the packet, and calculating the finish time of the packet by adding the value obtained by dividing the packet size by the set transmission rate to the eligible time. The method includes arranging packets with an earlier eligible time in a first priority queue in order of their earliest eligible time and restricting an output of the packets before the eligible time in a non-work-conserving manner, arranging packets whose eligible time has passed in a second priority queue in order of their earliest finish time, and outputting the packet in a work-conserving manner when there is no other packet to be served in the second priority