Skip to Main Content
In this paper, two different architectures of the iSLIP scheduling algorithm are implemented by hardware, and the delay limitation of this algorithm is indicated by comparing their performances. Then a matrix model is proposed for analyzing the reason of delay limitation, and the conclusion is that the pointer conflict causes the large area and delay in essence. Finally, the non-conflict RR scheduling algorithm is proposed for resolving this pointer conflict problem. The hardware implementation result shows that the performance of this algorithm is much better than iSLIP algorithm.