Multi-thread Scheduling for the Network Processor


The KIPS Transactions:PartC, Vol. 11, No. 3, pp. 337-344, Jun. 2004
10.3745/KIPSTC.2004.11.3.337,   PDF Download:

Abstract

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.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
K. B. Yim, J. K. Park, G. H. Jung, K. H. Choi, "Multi-thread Scheduling for the Network Processor," The KIPS Transactions:PartC, vol. 11, no. 3, pp. 337-344, 2004. DOI: 10.3745/KIPSTC.2004.11.3.337.

[ACM Style]
Kang Bin Yim, Jun Ku Park, Gi Hyun Jung, and Kyung Hee Choi. 2004. Multi-thread Scheduling for the Network Processor. The KIPS Transactions:PartC, 11, 3, (2004), 337-344. DOI: 10.3745/KIPSTC.2004.11.3.337.