Characterizing processor architectures for programmable network interfaces

The rapid advancements of networking technology have boosted potential bandwidth to the point that the cabling is no longer the bottleneck. Rather, the bottlenecks lie at the crossing points, the nodes of the network, where data traffic is intercepted or forwarded. As a result, there has been tremendous interest in speeding those nodes, making the equipment run faster by means of specialized chips to handle data trafficking. The Network Processor is the blanket name thrown over such chips in their varied forms. To date, no performance data exist to aid in the decision of what processor architecture to use in next generation network processor. Our goal is to remedy this situation. In this study, we characterize both the application workloads that network processors need to support as well as emerging applications that we anticipate may be supported in the future. Then, we consider the performance of three sample benchmarks drawn from these workloads on several state-of-the-art processor architectures, including: an aggressive, out-of-order, speculative super-scalar processor, a fine-grained multithreaded processor, a single chip multiprocessor, and a simultaneous multithreaded processor (SMT). The network interface environment is simulated in detail, and our results indicate that SMT is the architecture best suited to this environment.

[1]  John Zahorjan,et al.  Chores: enhanced run-time support for shared-memory parallel computing , 1993, TOCS.

[2]  Larry L. Peterson,et al.  PathFinder: A Pattern-Based Packet Classifier , 1994, OSDI.

[3]  Brian N. Bershad,et al.  Extensibility safety and performance in the SPIN operating system , 1995, SOSP.

[4]  Charles L. Seitz,et al.  Myrinet: A Gigabit-per-Second Local Area Network , 1995, IEEE Micro.

[5]  Dean M. Tullsen,et al.  Simultaneous multithreading: Maximizing on-chip parallelism , 1995, Proceedings 22nd Annual International Symposium on Computer Architecture.

[6]  Eric A. Brewer,et al.  Adapting to network and client variability via on-demand dynamic distillation , 1996, ASPLOS VII.

[7]  Kunle Olukotun,et al.  Evaluation of Design Alternatives for a Multiprocessor Microprocessor , 1996, ISCA.

[8]  M. Kaashoek,et al.  DPF: fast, flexible message demultiplexing using dynamic code generation , 1996, SIGCOMM '96.

[9]  Adapting to Network and Client Variability via On-Demand Dynamic Distillation , 1996, ASPLOS.

[10]  Dawson R. Engler,et al.  DPF: fast, flexible message demultiplexing using dynamic code generation , 1996, SIGCOMM 1996.

[11]  K. Olukotun,et al.  Evaluation of Design Alternatives for a Multiprocessor Microprocessor , 1996, 23rd Annual International Symposium on Computer Architecture (ISCA'96).

[12]  David Wetherall,et al.  Introducing new Internet services: why and how , 1998, IEEE Netw..

[13]  Roya Ulrich,et al.  Broadband Communications: The future of telecommunications , 1998 .

[14]  Brian N. Bershad,et al.  Execution characteristics of desktop applications on Windows NT , 1998, ISCA.

[15]  Brian N. Bershad,et al.  SPINE: An Operating System for Intelligent Network Adapters , 1998 .

[16]  David Wetherall,et al.  Increasing Effective Link Bandwidth by Supressing Replicated Data , 1998, USENIX Annual Technical Conference.

[17]  Hilarie K. Orman,et al.  Activating Networks: A Progress Report , 1999, Computer.

[18]  Venkatachary Srinivasan,et al.  Packet classification using tuple space search , 1999, SIGCOMM '99.

[19]  Larry L. Peterson,et al.  OS support for general-purpose routers , 1999, Proceedings of the Seventh Workshop on Hot Topics in Operating Systems.

[20]  Steven McCanne,et al.  BPF+: exploiting global data-flow optimization in a generalized packet filter architecture , 1999, SIGCOMM '99.

[21]  Nick McKeown,et al.  Packet classification on multiple fields , 1999, SIGCOMM '99.

[22]  Brian N. Bershad,et al.  Workloads for Programmable Network Interfaces , 2000 .

[23]  Implementation , 2001 .

[24]  Patrick Crowley,et al.  Network Processor Design: Issues and Practices , 2002 .