1 / 27

Chapter 8 Hardware Conventional Computer Hardware Architecture

Chapter 8 Hardware Conventional Computer Hardware Architecture. Outline. The Traditional Software Router Measures Of Speed Fine-grain parallelism Symmetric coarse-grain parallelism Asymmetric coarse-grain parallelism Special-purpose coprocessors NICs with onboard processing

zenia
Download Presentation

Chapter 8 Hardware Conventional Computer Hardware Architecture

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Chapter 8Hardware Conventional Computer Hardware Architecture

  2. Outline • The Traditional Software Router • Measures Of Speed • Fine-grain parallelism • Symmetric coarse-grain parallelism • Asymmetric coarse-grain parallelism • Special-purpose coprocessors • NICs with onboard processing • Smart NICs with onboard stacks • Cell switching • Data pipelines

  3. all other processing framing & address recognition framing & address recognition The Traditional Software Router • The hardware architecture used with a software-based network system • The CPU handles all protocol processing tasks except for framing and onboard address recognition NIC1 Standard CPU NIC2

  4. Two Measures Of Speed • Data rate (bits per second) • Per interface rate • Aggregate rate • Packet rate (packets per second) • Per interface rate • Aggregate rate

  5. Processing Speed For Two Reasons • A router must be able to handle packets as they arrive from a given network, the processing speed determines the maximum data rate of a network that can be attached to the router • A router must be able to handle packets arriving from multiple networks, the processing speed limits the possible topologies with which the router can be used

  6. Aggregate Data Rate • Total rate at which data can arrive or leave a network system • The maximum aggregate data rate of a system is important because it limits the type and numbers of networks connections the system can handle

  7. Aggregate Packet Rate • For protocol processing tasks that have a fixed cost per packet, the number of packets processed is more important than the aggregate data rate • How many packets arrive per second over a network • Depends on the network’s throughput rate and the size of the packets

  8. Digital Circuit Speeds Technology Network Packet Rate Packet Rate Data Rate For small Packets For large Packets In Gbps In Kpps In Kpps 10Base-T 0.010 19.5 0.8 100Base-T 0.100 195.3 8.2 OC-3 0.156 303.8 12.8 OC-12 0.622 1,214.8 51.2 1000Base-T 1.000 1,953.1 82.3 OC-48 2.488 4,860.0 204.9 OC-192 9.953 19,440.0 819.6 OC-768 39.813 77,760.0 3,278.4 • Key concept: maximum packet rate occurs with minimum-size packets

  9. Bar Chart Of Example Packet Rates • Gray areas show rates for large packets

  10. Packet Rate And Software Router Feasibility • The exact rate depends on the CPU speeds, bus bandwidth, and memory latency as well as the amount of processing • The amount of processing required depends on the packet content • Software running on a general-purpose processor is an insufficient architecture to handle high-speed networks because the aggregate packet rate exceeds the capabilities of current CPUs

  11. Maximum per-packet processing time in microseconds of small and large packets for various technologies Technology Time per Packet Time per Packet For small Packets For large Packets (In μs) (In μs) 10Base-T 51.20 1,214.40 100Base-T 5.12 121.44 OC-3 3.29 78.09 OC-12 0.82 19.52 1000Base-T 0.51 12.14 OC-48 0.21 4.88 OC-192 0.05 1.22 OC-768 0.01 0.31

  12. Possible Ways To SolveThe CPU Bottleneck • Fine-grain parallelism • Symmetric coarse-grain parallelism • Asymmetric coarse-grain parallelism • Special-purpose coprocessors • NICs with onboard processing • Smart NICs with onboard stacks • Cell switching • Data pipelines

  13. Fine-Grain Parallelism (Instruction-Level Parallelism) • Multiple CPU to work together • Instruction-level parallelism does not achieve significantly higher performance • Few packet processing functions are amenable to fine-grain optimization • A program must spend time setting up the parallel instructions • Only improves CPU performance • Expensive

  14. Symmetric Coarse-Grain Parallelism • Offer a set of N identical CPUs • Advantages • Network system designers did not need to invent new symmetric multiprocessor hardware • Vender had ported a conventional Unix operating system to their multiprocessor hardware  Familiar

  15. Processing Capability • Processing capability does not scale linearly as the number of processors increases • Most multiprocessor systems use a shared memory paradigm where all processors share a kernel address space • Packet processing software must coordinate access to data structure such as packet queues • A multiprocessor architecture does not automatically increase the I/O bandwidth

  16. Asymmetric Coarse-Grain Parallelism • Uses multiple, heterogeneous processor that can operate simultaneously • The Advantage arises from the ability to specialize • Each processor in an Asymmetric system can be optimized for a specific task • Drawbacks • Need general-purpose instructions • Difficult to program • May not perform well for a specific task or a specific protocol • Expensive to design and build

  17. Special-Purpose Coprocessors • Coprocessors:an architecture that contains a general-purpose CPU plus one or more special-purpose processor • Each coprocessor is designed to perform a specific function  all coprocessors function under of the CPU • The chief advantage lies in the freedom it gives a designer • It can also be a small logic circuit that performs one operation  does not need general-purpose instructions, and does not need a fetch-execute cycle

  18. Special-Purpose Coprocessors (con’t) • A coprocessor is a piece of hardware that operates under control of the CPU • A processor need not be sophisticated; the coprocessor only need to perform on specific task • To optimize computation, move operations that account for the most CPU time from software into hardware

  19. ASIC Coprocessor Implementation • Application Specific Integrated Circuit (ASIC) refers to an integrated circuit (IC) that has been customer-designed for a specific need • The availability of ASIC technology is especially pertinent to coprocessors • Designers attempt to make the coprocessor general enough to work with many protocol

  20. NICs With Onboard Processing • Many protocol processing tasks are I/O bound • An obvious optimization consists of moving processing onto NIC  IP checksum, packet encryption or compression • The chief advantage of onboard processing lies in reduce CPU load  a NIC only needs to handle packets from a single interface • What components are used to create smart NICs ? • ASIC hardware : incorporate special-purpose chips in to a NIC • Embedded RISC hardware : contains an onboard RAM and an onboard ROM

  21. all other processing Most layer 2 processing some layer 3 processing Most layer 2 processing some layer 3 processing An optimized system with smart NIC • NIC handles layers 2 and 3 • CPU only handles exceptions Smart NIC1 Standard CPU SmartNIC2

  22. Smart NICs With Onboard Stacks • A RISC processor makes it possible to add more protocol processing functionality to a NIC • Constrains arise that limit the scalability of a system that uses smart NICs in a conventional computer  the data path between NICs becomes a bottleneck • In a traditional computer system, the data path includes the bus to which the NIC attaches and memory

  23. Existing protocols • Redesign protocols • Allow sender to choose a size up to the maximum • Make hardware design more difficult • Are not well-suited to applications like voice that require bounded latency • Variable-size packets • Each address is globally known • Arises from forwarding overhead

  24. Cells And Connection-Oriented Addressing • Requires new protocol, new packet formats, and a connection-oriented paradigm • Fixed-size packets • Allows fixed-size buffers • Guaranteed time to transmit/receive • Relative (connection-oriented) addressing • Smaller address size • Label on packet changes at each switch • Requires connection setup • Example: ATM

  25. Data Pipelines • Move each packet through series of processors • Each processor handles some tasks • Assessment • Well-suited to many protocol processing tasks • Individual processor can be fast • Advantage • Much less complex and run faster • All stages can operate at the same time

  26. 5-stage data pipeline Decode the datagram fragmentation Encapsulation the datagram Lookup the des. Add. Computing the outgoing checksum

  27. QUESTION?

More Related