Multi-thread Scheduling for the Network Processor

In this paper, we propose a thread scheduling algorithm for faster packet processing on the network processors with multithreaded multiprocessor architecture. To implement the proposed algorithm. we derived several basic parameters related to the thread scheduling and included a new parameter representing the packet contents and the multithreaded architecture. Through the empirical study using a simulator, we proved the proposed scheduling algorithm provides better throughput and load balancing compared to the general thread scheduling algorithm.

[1]  Sanjoy K. Baruah,et al.  Fast scheduling of periodic tasks on multiple resources , 1995, Proceedings of 9th International Parallel Processing Symposium.

[2]  L.M. Ni,et al.  Trapezoid Self-Scheduling: A Practical Scheduling Scheme for Parallel Compilers , 1993, IEEE Trans. Parallel Distributed Syst..

[3]  Y. S. Cheung,et al.  Multithreaded self-scheduling: application of multithreading on loop scheduling for distributed shared memory multiprocessor , 1995, Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing.

[4]  Hermann de Meer,et al.  A survey of programmable networks , 1999, CCRV.

[5]  George Varghese,et al.  Fast and scalable layer four switching , 1998, SIGCOMM '98.

[6]  David J. Lilja Exploiting the parallelism available in loops , 1994, Computer.

[7]  Gerhard Fettweis,et al.  A new network processor architecture for high-speed communications , 1999, 1999 IEEE Workshop on Signal Processing Systems. SiPS 99. Design and Implementation (Cat. No.99TH8461).