The Community for Technology Leaders
Green Image
Issue No. 12 - December (2008 vol. 57)
ISSN: 0018-9340
pp: 1690-1703
Jiani Guo , Cisco Systems, San Jose
Jingnan Yao , Cisco Systems, San Jose
Laxmi Narayan Bhuyan , University of California, Riverside, Riverside
ABSTRACT
With the advent of powerful network processors (NPs) in the market, many computation-intensive tasks such as routing table look-up, classification, IPSec, and multimedia transcoding can now be accomplished more easily in a router. An NP consists of a number of on-chip processors to carry out packet level parallel processing operations. Ensuring good load balancing among the processors increases throughput. However, such multiprocessing also gives rise to increased out-of-order departure of processed packets. In this paper, we first propose an Ordered Round Robin (ORR) scheme to schedule packets in a heterogeneous network processor assuming that the workload is perfectly divisible. The processed loads from the processors are ordered perfectly. We analyze the throughput and derive expressions for the batch size, scheduling time and maximum number of schedulable processors. To effectively schedule variable length packets in an NP, we propose a Packetized Ordered Round Robin (P-ORR) scheme by applying a combination of deficit round robin (DRR) and surplus round robin (SRR) schemes. We extend the algorithm to handle multiple flows based on a fair scheduling of flows depending on their reservations. Extensive sensitivity results are provided through analysis and simulation to show that the proposed algorithms satisfy both the load balancing and in-order requirements for parallel packet processing.
INDEX TERMS
Scheduling and task partitioning, Parallel Architectures, Processor Architectures, Computer Systems Organ, Load balancing and task assignment, Multiple Data Stream Architectures (Multiprocessors), multi-processor scheduling
CITATION
Jiani Guo, Jingnan Yao, Laxmi Narayan Bhuyan, "Ordered Round-Robin: An Efficient Sequence Preserving Packet Scheduler", IEEE Transactions on Computers, vol. 57, no. , pp. 1690-1703, December 2008, doi:10.1109/TC.2008.88
95 ms
(Ver 3.1 (10032016))