book

Computer Organization and Design MIPS Edition, 6th Edition

Name: Computer Organization and Design MIPS Edition, 6th Edition
ISBN: 9780128226742

by David A. Patterson, John L. Hennessy

November 2020

Intermediate to advanced

832 pages

37h 45m

English

Morgan Kaufmann

Read now

Unlock full access

Cover image
Title page
Table of Contents
In Praise of Computer Organization and Design: The Hardware/Software Interface, Sixth Edition
Copyright
Dedication
Preface
About This BookAbout the Other BookChanges for the Sixth EditionInstructor SupportConcluding RemarksAcknowledgments for the Sixth Edition
1. Computer Abstractions and Technology
1.1 Introduction1.2 Seven Great Ideas in Computer Architecture1.3 Below Your Program1.4 Under the Covers1.5 Technologies for Building Processors and Memory1.6 Performance1.7 The Power Wall1.8 The Sea Change: The Switch from Uniprocessors to Multiprocessors1.9 Real Stuff: Benchmarking the Intel Core i71.10 Going Faster: Matrix Multiply in Python1.11 Fallacies and Pitfalls1.12 Concluding Remarks Historical Perspective and Further Reading1.13 Historical Perspective and Further Reading1.14 Self-Study1.15 Exercises
2. Instructions: Language of the Computer
2.1 Introduction2.2 Operations of the Computer Hardware2.3 Operands of the Computer Hardware2.4 Signed and Unsigned Numbers2.5 Representing Instructions in the Computer2.6 Logical Operations2.7 Instructions for Making Decisions2.8 Supporting Procedures in Computer Hardware2.9 Communicating with People
2.10 MIPS Addressing for 32-bit Immediates and Addresses
2.11 Parallelism and Instructions: Synchronization2.12 Translating and Starting a Program2.13 A C Sort Example to Put It All Together2.14 Arrays versus Pointers

Advanced Material: Compiling C and Interpreting Java
2.15 Advanced Material: Compiling C and Interpreting Java2.16 Real Stuff: ARMv7 (32-bit) Instructions2.17 Real Stuff: ARMv8 (64-bit) Instructions2.18 Real Stuff: RISC-V Instructions2.19 Real Stuff: x86 Instructions2.20 Going Faster: Matrix Multiply in C2.21 Fallacies and Pitfalls2.22 Concluding Remarks Historical Perspective and Further Reading2.21 Historical Perspective and Further Reading2.24 Self-Study2.25 Exercises
3. Arithmetic for Computers
3.1 Introduction3.2 Addition and Subtraction3.3 Multiplication3.4 Division3.5 Floating Point3.6 Parallelism and Computer Arithmetic: Subword Parallelism3.7 Real Stuff: Streaming SIMD Extensions and Advanced Vector Extensions in x863.8 Going Faster: Subword Parallelism and Matrix Multiply3.9 Fallacies and Pitfalls3.10 Concluding Remarks Historical Perspective and Further Reading3.11 Historical Perspective and Further Reading3.12 Self-Study3.13 Exercises
4. The Processor
4.1 Introduction4.2 Logic Design Conventions4.3 Building a Datapath4.4 A Simple Implementation Scheme A Multicycle Implementation4.5 A Multicycle Implementation4.6 An Overview of Pipelining4.7 Pipelined Datapath and Control4.8 Data Hazards: Forwarding versus Stalling
4.9 Control Hazards
4.10 Exceptions4.11 Parallelism via Instructions4.12 Putting It All Together: The Intel Core i7 6700 and ARM Cortex-A53The ARM Cortex-A53Performance of the A53 PipelineThe Intel Core i7 6700Performance of the i74.13 Going Faster: Instruction-Level Parallelism and Matrix Multiply Advanced Topic: an Introduction to Digital Design Using a Hardware Design Language to Describe and Model a Pipeline and More Pipelining Illustrations4.14 An Introduction to Digital Design Using a Hardware Design Language to Describe and Model a Pipeline and More Pipelining Illustrations4.15 Fallacies and Pitfalls4.16 Concluding Remarks Historical Perspective and Further Reading4.17 Historical Perspective and Further Reading4.18 Self StudySelf-Study Answers4.19 Exercises
5. Large and Fast: Exploiting Memory Hierarchy
5.1 Introduction5.2 Memory Technologies5.3 The Basics of Caches5.4 Measuring and Improving Cache Performance5.5 Dependable Memory Hierarchy5.6 Virtual Machines5.7 Virtual Memory
5.8 A Common Framework for Memory Hierarchy
5.9 Using a Finite-State Machine to Control a Simple Cache5.10 Parallelism and Memory Hierarchy: Cache Coherence Parallelism and Memory Hierarchy: Redundant Arrays of Inexpensive Disks5.11 Parallelism and the Memory Hierarchy: Redundant Arrays of Inexpensive Disks Advanced Material: Implementing Cache Controllers5.12 Advanced Material: Implementing Cache Controllers
5.13 Real Stuff: The ARM Cortex-A8 and Intel Core i7 Memory Hierarchies
Performance of the Cortex-A53 and Core i7 Memory Hierarchies5.14 Going Faster: Cache Blocking and Matrix Multiply5.15 Fallacies and Pitfalls5.16 Concluding Remarks Historical Perspective and Further Reading5.17 Historical Perspective and Further Reading5.18 Self-StudySelf-Study Answers5.19 Exercises
6. Parallel Processors from Client to Cloud
6.1 Introduction6.2 The Difficulty of Creating Parallel Processing Programs6.3 SISD, MIMD, SIMD, SPMD, and Vector6.4 Hardware Multithreading6.5 Multicore and Other Shared Memory Multiprocessors6.6 Introduction to Graphics Processing Units6.7 Domain Specific Architectures6.8 Clusters, Warehouse Scale Computers, and Other Message-Passing Multiprocessors
6.9 Introduction to Multiprocessor Network Topologies
Communicating to the Outside World: Cluster Networking6.10 Communicating to the Outside World: Cluster Networking6.11 Multiprocessor Benchmarks and Performance Models6.12 Real Stuff: Benchmarking the Google TPUv3 Supercomputer and an NVIDIA Volta GPU Cluster6.13 Going Faster: Multiple Processors and Matrix Multiply6.14 Fallacies and Pitfalls6.15 Concluding Remarks Historical Perspective and Further Reading6.16 Historical Perspective and Further Reading6.17 Self-StudyAnswers to Self-Study6.18 Exercises
Appendices
Appendix A. Assemblers, Linkers, and the SPIM Simulator
A.1 IntroductionA.2 AssemblersA.3 LinkersA.4 LoadingA.5 Memory UsageA.6 Procedure Call ConventionA.7 Exceptions and InterruptsA.8 Input and OutputA.9 SPIMA.10 MIPS R2000 Assembly LanguageA.11 Concluding RemarksA.12 ExercisesFurther Reading
Appendix B. The Basics of Logic Design
B.1 IntroductionB.2 Gates, Truth Tables, and Logic EquationsB.3 Combinational LogicB.4 Using a Hardware Description LanguageB.5 Constructing a Basic Arithmetic Logic UnitB.6 Faster Addition: Carry Lookahead
B.7 Clocks
B.8 Memory Elements: Flip-Flops, Latches, and RegistersB.9 Memory Elements: SRAMs and DRAMsB.10 Finite-State MachinesB.11 Timing MethodologiesB.12 Field Programmable DevicesB.13 Concluding RemarksB.14 ExercisesFurther Reading
Appendix C. Graphics and Computing GPUs
C.1 IntroductionC.2 GPU System ArchitecturesC.3 Programming GPUsC.4 Multithreaded Multiprocessor ArchitectureC.5 Parallel Memory SystemC.6 Floating-point ArithmeticC.7 Real Stuff: The NVIDIA GeForce 8800C.8 Real Stuff: Mapping Applications to GPUsC.9 Fallacies and PitfallsC.10 Concluding RemarksC.11 Historical Perspective and Further ReadingFurther Reading
Appendix D. Mapping Control to Hardware
D.1 IntroductionD.2 Implementing Combinational Control UnitsD.3 Implementing Finite-State Machine ControlD.4 Implementing the Next-State Function with a SequencerD.5 Translating a Microprogram to HardwareD.6 Concluding RemarksD.7 Exercises
Appendix E. Survey of Instruction Set Architectures
E.1 IntroductionE.2 A Survey of RISC Architectures for Desktop, Server, and Embedded ComputersE.3 The Intel 80x86E.4 The VAX ArchitectureE.5 The IBM 360/370 Architecture for Mainframe ComputersE.6 Historical Perspective and References
Glossary
Further Reading
Index
MIPS Reference Data Card (“Green Card”)

Content preview from Computer Organization and Design MIPS Edition, 6th Edition

Note the repeated appearance of (ai · bi) and (ai + bi) in the formula above. These two important factors are traditionally called generate (gi) and propagate (pi):

$\begin{matrix} g i = a i \cdot b i \\ p i = a i + b i \end{matrix}$

Using them to define ci + 1, we get

$c i + 1 = g i + p i \cdot c i$

To see where the signals get their names, suppose gi is 1. Then

$c i + 1 = g i + p i \cdot c i = 1 + p i \cdot c i = 1$

That is, the adder

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

Read now

Unlock full access

More than 5,000 organizations count on O’Reilly

O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.

Julian F.

Head of Cybersecurity

I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.

Addison B.

Field Engineer

I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.

Amir M.

Data Platform Tech Lead

I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.

Mark W.

Embedded Software Engineer

Computer Organization and Design RISC-V Edition

Publisher Resources

ISBN: 9780128226742

Cloud Computing

Data Engineering

Data Science

AI & ML

Programming Languages

Software Architecture

IT/Ops

Security

Design

Business

Soft Skills

Computer Organization and Design MIPS Edition, 6th Edition

by David A. Patterson, John L. Hennessy

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.