Key Features
- Winner of a 2014 Texty Award from the Text and Academic Authors Association
- Includes new examples, exercises, and material highlighting the emergence of mobile computing and the cloud
- Covers parallelism in depth with examples and content highlighting parallel hardware and software topics
- Features the Intel Core i7, ARM Cortex-A8 and NVIDIA Fermi GPU as real-world examples throughout the book
- Adds a new concrete example, "Going Faster," to demonstrate how understanding hardware can inspire software optimizations that improve performance by 200 times
- Discusses and highlights the "Eight Great Ideas" of computer architecture: Performance via Parallelism; Performance via Pipelining; Performance via Prediction; Design for Moore's Law; Hierarchy of Memories; Abstraction to Simplify Design; Make the Common Case Fast; and Dependability via Redundancy
- Includes a full set of updated and improved exercises
1 Computer Abstractions and Technology1.1 Introduction 1.2 Eight Great Ideas in Computer Architecture 1.3 Below Your Program 1.4 Under the Covers 1.5 Technologies for Building Processors and Memory 1.6 Performance 1.7 The Power Wall 1.8 The Sea Change: The Switch from Uniprocessors to Multiprocessors 1.9 Real Stuff: Benchmarking the Intel Core i7 1.10 Fallacies and Pitfalls 1.11 Concluding Remarks 1.12 Historical Perspective and Further Reading 1.13 Exercises
2 Instructions: Language of the Computer 2.1 Introduction 2.2 Operations of the Computer Hardware 2.3 Operands of the Computer Hardware 2.4 Signed and Unsigned Numbers 2.5 Representing Instructions in theComputer 2.6 Logical Operations 2.7 Instructions for Making Decisions 2.8 Supporting Procedures in Computer Hardware 2.9 Communicating with People 2.10 MIPS Addressing for 32-Bit Immediates and Addresses 2.11 Parallelism and Instructions: Synchronization 2.12 Translating and Starting a Program 2.13 A C Sort Example to Put It All Together 2.14 Arrays versus Pointers 2.15 Advanced Material: Compiling C and Interpreting Java 2.16 Real Stuff: ARM v7 (32-bit) Instructions 2.17 Real Stuff: x86 Instructions 2.18 Real Stuff: ARM v8 (64-bit) Instructions 2.19 Fallacies and Pitfalls 2.20 Concluding Remarks 2.21 Historical Perspective and Further Reading 2.22 Exercises
3 Arithmetic for Computers 3.1 Introduction 3.2 Addition and Subtraction 3.3 Multiplication 3.4 Division 3.5 Floating Point 3.6 Parallelism and Computer Arithmetic: Subword Parallelism 3.7 Real Stuff: x86 Streaming SIMD Extensions and Advanced Vector Extensions 3.8 Going Faster: Subword Parallelism and Matrix Multiply 3.9 Fallacies and Pitfalls 3.10 Concluding Remarks 3.11 Historical Perspective and Further Reading 3.12 Exercises
4 The Processor 4.1 Introduction 4.2 Logic Design Conventions 4.3 Building a Datapath 4.4 A Simple Implementation Scheme 4.5 An Overview of Pipelining 4.6 Pipelined Datapath and Control 4.7 Data Hazards: Forwarding versus Stalling 4.8 Control Hazards 4.9 Exceptions 4.10 Parallelism via Instructions 4.11 Real Stuff: The ARM Cortex-A8 and Intel Core i7 Pipelines 4.12 Going Faster: Instruction-Level Parallelism and Matrix Multiply 4.13 Advanced Topic: an Introduction to Digital Design Using a Hardware Design Language to Describe and Model a Pipeline and More Pipelining Illustrations 4.14 Fallacies and Pitfalls 4.15 Concluding Remarks 4.16 Historical Perspective and Further Reading 4.17 Exercises XXX
5 Large and Fast: Exploiting Memory Hierarchy 5.1 Introduction 5.2 Memory Technologies 5.3 The Basics of Caches 5.4 Measuring and Improving Cache Performance 5.5 Dependable Memory 5.6 Virtual Machines 5.7 Virtual Memory 5.8 A Common Framework for Memory Hierarchy 5.9 Using a Finite-State Machine to Control a Simple Cache 5.10 Parallelism and Memory Hierarchies: Cache Coherence 5.11 Parallelism and Memory Hierarchy: Redundant Arrays of Inexpensive Disks 5.12 Advanced Material: Implementing Cache Controllers 5.13 Real Stuff: The ARM Cortex-A8 and Intel Core i7 Memory Hierarchies 5.14 Going Faster: Cache Blocking and Matrix Multiply 5.15 Fallacies and Pitfalls 5.16 Concluding Remarks 5.17 Historical Perspective and Further Reading 5.18 Exercises
6 Parallel Processors from Client to Cloud 6.1 Introduction 6.2 The Difficulty of Creating Parallel Processing Programs 6.3 SISD, MIMD, SIMD, SPMD, and Vector 6.4 Hardware Multithreading 6.5 Multicore and Other Shared Memory Multiprocessors 6.6 Introduction to Graphics Processing Units 6.7 Clusters and Other Message-Passing Multiprocessors 6.8 Introduction to Multiprocessor Network Topologies 6.9 Communicating to the Outside World: Cluster Networking 6.10 Multiprocessor Benchmarks and Performance Models 6.11 Real Stuff: Benchmarking Intel Core i7 versus NVIDIA Fermi GPU 6.12 Going Faster: Multiple Processors and Matrix Multiply 6.13 Fallacies and Pitfalls 6.14 Concluding Remarks 6.15 Historical Perspective and Further Reading 6.16 Exercises
APPENDICESA Assemblers, Linkers, and the SPIM Simulator A.1 Introduction A-3A.2 Assemblers A-10A.3 Linkers A-18A.4 Loading A-19A.5 Memory Usage A-20A.6 Procedure Call Convention A-22A.7 Exceptions and Interrupts A-33A.8 Input and Output A-38A.9 SPIM A-40A.10 MIPS R2000 Assembly Language A-45A.11 Concluding Remarks A-81A.12 Exercises A-82
B The Basics of Logic DesignB.1 Introduction B-3B.2 Gates, Truth Tables, and Logic Equations B-4B.3 Combinational Logic B-9B.4 Using a Hardware Description Language B-20B.5 Constructing a Basic Arithmetic Logic Unit B-26B.6 Faster Addition: Carry Lookahead B-38B.7 Clocks B-48B.8 Memory Elements: Flip-Flops, Latches, and Registers B-50B.9 Memory Elements: SRAMs and DRAMs B-58B.10 Finite-State Machines B-67B.11 Timing Methodologies B-72B.12 Field Programmable Devices B-78B.13 Concluding Remarks B-79B.14 Exercises B-80
ONLINE CONTENTC Graphics and Computing GPUs C.1 Introduction C-3C.2 GPU System Architectures C-7C.3 Programming GPUs C-12C.4 Multithreaded Multiprocessor Architecture C-25C.5 Parallel Memory System C-36C.6 Floating Point Arithmetic C-41C.7 Real Stuff: The NVIDIA GeForce 8800 C-46C.8 Real Stuff: Mapping Applications to GPUs C-55C.9 Fallacies and Pitfalls C-72C.10 Concluding Remarks C-76C.11 Historical Perspective and Further Reading C-77
D Mapping Control to Hardware D.1 Introduction D-3D.2 Implementing Combinational Control Units D-4D.3 Implementing Finite-State Machine Control D-8D.4 Implementing the Next-State Function with a Sequencer D-22D.5 Translating a Microprogram to Hardware D-28D.6 Concluding Remarks D-32D.7 Exercises D-33
E A Survey of RISC Architectures for Desktop, Server, and Embedded ComputersE.1 Introduction E-3E.2 Addressing Modes and Instruction Formats E-5E.3 Instructions: The MIPS Core Subset E-9E.4 Instructions: Multimedia Extensions of theDesktop/Server RISCs E-16E.5 Instructions: Digital Signal-Processing Extensions of the Embedded RISCs E-19E.6 Instructions: Common Extensions to MIPS Core E-20E.7 Instructions Unique to MIPS-64 E-25E.8 Instructions Unique to Alpha E-27E.9 Instructions Unique to SPARC v.9 E-29E.10 Instructions Unique to PowerPC E-32E.11 Instructions Unique to PA-RISC 2.0 E-34E.12 Instructions Unique to ARM E-36E.13 Instructions Unique to Thumb E-38E.14 Instructions Unique to SuperH E-39E.15 Instructions Unique to M32R E-40E.16 Instructions Unique to MIPS-16 E-40E.17 Concluding Remarks E-43
This book is a great resource for computer science and computer engineering students from various standpoints. It gives in-depth knowledge of computer organization, datapath and cache. It is a solid reference book for this class.