Top Banner
1 Computer Architecture Structured Computer Organization by A. Tanenbaum, Prentice Hall, 2005 B. W. Wah ECE 290 Fall 2006 Introductions
56
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
  • 1Computer Architecture

    Structured Computer Organizationby A. Tanenbaum, Prentice Hall, 2005

    B. W. WahECE 290Fall 2006

    Introductions

  • 2Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    3

    Languages, Levels, Virtual Machines

    A multilevel machine

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    4

    Contemporary Multilevel Machines

    A six-level computer. The support method for each level is indicated below it .

  • 3Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    5

    Computer Generations Zeroth Generation

    Mechanical Computers (1642 1945)

    First GenerationVacuum Tubes (1945 1955)

    Second GenerationTransistors (1955 1965)

    Third GenerationIntegrated Circuits (1965 1980)

    Fourth GenerationVery Large Scale Integration (1980 ?)

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    6

    Von Neumann Machine

    The original Von Neumann machine.

  • 4Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    7

    PDP-8 Innovation Single Bus

    The PDP-8 omnibus

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    8

    Technological and Economic Forces

    Moores law predicts a 60-percent annual increase in thenumber of transistors that can be put on a chip. The data points given in this figure are memory sizes, in bits.

  • 5Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    9

    Personal Computer

    A printed circuit board is at the heart of every personal computer. This figure is a photograph of the Intel D875PBZ board. The photograph is copyrighted by the Intel Corporation, 2003 and is used by permission.

    1. Pentium 4 socket2. 875P Support chip3. Memory sockets4. AGP connector5. Disk interface6. Gigabit Ethernet7. Five PCI slots8. USB 2.0 ports9. Cooling technology10. BIOS

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    10

    Example Computer Families

    Pentium 4 by Intel UltraSPARC III by Sun Microsystems The 8051 chip by Intel, used for embedded systems

  • 6Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    11

    Intel Computer Family (1)

    The Intel CPU family. Clock speeds are measured in MHz (megahertz) where 1 MHZ is 1 million cycles/sec.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    12

    Intel Computer Family (2)

    The Pentium 4 chip. The photograph is copyrighted by the Intel Corporation, 2003 and is used by permission.

  • 7Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    13

    Intel Computer Family (3)

    Moores law for (Intel) CPU chips.

    Computer Systems Organization

  • 8Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    15

    Central Processing Unit

    The organization of a simple computer with one CPU and two I/O devices

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    16

    CPU Organization

    The data path of a typical Von Neumann machine.

  • 9Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    17

    Instruction Execution Steps

    1. Fetch next instruction from memory into instr. register2. Change program counter to point to next instruction3. Determine type of instruction just fetched4. If instructions uses word in memory, determine where

    Fetch word, if needed, into CPU register5. Execute the instruction6. Go to step 1 to begin executing following instruction

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    18

    RISC versus CISC 1980: RISC has simple instructions that can be executed in

    one cycle of a simple data path Execute frequently used instructions efficiently and less frequently

    used instructions less efficiently Wins over CISC that takes multiple and longer cycles to execute a

    complex instruction May take 4-5 instructions to accomplish a complex operation

    CISC is still predominant in todays market Backward compatibility to early CISC computers Starting with 486, Intel CPUs contain a RISC core that executes the

    simplest (and typically most common) instructions in a single data path cycle, while interpreting the more complicated instructions in the usual CISC way

  • 10

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    19

    Design Principles for Modern Computers

    All instructions directly executed by hardware Maximize rate at which instructions are issued Instructions should be easy to decode Only loads, stores should reference memory Provide plenty of registers

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    20

    Instruction-Level Parallelism

    a) A five-stage pipelineb) The state of each stage as a function of time. Nine clock

    cycles are illustrated

  • 11

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    21

    Superscalar Architectures (1)

    Dual five-stage pipelines with a common instruction fetch unit.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    22

    Superscalar Architectures (2)

    A superscalar processor with five functional units.

  • 12

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    23

    Processor-Level Parallelism (1)

    An array of processor of the ILLIAC IV type.(ILLIAC I in Sept. 1952)

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    24

    Processor-Level Parallelism (2)

    a) A single-bus multiprocessor.b) A multicomputer with local memories.

  • 13

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    25

    Cache Memory

    The cache is logically between the CPU and main memory. Physically, there are several possible places it could be located.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    26

    Memory Hierarchies

    A five-level memory hierarchy.

  • 14

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    27

    Magnetic Disks (1)

    A portion of a disk track. Two sectors are illustrated.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    28

    Magnetic Disks (2)

    A disk with four platters.

  • 15

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    29

    Magnetic Disks (3)

    A disk with five zones. Each zone has many tracksand has uneven number of tracks across zones.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    30

    RAID (1) Redundant Array of Inexpensive Disks (1988)

    RAID levels 0 through 2. Backup and parity disks are shown shaded.

    4 bit with errorcorrection in CM2

  • 16

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    31

    RAID (1) Redundant Array of Inexpensive Disks

    RAID levels 3 through 5. Backup and parity disks are shown shaded.

    The Processor Level

  • 17

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    33

    CPU Chips

    The logical pinout of a generic CPU. The arrows indicate input signals and output signals. The short diagonal lines indicate that multiple pins are used. For a specific CPU, a number will be given to tell how many.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    34

    Computer Buses (1)

    A computer system with multiple buses.

  • 18

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    35

    Computer Buses (2)

    Examples of bus masters and slaves.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    36

    Bus Width

    Growth of an Address bus over time.

  • 19

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    37

    Bus Clocking

    Read timing on a synchronous bus.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    38

    Asynchronous Buses

    Operation of an asynchronous bus.

  • 20

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    39

    Bus Arbitration (1)

    (a) A centralized one-level bus arbiter using daisy chaining.(b) The same arbiter, but with two levels.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    40

    Bus Arbitration (2)

    Decentralized bus arbitration.

  • 21

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    41

    Bus Operations (1)

    A block transfer.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    42

    Bus Operations (2)

    Use of the 8259A interrupt controller.

  • 22

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    43

    The Pentium 4

    The Pentium 4 physical pinout.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    44

    The Pentium 4s Logical Pinout

    Logical pinout of the Pentium 4. Names in upper case are the office are the official Intel names for individual signals. Names in mixed case are groups of related signals or signal descriptions.

  • 23

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    45

    Pipelining on the Pentium 4s Memory Bus

    Pipelining requests on the Pentium 4s memory bus.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    46

    The UltraSPARC III (1)

    The UltraSPARC III CPU chip.

  • 24

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    47

    The UltraSPARC III (2)

    The main features of the core of an UltraSPARC III system.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    48

    The PCI Bus (1)

    Architecture of an early Pentium system. The thicker buses have more bandwidth than the thinner ones but the figure is not to scale.

  • 25

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    49

    The PCI Bus (2)

    The bus structure of a modern Pentium 4.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    50

    PCI Bus Arbitration

    The PCI bus uses a centralized bus arbiter.

  • 26

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    51

    PCI Express

    A typical PCI Express system.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    52

    PCI Express Protocol Stack

    (a) The PCI Express protocol stack.(b) The format of a packet.

  • 27

    The Microarchitecture Level

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    54

    Speed Versus Cost

    1. Reduce the number of clock cycles needed to execute an instruction.

    2. Simplify the organization so that the clock cycle can be shorter.

    3. Overlap the execution of instructions.

  • 28

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    55

    Merging the Interpreter Loop with the Microcode (1)

    Original microprogram sequence for executing POP.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    56

    Merging the Interpreter Loop with the Microcode (2)

    Enhanced microprogram sequence for executing POP.

  • 29

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    57

    Pipelining

    Graphical illustration of

    how a pipeline works.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    58

    A Seven-Stage Pipeline

    The Mic-4 pipeline.

  • 30

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    59

    Cache Memory

    A system with three levels of cache.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    60

    Direct-Mapped Caches

    (a) A direct-mapped cache. (b) A 32-bit virtual address.

  • 31

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    61

    Set-Associative Caches

    A four-way set-associative cache.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    62

    Branch Prediction

    (a) A program fragment. (b) Its translation to a generic assembly language.

  • 32

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    63

    Dynamic Branch Prediction (1)

    (a) A 1-bit branch history. (b) A 2-bit branch history. (c) A mappingbetween branch instruction address and target address.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    64

    Dynamic Branch Prediction (2)

    A 2-bit finite-state machine for branch prediction.

  • 33

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    65

    Speculative Execution

    a) A program fragment. b) The corresponding basic block graph.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    66

    Overview of the NetBurst Microarchitecture

    The block diagram of the Pentium 4.

  • 34

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    67

    The NetBurst Pipeline

    A simplified view of the Pentium 4 data path.

    The Operating SystemMachine Level

  • 35

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    69

    Operating System Machine

    Positioning of the operating system machine level.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    70

    Paging

    A mapping in which virtual addresses 4096 to 8191 are mappedonto main memory addresses 0 to 4095.

  • 36

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    71

    Implementation of Paging (1)

    The first 64 KB of virtual address space divided into 16 pages, with each page being 4K.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    72

    Implementation of Paging (2)

    A 32 KB main memory divided up into eight page frames of 4 KB each.

  • 37

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    73

    Implementation of Paging (3)

    Formation of a main memory address from a virtual

    address.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    74

    Demand Paging and the Working Set Model

    A possible mapping of the first 16 virtual pages

    onto a main memory with eight page frames.

  • 38

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    75

    Page Replacement Policy

    Failure of the LRU algorithm.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    76

    Segmentation (1)

    In a one-dimensional address space with growing tables, one table may bump into another.

  • 39

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    77

    Segmentation (2)

    A segmented memory allows each table to grow or shrink independently of the other tables.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    78

    Segmentation (3)

    Comparison of paging and segmentation.

  • 40

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    79

    Implementation of Segmentation (1)

    (a)-(d) Development of external fragmentation. (e) Removal of the external fragmentation by compaction.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    80

    Implementation of Segmentation (2)

    Conversion of a two-part MULTICS address into a main memory address.

  • 41

    Parallel Computer Architectures

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    82

    Parallel Computer Architectures

    (a) On-chip parallelism. (b) A coprocessor. (c) A multiprocessor.(d) A multicomputer. (e) A grid.

  • 42

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    83

    Instruction-Level Parallelism

    (a) A CPU pipeline. (b) A sequence of VLIW instructions. (c) An instruction stream with bundles marked.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    84

    The TriMedia VLIW CPU

    A typical TriMedia instruction, showing five possible operations.

  • 43

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    85

    On-Chip Multithreading (1)

    (a) (c) Three threads. The empty boxes indicated that the threadhas stalled waiting for memory. (d) Fine-grained multithreading.

    (e) Coarse-grained multithreading.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    86

    On-Chip Multithreading (2)

    Multithreading with a dual-issue superscalar CPU. (a) Fine-grained multithreading.

    (b) Coarse-grained multithreading. (c) Simultaneous multithreading.

  • 44

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    87

    Hyperthreading on the Pentium 4

    Resource sharing between threads in the Pentium 4 NetBurst microarchitecture.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    88

    Homogeneous Multiprocessors on a Chip

    Single-chip multiprocessors. (a) A dual-pipeline chip. (b) A chip with two cores.

  • 45

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    89

    Heterogeneous Multiprocessors on a Chip (1)

    The logical structure of a simple DVD player contains a heterogeneousmultiprocessor containing multiple cores for different functions.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    90

    Heterogeneous Multiprocessors on a Chip (2)

    An example of the IBM CoreConnect architecture.

  • 46

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    91

    Introduction to Network Processors

    A typical network processor board and chip.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    92

    The Nexperia Media Processor

    The Nexperia heterogeneous multiprocessor on a chip.

  • 47

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    93

    Multiprocessors

    (a) A multiprocessor with 16 CPUs sharing a common memory.(b) An image partitioned into 16 sections, each being analyzed

    by a different CPU.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    94

    Multicomputers (1)

    (a) A multicomputer with 16 CPUs, each with its own private memory.(b) The bit-map image of Fig. 8-17 split up among the 16 memories.

  • 48

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    95

    Multicomputers (2)

    Various layers where shared memory can be implemented. (a) Thehardware. (b) The operating system. (c) The language runtime system.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    96

    Taxonomy of Parallel Computers (1)

    Flynns taxonomy of parallel computers.

  • 49

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    97

    Taxonomy of Parallel Computers (2)

    A taxonomy of parallel computers.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    98

    UMA Symmetric Multiprocessor Architectures

    Three bus-based multiprocessors. (a) Without caching. (b) Withcaching. (c) With caching and private memories.

  • 50

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    99

    UMA Multiprocessors Using Crossbar Switches

    (a) An 8 8 crossbar switch. (b) An open crosspoint. (c) A closed crosspoint.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    100

    UMA Multiprocessors Using Multistage Switching Networks

    An omega switching network.

  • 51

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    101

    NUMA Multiprocessors

    A NUMA machine based on two levels of buses. The Cm* wasthe first multiprocessor to use this design.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    102

    Cache Coherent NUMA Multiprocessors

    (a) A 256-node directory-based multiprocessor. (b) Division of a 32-bit memory address into fields. (c) The directory at node 36.

  • 52

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    103

    The Sun Fire E25K NUMA Multiprocessor (1)

    The Sun Microsystems E25K multiprocessor.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    104

    BlueGene (1)

    The BlueGene/L custom processor chip.

  • 53

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    105

    BlueGene (2)

    The BlueGene/L. (a) Chip. (b) Card. (c) Board. (d) Cabinet. (e) System.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    106

    Red Storm (1)

    Packaging of the Red Storm components.

  • 54

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    107

    Red Storm (2)

    The Red Storm system as viewed from above.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    108

    A Comparison of BlueGene/L and Red Storm

    A comparison of BlueGene/L and Red Storm.

  • 55

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    109

    Google (1)

    Processing of a Google query.

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    110

    Google (2)

    A typical Googlecluster.

  • 56

    Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0

    111

    Grid Computing

    The grid layers.

    /ColorImageDict > /JPEG2000ColorACSImageDict > /JPEG2000ColorImageDict > /AntiAliasGrayImages false /CropGrayImages true /GrayImageMinResolution 300 /GrayImageMinResolutionPolicy /OK /DownsampleGrayImages true /GrayImageDownsampleType /Bicubic /GrayImageResolution 300 /GrayImageDepth -1 /GrayImageMinDownsampleDepth 2 /GrayImageDownsampleThreshold 1.50000 /EncodeGrayImages true /GrayImageFilter /DCTEncode /AutoFilterGrayImages true /GrayImageAutoFilterStrategy /JPEG /GrayACSImageDict > /GrayImageDict > /JPEG2000GrayACSImageDict > /JPEG2000GrayImageDict > /AntiAliasMonoImages false /CropMonoImages true /MonoImageMinResolution 1200 /MonoImageMinResolutionPolicy /OK /DownsampleMonoImages true /MonoImageDownsampleType /Bicubic /MonoImageResolution 1200 /MonoImageDepth -1 /MonoImageDownsampleThreshold 1.50000 /EncodeMonoImages true /MonoImageFilter /CCITTFaxEncode /MonoImageDict > /AllowPSXObjects false /CheckCompliance [ /None ] /PDFX1aCheck false /PDFX3Check false /PDFXCompliantPDFOnly false /PDFXNoTrimBoxError true /PDFXTrimBoxToMediaBoxOffset [ 0.00000 0.00000 0.00000 0.00000 ] /PDFXSetBleedBoxToMediaBox true /PDFXBleedBoxToTrimBoxOffset [ 0.00000 0.00000 0.00000 0.00000 ] /PDFXOutputIntentProfile () /PDFXOutputConditionIdentifier () /PDFXOutputCondition () /PDFXRegistryName () /PDFXTrapped /False

    /Description > /Namespace [ (Adobe) (Common) (1.0) ] /OtherNamespaces [ > /FormElements false /GenerateStructure true /IncludeBookmarks false /IncludeHyperlinks false /IncludeInteractive false /IncludeLayers false /IncludeProfiles true /MultimediaHandling /UseObjectSettings /Namespace [ (Adobe) (CreativeSuite) (2.0) ] /PDFXOutputIntentProfileSelector /NA /PreserveEditing true /UntaggedCMYKHandling /LeaveUntagged /UntaggedRGBHandling /LeaveUntagged /UseDocumentBleed false >> ]>> setdistillerparams> setpagedevice