Title :
A trace driven study of packet level parallelism
Author_Institution :
Dept. of Electr. Eng., Stanford Univ., CA, USA
Abstract :
Network processors promise greater flexibility and programmability for routers and switches. They typically process incoming traffic on a packet-by-packet basis. Except for the ordering constraint for packets within the same flow, most packets are independent of each other. Thus, several level of parallelism exists: packet level parallelism (PLP), intra-packet parallelism (IPP), and instruction level parallelism (ILP). Most commercial network processor implementations exploit only PLP. In this paper, we quantify how much PLP really exists. Our results show that blindly adding more processing engines to exploit PLP quickly degrades the utilization ratio. It suggests that IPP and ILP should also be exploited. Furthermore, we show that adding an input reordering buffer is a very effective technique to increase the utilization ratio.
Keywords :
Internet; buffer storage; packet switching; parallel processing; telecommunication network routing; telecommunication traffic; ILP; IPP; Internet routers; PLP; incoming traffic; input reordering buffer; instruction level parallelism; intra-packet parallelism; network processors; packet level parallelism; processing engines; programmability; routers; switches; utilization ratio; Algorithm design and analysis; Application specific integrated circuits; Bandwidth; Hardware; Internet; Microprocessors; Parallel processing; Protocols; Telecommunication traffic; Traffic control;
Conference_Titel :
Communications, 2002. ICC 2002. IEEE International Conference on
Print_ISBN :
0-7803-7400-2
DOI :
10.1109/ICC.2002.997235