DOCSLIB.ORG

Motivations for Using a Network Processor What Can an NP Be Used For?

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Motivations for Using a Network Processor What Can an NP Be Used For? Outline • Introduction • Application Partitioning • Generic Networking Equipment Introduction to Network Processors • Network Processor Focus • Network Processor Challenges • Fitting the Architecture to the Problem Space Guest Lecture at UC Berkeley, 07Mar2002 Chuck Narad, Principal System Architect Intel Network Processor Division Introduction to Network Processors 1 Introduction to Network Processors 2 3/7/2002 3/7/2002 Introduction What is a Network Processor? • Overview of networking applications and processing • Terminology emerged in the industry 1997-1998 systems that are tuned to address them – Many startups competing for the network building -block market • Network Processing vs. Network Processors • Broad variety of products are presented as an NP • Discussion of Network Processors must be driven by • Some amount of integration and some amount of what networking applications do programmability – Moving data from here to there: Switching, Routing, • Generally some characteristics that enable efficient Aggregation/Disaggregation, Bridging etc. processing of network headers in cells or packets – Providing services: Security, Monitoring, Traffic Shaping etc. • Value proposition of NP’s: • Sometimes support for higher-level flow management – Improve TTM and to reduce investment by turning a silicon • Wide spectrum of capabilities and target markets design problem into a programming problem – Provide flexibility and field upgradability in networking equipment Introduction to Network Processors 3 Introduction to Network Processors 4 3/7/2002 3/7/2002 Motivations for using a Network Processor What Can an NP Be Used For? • “Flexibility of a fully programmable processor with • Highly dependent on user’s application: performance approaching that of a custom ASIC.” • Faster time to market (no ASIC lead time) • Integrated uP + system controller + “acceleration” – Instead you get software development time • Fast forwarding engine with access to a “slow-path” • Field upgradability leading to longer lifetime for control agent products in the field – Ability to adapt deployed equipment to evolving and • A smart DMA engine emerging standards and new application spaces • An intelligent NIC • Enables multiple products using common hardware • A highly integrated set of components to replace a • Allows the network equipment vendors to focus on bunch of ASICs and the blade control uP their value-add Introduction to Network Processors 5 Introduction to Network Processors 6 3/7/2002 3/7/2002 1 Common Features in NPs NP Architectural Challenges • Pool of multithreaded forwarding engines • Application-specific architecture • Integrated or attached GP uP • Yet, covering a very broad space with varied (and ill- defined) requirements and no useful benchmarks • High Bandwidth and High Capacity Memories • The Swiss Army Knife challenge – Embedded and external SRAM and DRAM – Versatile but does a bad job at everything • Integrated media interface or media bus • Need to understand the environment • Interface to a switching fabric or backplane • Need to understand network protocols • Interface to a “host” control processor • Need to understand networking applications • Interface to coprocessors • Have to provide solutions before the actual problem is defined – Decompose into the things you can know – Flows, bandwidths, “Life-of-Packet” scenarios, specific common functions Introduction to Network Processors 7 Introduction to Network Processors 8 3/7/2002 3/7/2002 Network Application Partitioning • Network processing is partitioned into planes – Forwarding Plane: Data movement, protocol conversion, etc – Control Plane: Flow management, (de)fragmentation, protocol stacks and signaling stacks, statistics gathering, Problem Spaces Addressed by NP’s management interface, routing protocols, spanning tree etc. • Control Plane is sometimes divided into Connection and Management Planes – Connections/second is a driving metric – Often connection management is handled closer to the data plane to improve performance-critical connection setup/teardown – Control processing is often distributed and hierarchical Introduction to Network Processors 9 Introduction to Network Processors 10 3/7/2002 3/7/2002 Network Processor Focus Generic Networking Equipment Line Card LC Control LC Control Line Card • The NP is generally aimed at Forwarding Plane tasks Processor Processor – Data shovel Ingress – Light Touch: Framing, SAR’ing, Classification and Lookups, FP FP Mappings (port, path, tag, flow, etc.) Media Processing Processing Media – High Throughput – Queuing and Scheduling – Backplane encapsulation and decapsulation Fabric or ControlControl • Packets requiring heavier work are offloaded to Backplane ProcessorProcessor Control Plane or Coprocessor • NP’s usually provide a forwarding plane closely FP FP coupled with a uP. Media Media Processing Processing Egress – The microprocessor may implement the entire control plane – May handle a portion of it locally (e.g. flow setup) and have LC Control LC Control an external host which provides the higher-level control Line Card Processor Processor Line Card plane Introduction to Network Processors 11 Introduction to Network Processors 12 3/7/2002 3/7/2002 2 L3-L7 Application Examples Oversimplified Categorization of Applications • Some or all packets require involvement of a GPP – Handles exceptions, manages connections, or handles higher layer processing • Examples of L3 processing: Payload Inspection Real Time – IP Fragment reassembly, IP filtering, MPOA, LANE, Multicast Virus Scanning Forwarding, Virtual Private Networks (IPSEC) TCP Header Virtual Private Network • Examples of L4 processing: Firewall IP Header – Proxying, Port Mapping (NAT), TCP stream following, stream Load Balancing reassembly, content-based routing,QoS/CoS, Rate Shaping, Ethernet Network Monitoring Load balancing (LB) Header Application Processing Complexity • Examples of L5-L7 processing: Packet Inspection Complexity Quality of Service Routing – Content-based load balancing (CBLB), RMON-2, traffic engineering, accounting, Intrusion Detection, Virus Detection Switching • Many/most higher-layer functions implicitly include forwarding (routing). Introduction to Network Processors 13 Introduction to Network Processors 14 3/7/2002 3/7/2002 Categorizing Application Types and Needs More Detailed Application Characteristics • Applications can: – be high- or low-touch on packet data Application Data State Compute CP – be high- or low-touch on application state touch touch touch – span a spectrum of compute needs from low-compute to very Switching Low Low/Med Low/Med Low compute-intensive Routing Low Low/Med Low/Med Low • Some applications are high touch for a percentage of packets: QoS Low/Med Low/Med Low/Med Low – where one or more packets require high {packet, state} touch and Stateful Firewall Low/Med Low/Med Low-High Med/High Proxy Firewall Med/high Med Med High relatively high compute to establish flow state, and Load Balancing Med Med/High Low/Med Med/High – subsequent packets in that flow require simple forwarding CB Load Balance High Med/High Low/Med High • The simplest of L4 applications can be high-touch or -compute VPN High Med High – TCP/UDP checksums require touch of entire packet Virus Detection High High High High • Some modern MAC’s do this per datagram frag for you, minor math to combine IDS High High High High – IP fragment reassembly, TCP flow assembly require creation and management of flow state, and copies or linked lists of buffers in order to do processing on streams of packets rather than per-pkt Introduction to Network Processors 15 Introduction to Network Processors 16 3/7/2002 3/7/2002 Basic Paradigm of Forwarding Plane Processing Canonical Network Processing Flow • Examine header(s) • Do lookup(s) Buffer & Descriptor – e.g. bridging tables, IPv4 LPM, flow identification table Recovery • Select and Execute Actions Classification – Packet (or cell) modifications Results Packet RX Modifications, … – Application State modifications (tables, counters, flow records) Inspect Connections, Steer – Queuing Queuing, – Possibly heavy lifting such as connection management, crypto, Lookups etc RegEx string search… • Transmit may also include scheduling/shaping Tables State Schedule Modifications • Since ingress and egress are typically on different Application blades, “TX” and “RX” may be to/from the fabric State • Housekeeping: Buffers and descriptors must be Reports to Admin portion TX allocated and recovered for each frame Introduction to Network Processors 17 Introduction to Network Processors 18 3/7/2002 3/7/2002 3 Challenges for NPs • Infinitely variable problem space • “Wire speed”; small time budgets per cell/packet • Poor memory utilization; fragments, singles – Mismatched to burst-oriented memory Challenges Faced by Network Processors • Poor locality, sparse access patterns, indirections – Memory latency dominates processing time – New data, new descriptor per cell/packet. Caches don’t help – Hash lookups and P-trie searches cascade indirections • Random alignments due to encapsulation – 14-byte Ethernet headers, 5-byte ATM headers, etc. – Want to process multiple bytes/cycle • Short-lived flows (esp. HTTP) => high rate of “exceptions” • Sequentiality requirements within flows; sequencing overhead/locks • Shared data structures -> locks; latency and contention costs Introduction to Network Processors 19 Introduction to Network Processors 20 3/7/2002 3/7/2002 Processing Time Budgets Latency Challenges of Packet Processing • Packet
Load more

Recommended publications
  • C5ENPA1-DS, C-5E NETWORK PROCESSOR SILICON REVISION A1
    Freescale Semiconductor, Inc... SILICON REVISION A1 REVISION SILICON C-5e NETWORK PROCESSOR Sheet Data Rev 03 PRELIMINARY C5ENPA1-DS/D Freescale Semiconductor,Inc. F o r M o r G e o I n t f o o : r w m w a t w i o . f n r e O e n s c T a h l i e s . c P o r o m d u c t , Freescale Semiconductor, Inc... Freescale Semiconductor,Inc. F o r M o r G e o I n t f o o : r w m w a t w i o . f n r e O e n s c T a h l i e s . c P o r o m d u c t , Freescale Semiconductor, Inc... Freescale Semiconductor,Inc. Silicon RevisionA1 C-5e NetworkProcessor Data Sheet Rev 03 C5ENPA1-DS/D F o r M o r Preli G e o I n t f o o : r w m w a t w i o . f n r e O e n s c T a h l i e s . c P o r o m m d u c t , inary Freescale Semiconductor, Inc... Freescale Semiconductor,Inc. F o r M o r G e o I n t f o o : r w m w a t w i o . f n r e O e n s c T a h l i e s . c P o r o m d u c t , Freescale Semiconductor, Inc. C5ENPA1-DS/D Rev 03 CONTENTS .
    [Show full text]
  • Design and Implementation of a Stateful Network Packet Processing
    610 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 25, NO. 1, FEBRUARY 2017 Design and Implementation of a Stateful Network Packet Processing Framework for GPUs Giorgos Vasiliadis, Lazaros Koromilas, Michalis Polychronakis, and Sotiris Ioannidis Abstract— Graphics processing units (GPUs) are a powerful and TCAMs, have greatly reduced both the cost and time platform for building the high-speed network traffic process- to develop network traffic processing systems, and have ing applications using low-cost hardware. The existing systems been successfully used in routers [4], [7] and network tap the massively parallel architecture of GPUs to speed up certain computationally intensive tasks, such as cryptographic intrusion detection systems [27], [34]. These systems offer a operations and pattern matching. However, they still suffer from scalable method of processing network packets in high-speed significant overheads due to critical-path operations that are still environments. However, implementations based on special- being carried out on the CPU, and redundant inter-device data purpose hardware are very difficult to extend and program, transfers. In this paper, we present GASPP, a programmable net- and prohibit them from being widely adopted by the industry. work traffic processing framework tailored to modern graphics processors. GASPP integrates optimized GPU-based implemen- In contrast, the emergence of commodity many-core tations of a broad range of operations commonly used in the architectures, such as multicore CPUs and modern graph- network traffic processing applications, including the first purely ics processors (GPUs) has proven to be a good solution GPU-based implementation of network flow tracking and TCP for accelerating many network applications, and has led stream reassembly.
    [Show full text]
  • Embedded Multi-Core Processing for Networking
    12 Embedded Multi-Core Processing for Networking Theofanis Orphanoudakis University of Peloponnese Tripoli, Greece [email protected] Stylianos Perissakis Intracom Telecom Athens, Greece [email protected] CONTENTS 12.1 Introduction ............................ 400 12.2 Overview of Proposed NPU Architectures ............ 403 12.2.1 Multi-Core Embedded Systems for Multi-Service Broadband Access and Multimedia Home Networks . 403 12.2.2 SoC Integration of Network Components and Examples of Commercial Access NPUs .............. 405 12.2.3 NPU Architectures for Core Network Nodes and High-Speed Networking and Switching ......... 407 12.3 Programmable Packet Processing Engines ............ 412 12.3.1 Parallelism ........................ 413 12.3.2 Multi-Threading Support ................ 418 12.3.3 Specialized Instruction Set Architectures ....... 421 12.4 Address Lookup and Packet Classification Engines ....... 422 12.4.1 Classification Techniques ................ 424 12.4.1.1 Trie-based Algorithms ............ 425 12.4.1.2 Hierarchical Intelligent Cuttings (HiCuts) . 425 12.4.2 Case Studies ....................... 426 12.5 Packet Buffering and Queue Management Engines ....... 431 399 400 Multi-Core Embedded Systems 12.5.1 Performance Issues ................... 433 12.5.1.1 External DRAMMemory Bottlenecks ... 433 12.5.1.2 Evaluation of Queue Management Functions: INTEL IXP1200 Case ................. 434 12.5.2 Design of Specialized Core for Implementation of Queue Management in Hardware ................ 435 12.5.2.1 Optimization Techniques .......... 439 12.5.2.2 Performance Evaluation of Hardware Queue Management Engine ............. 440 12.6 Scheduling Engines ......................... 442 12.6.1 Data Structures in Scheduling Architectures ..... 443 12.6.2 Task Scheduling ..................... 444 12.6.2.1 Load Balancing ................ 445 12.6.3 Traffic Scheduling ...................
    [Show full text]
  • Network Processors: Building Block for Programmable Networks
    NetworkNetwork Processors:Processors: BuildingBuilding BlockBlock forfor programmableprogrammable networksnetworks Raj Yavatkar Chief Software Architect Intel® Internet Exchange Architecture [email protected] 1 Page 1 Raj Yavatkar OutlineOutline y IXP 2xxx hardware architecture y IXA software architecture y Usage questions y Research questions Page 2 Raj Yavatkar IXPIXP NetworkNetwork ProcessorsProcessors Control Processor y Microengines – RISC processors optimized for packet processing Media/Fabric StrongARM – Hardware support for Interface – Hardware support for multi-threading y Embedded ME 1 ME 2 ME n StrongARM/Xscale – Runs embedded OS and handles exception tasks SRAM DRAM Page 3 Raj Yavatkar IXP:IXP: AA BuildingBuilding BlockBlock forfor NetworkNetwork SystemsSystems y Example: IXP2800 – 16 micro-engines + XScale core Multi-threaded (x8) – Up to 1.4 Ghz ME speed RDRAM Microengine Array Media – 8 HW threads/ME Controller – 4K control store per ME Switch MEv2 MEv2 MEv2 MEv2 Fabric – Multi-level memory hierarchy 1 2 3 4 I/F – Multiple inter-processor communication channels MEv2 MEv2 MEv2 MEv2 Intel® 8 7 6 5 y NPU vs. GPU tradeoffs PCI XScale™ Core MEv2 MEv2 MEv2 MEv2 – Reduce core complexity 9 10 11 12 – No hardware caching – Simpler instructions Î shallow MEv2 MEv2 MEv2 MEv2 Scratch pipelines QDR SRAM 16 15 14 13 Memory – Multiple cores with HW multi- Controller Hash Per-Engine threading per chip Unit Memory, CAM, Signals Interconnect Page 4 Raj Yavatkar IXPIXP 24002400 BlockBlock DiagramDiagram Page 5 Raj Yavatkar XScaleXScale
    [Show full text]
  • Scientific Computing Kernels on the Cell Processor
    Scientific Computing Kernels on the Cell Processor Samuel Williams, John Shalf, Leonid Oliker Shoaib Kamil, Parry Husbands, Katherine Yelick Computational Research Division Lawrence Berkeley National Laboratory Berkeley, CA 94720 {swwilliams,jshalf,loliker,sakamil,pjrhusbands,kayelick}@lbl.gov ABSTRACT architectures that provide high performance on scientific ap- The slowing pace of commodity microprocessor performance plications, yet have a healthy market outside the scientific improvements combined with ever-increasing chip power de- community. In this work, we examine the potential of the mands has become of utmost concern to computational sci- recently-released STI Cell processor as a building block for entists. As a result, the high performance computing com- future high-end computing systems, by investigating perfor- munity is examining alternative architectures that address mance across several key scientific computing kernels: dense the limitations of modern cache-based designs. In this work, matrix multiply, sparse matrix vector multiply, stencil com- we examine the potential of using the recently-released STI putations on regular grids, as well as 1D and 2D FFTs. Cell processor as a building block for future high-end com- Cell combines the considerable floating point resources re- puting systems. Our work contains several novel contribu- quired for demanding numerical algorithms with a power- tions. First, we introduce a performance model for Cell and efficient software-controlled memory hierarchy. Despite its apply it to several key scientific computing kernels: dense radical departure from previous mainstream/commodity pro- matrix multiply, sparse matrix vector multiply, stencil com- cessor designs, Cell is particularly compelling because it putations, and 1D/2D FFTs. The difficulty of programming will be produced at such high volumes that it will be cost- Cell, which requires assembly level intrinsics for the best competitive with commodity CPUs.
    [Show full text]
  • Intel® IXP42X Product Line of Network Processors with ETHERNET Powerlink Controlled Node
    Application Brief Intel® IXP42X Product Line of Network Processors With ETHERNET Powerlink Controlled Node The networked factory floor enables the While different real-time Ethernet solutions adoption of systems for remote monitoring, are available or under development, EPL, long-distance support, diagnostic services the real-time protocol solution managed and the integration of in-plant systems by the open vendor and user group EPSG with the enterprise. The need for flexible (ETHERNET Powerlink Standardization Group), connectivity solutions and high network is the only deterministic data communication bandwidth is driving a fundamental shift away protocol that is fully conformant with Ethernet from legacy industrial bus architectures and networking standards. communications protocols to industry EPL takes the standard approach of IEEE standards and commercial off-the shelf (COTS) 802.3 Ethernet with a mixed polling and time- solutions. Standards-based interconnect slicing mechanism to transfer time-critical data technologies and communications protocols, within extremely short and precise isochronous especially Ethernet, enable simpler and more cycles. In addition, EPL provides configurable cost-effective integration of network elements timing to synchronize networked nodes with and applications, from the enterprise to the www.intel.com/go/embedded high precision while asynchronously transmitting factory floor. data that is less time-critical. EPL is the ideal The Intel® IXP42X product line of network solution for meeting the timing demands of processors with ETHERNET Powerlink (EPL) typical high performance industrial applications, software helps manufacturers of industrial such as automation and motion control. control and automation devices bridge Current implementations have reached 200 µs between real-time Ethernet on the factory cycle-time with a timing deviation (jitter) less floor and standard Ethernet IT networks in than 1 µs.
    [Show full text]
  • And GPU-Based DNN Training on Modern Architectures
    An In-depth Performance Characterization of CPU- and GPU-based DNN Training on Modern Architectures Presentation at MLHPC ‘17 Ammar Ahmad Awan, Hari Subramoni, and Dhabaleswar K. Panda Network Based Computing Laboratory Dept. of Computer Science and Engineering The Ohio State University [email protected], {subramon,panda}@cse.ohio-state.edu CPU based Deep Learning is not as bad as you think! • Introduction – CPU-based Deep Learning – Deep Learning Frameworks • Research Challenges • Design Discussion • Performance Characterization • Conclusion Network Based Computing Laboratory MLHPC ‘17 High-Performance Deep Learning 2 GPUs are great for Deep Learning • NVIDIA GPUs have been the main driving force for faster training of Deep Neural Networks (DNNs) • The ImageNet Challenge - (ILSVRC) – 90% of the ImageNet teams used GPUs in 2014* https://www.top500.org/ – DL models like AlexNet, GoogLeNet, and VGG – GPUs: A natural fit for DL due to the throughput-oriented nature – GPUs are also growing in the HPC arena! *https://blogs.nvidia.com/blog/2014/09/07/imagenet/ Network Based Computing Laboratory MLHPC ‘17 High-Performance Deep Learning 3 https://www.top500.org/statistics/list/ But what about CPUs? • Intel CPUs are everywhere and many-core CPUs are emerging according to Top500.org • Host CPUs exist even on the GPU nodes – Many-core Xeon Phis are increasing • Xeon Phi 1st generation: a many-core co-processor • Xeon Phi 2nd generation (KNL): a self-hosted many- core processor! • Usually, we hear CPUs are 10x – 100x slower than GPUs? [1-3] – But can we do better? 1- https://dl.acm.org/citation.cfm?id=1993516 System Count for Xeon Phi 2- http://ieeexplore.ieee.org/abstract/document/5762730/ 3- https://dspace.mit.edu/bitstream/handle/1721.1/51839/MIT-CSAIL-TR-2010-013.pdf?sequence=1 Network Based Computing Laboratory MLHPC ‘17 High-Performance Deep Learning 4 Deep Learning Frameworks – CPUs or GPUs? • There are several Deep Learning (DL) or DNN Training frameworks – Caffe, Cognitive Toolkit, TensorFlow, MXNet, and counting...
    [Show full text]
  • Effective Compilation Support for Variable Instruction Set Architecture
    Effective Compilation Support for Variable Instruction Set Architecture Jack Liu, Timothy Kong, Fred Chow Cognigine Corporation 6120 Stevenson Blvd. Fremont, CA 94538, USA g fjackl,timk,fredc @cognigine.com Abstract running embedded applications. these application specific instruction set processors (ASIPs) [1, 2] use instruction sets customized towards a specific type of application so they Traditional compilers perform their code generation can deliver efficient run-time performance for typical pro- tasks based on a fixed, pre-determined instruction set. This grams written for that application area. Because the instruc- paper describes the implementation of a compiler that de- tion set is pre-determined, the compiler is built and config- termines the best instruction set to use for a given pro- ured to generate code based on a custom, fixed instruction gram and generates efficient code sequence based on it. We set [16]. first give an overview of the VISC Architecture pioneered at Cognigine that exemplifies a Variable Instruction Set Ar- The Variable Instruction Set Communications Architec- chitecture. We then present three compilation techniques ture (VISC Architecture ÌÅ ) from Cognigine represents a that, when combined, enable us to provide effective com- very different approach in the attempt to provide greater pilation and optimization support for such an architecture. configurability in compiling embedded software. The VISC The first technique involves the use of an abstract opera- Architecture can perform a complex set of instructions con- tion representation that enables the code generator to op- sisting of multiple, fine and coarse grain operations that op- timize towards the core architecture of the processor with- erate on multiple operands at the same time in one fixed out committing to any specific instruction format.
    [Show full text]
  • NP-5™ Network Processor
    NETWORK PROCESSOR PRODUCT BRIEF † NP-5™ Network Processor 240Gbps NPU for Carrier Ethernet Applications HIGHLIGHTS Mellanox’s NP-5 is a highly-flexible network processor with integrated traffic management, targeting Carrier Ethernet Switches and Routers (CESR) and other Carrier Ethernet platforms – 240Gbps wire-speed network processor aimed that require high performance, flexible packet processing and fine-grained traffic management. at Carrier Ethernet applications TARGET APPLICATIONS – Integrated 240Gbps traffic management NP-5’s flexibility and integration allows system vendors to deliver cost effective solutions that providing granular bandwidth control can easily adapt to changing market requirements. – Up to 480Gbps peak processing data path and Typical applications include: Stand-alone pizza box solutions: CoS classification • Line cards in modular chassis: • Ethernet Aggregation Nodes – Suited for line card, services card and pizza box • Edge and Core Routers • Server Load Balancing Switches applications • Transport Switches • Multi-10Gbps Firewalls & VPN – On-chip control CPU for host CPU offload • Data Center Switches • Intrusion Detection Appliances • 3G/4G Wireless Infrastructure Equipment • Network Monitoring and Analysis Services – Power management for minimizing line card and system power dissipation SOFTWARE TOOLS – Operations, Administration and Management Mellanox supplies a comprehensive set of software tools to facilitate system design for NP-5 (OAM) processing offload based products. The toolset manages the data plane and allows designers to edit, build and – Synchronous Ethernet and IEEE1588v2 offload debug microcode applications for the Mellanox’s network processors with a unified GUI. for Circuit Emulation Services Designers can quickly develop and test the microcode using cycle-accurate simulation and debugging tools including breakpoints, single-step program execution and access to internal – IP reassembly for advanced packet processing resources.
    [Show full text]
  • Network Processors the Morgan Kaufmann Series in Systems on Silicon Series Editor: Wayne Wolf, Georgia Institute of Technology
    Network Processors The Morgan Kaufmann Series in Systems on Silicon Series Editor: Wayne Wolf, Georgia Institute of Technology The Designer’s Guide to VHDL, Second Edition Peter J. Ashenden The System Designer’s Guide to VHDL-AMS Peter J. Ashenden, Gregory D. Peterson, and Darrell A. Teegarden Modeling Embedded Systems and SoCs Axel Jantsch ASIC and FPGA Verification: A Guide to Component Modeling Richard Munden Multiprocessor Systems-on-Chips Edited by Ahmed Amine Jerraya and Wayne Wolf Functional Verification Bruce Wile, John Goss, and Wolfgang Roesner Customizable and Configurable Embedded Processors Edited by Paolo Ienne and Rainer Leupers Networks-on-Chips: Technology and Tools Edited by Giovanni De Micheli and Luca Benini VLSI Test Principles & Architectures Edited by Laung-Terng Wang, Cheng-Wen Wu, and Xiaoqing Wen Designing SoCs with Configured Processors Steve Leibson ESL Design and Verification Grant Martin, Andrew Piziali, and Brian Bailey Aspect-Oriented Programming with e David Robinson Reconfigurable Computing: The Theory and Practice of FPGA-Based Computation Edited by Scott Hauck and André DeHon System-on-Chip Test Architectures Edited by Laung-Terng Wang, Charles Stroud, and Nur Touba Verification Techniques for System-Level Design Masahiro Fujita, Indradeep Ghosh, and Mukul Prasad VHDL-2008: Just the New Stuff Peter J. Ashenden and Jim Lewis On-Chip Communication Architectures: System on Chip Interconnect Sudeep Pasricha and Nikil Dutt Embedded DSP Processor Design: Application Specific Instruction Set Processors Dake Liu Processor Description Languages: Applications and Methodologies Edited by Prabhat Mishra and Nikil Dutt Network Processors Architecture, Programming, and Implementation Ran Giladi Ben-Gurion University of the Negev and EZchip Technologies Ltd.
    [Show full text]
  • Synchronized MIMD Computing Bradley C. Kuszmaul
    Synchronized MIMD Computing by Bradley C. Kuszmaul SB mathematics Massachusetts Institute of Technology SB computer science and engineering Massachusetts Institute of Technology SM electrical engineering and computer science Massachusetts Institute of Technology Submitted to the Department of Electrical Engineering and Computer Science in partial ful®llment of the requirements for the degree of Doctor of Philosophy at the MASSACHUSETTS INSTITUTE OF TECHNOLOGY May 1994 c Massachusetts Institute of Technology 1994. All rights reserved. : :: : : :: : :: : :: : : :: : :: : :: : : :: : :: : :: : : :: : :: : :: : : :: : :: : :: : : :: : :: : : :: : :: : :: : : :: Author : Department of Electrical Engineering and Computer Science May 22, 1994 :: : :: : : :: : :: : :: : : :: : :: : :: : : :: : :: : :: : : :: : :: : :: : : :: : :: : :: : : :: : :: : : :: : :: Certi®ed by :: Charles E. Leiserson Professor of Computer Science and Engineering Thesis Supervisor :: : :: : :: : : :: : :: : :: : : :: : :: : :: : : :: : :: : :: : : :: : :: : :: : : :: : :: : :: : : :: : :: : : :: Accepted by : F. R. Morgenthaler Chair, Department Committee on Graduate Students 1 2 Synchronized MIMD Computing by Bradley C. Kuszmaul Submitted to the Department of Electrical Engineering and Computer Science on May 22, 1994, in partial ful®llment of the requirements for the degree of Doctor of Philosophy Abstract Fast global synchronization provides simple, ef®cient solutions to many of the system problems of parallel computing. It achieves this by providing composition
    [Show full text]
  • A Network Processor Architecture for High Speed Carrier Grade Ethernet Networks
    TECHNISCHE UNIVERSITAT¨ MUNCHEN¨ Lehrstuhl f¨urIntegrierte Systeme A Network Processor Architecture for High Speed Carrier Grade Ethernet Networks Kimon Karras Vollst¨andigerAbdruck der von der Fakult¨atf¨urElektrotechnik und Informationstechnik der Technischen Universit¨atM¨unchen zur Erlangung des akademischen Grades eines Doktor-Ingenieurs (Dr.-Ing.) genehmigten Dissertation. Vorsitzender: Univ.-Prof. Dr.-Ing. Wolfgang Kellerer Pr¨uferder Dissertation: 1. Univ.-Prof. Dr. sc.techn. Andreas Herkersdorf 2. Univ.-Prof. Dr.-Ing. Andreas Kirst¨adter,Universit¨atStuttgart Die Dissertation wurde am 13.05.2013 bei der Technischen Universit¨atM¨unchen einge- reicht und durch die Fakult¨atf¨urElektrotechnik und Informationstechnik am 24.03.2014 angenommen. Preface This work was performed at the Institute for Integrated Systems of the Technical University of Munich under the auspices of Prof. Dr. sc.techn. Andreas Herkersdorf and Dr.-Ing. Thomas Wild, both of whom I have to whole-heartedly thank for giving me the opportunity of working with them and for their invaluable help and guidance throughout the five years of my stay at the institute. A further thanks goes to all the people at the institute with whom I've cooperated over the years and who have made life enjoyable both on a professional and on a personal level. A very great thanks is due to Daniel Llorente for keeping me company and bearing with me during most of this time. His contribution to this thesis is immense and without him it wouldn't have been possible. Muchas gracias, companero~ ! Furthermore I would like to thank all the partner companies and participants of the 100GET project, which formed the basis for this disseration.
    [Show full text]