Improvement of Binary Heap Order Algorithm
Liu Feng-ge · Communications technology · 2010
With introduction and analysis of the queue scheduling algorithm in the network quality of service and in view of queue priority, the modifications on the classical binary heap scheduling algorithm are described, a new Heap+ algorithm is proposed. The algorithm, by fully utilizing the fixed operand characteristics of the original algorithm in de-queue and en-queue, could achieve pipelining of de-queue and en-queue operations under the condition of ensuring a low hardware complexity, thus realizing high parallelism. This algorithm, with high resource availability, could be applied on the high-speed data link to the ordering operation of high-precision virtual time.