Title: Queuing algorithm for speculative Network Processors

Authors: Jurgen Foag, Thomas Wild

Addresses: Institute of Computer Engineering, University of Lubeck, Lubeck, Germany. ' Institute for Integrated Systems, Technical University of Munich, Munich, Bavaria, Germany

Abstract: This paper presents a queuing algorithm which is tailored for usage in speculative Network Processors (NPs). The queuing system uses Weighted-Fair Queuing queues (WFQ) which are extended by Priority Queues (PQ). While WFQ represents a common implementation in current routers supporting differentiated services, PQs allow to compensate extended protocol processing times due to mispredictions in a speculative system. When applying this concept, the generation of delay-jitter which would limit applicability of speculative packet processing for Real-Time (RT) traffic can be avoided. Utilising the presented queuing system in conjunction with speculative protocol processing in an NP, a latency reduction of up to 14.9% can be achieved compared to systems which support traditional packet processing methodologies.

Keywords: high performance computing; speculative network processors; weighted-fair queuing; WFQ; priority queues; differentiated services; mispredictions; latency reduction.

DOI: 10.1504/IJHPCN.2006.013479

International Journal of High Performance Computing and Networking, 2006 Vol.4 No.5/6, pp.241 - 247

Available online: 01 May 2007 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article