Patent ID: 9389912
Filing Date: 2016-07-12
CPC Classification: G06F,H04L

Claim Text:
1. A multi-resource task scheduling method, comprising following steps: classifying a plurality of concurrency packets to distinguish packets with deadline and packets without deadline; ranking the packets with deadline using EDF algorithm and ranking the packets without deadline using SJF algorithm; estimating a virtual start time and a virtual completion time according to ranking results, wherein estimating the virtual start time and the virtual completion time according to the ranking results is implemented by the following equations: where S(p determining whether the packets with deadline can be scheduled successfully according to the virtual start time and the virtual completion time; if the packets with deadline can be scheduled successfully according to the virtual start time and the virtual completion time, determining whether there is a packet without deadline, which can be arranged to be scheduled before the packets with deadline and can shorten average completion time, existing in the packets without deadline, according to the virtual start time and the virtual completion time; and if there is a packet without deadline, which can be arranged to be scheduled before the packets with deadline and can shorten average completion time, existing in the packets without deadline, according to the virtual start time and the virtual completion time, scheduling the packet without deadline, which can be arranged to be scheduled before the packets with deadline and can shorten the average completion time, in advance to shorten the average scheduling time of the plurality of packets.