Douglas Comer is a Distinguished Professor of Computer Science at Purdue University with a courtesy appointment in Purdue's Electrical and Computer Engineering Department. He has created and taught courses for undergraduate students, graduate students, engineers, and nontechnical audiences, on a variety of topics, including computer architecture, operating systems, computer networks, the Internet, digital literacy, and cloud computing. Comer has authored seventeen textbooks. His books have been translated into sixteen languages, and widely used in industry as well as academia. In addition to teaching at Purdue, Comer continues to lecture at companies and industry conferences. He is the recipient of multiple teaching awards and a Fellow of the ACM. An internationally recognized authority on computer networking, the Internet and the TCP/IP protocols, he is a member of the Internet Hall of Fame.

Preface
Chapter 1 Introduction and Overview
Chapter 2 Program Interpretation and Transformation
Chapter 3 Data and Program Representation
Chapter 4 A High-Level Overview of Processors
Chapter 5 Instruction Stes and Operands
Chapter 6 Operand Addressing and Operand Types
Chapter 7 Assembly Languages and Programming Paradigm
Chapter 8 Main Memory and Memory Addressing
Chapter 9 Virtual Memory Technologies and Virtual Addressing
Chapter 10 Caches and Caching
Chapter 11 Storage: File Systems, Blocks and SSDs
Chapter 12 A Programmer's View of Devices, I/O, and Buffering
Chapter 13 Buses and Bus Architectures
Chapter 14 Programming Devices and Interrupt-Driven I/O
Chapter 15 Data Paths and Instruction Execution
Chapter 16 CPUs: Micrcode, Protection, and Processor Modes
Chapter 17 Parallelism
Chapter 18 Data Pipelining
Chapter 19 Assessing Performance
Chapter 20 Multicore Processors
Chapter 21 Power and Energy
Chapter 22 Building Blocks: Transistors, Gates and Clocks
Chapter 23 Hardware Modularity
Appendix 1 Rules for Boolean Algebra Simplification
Appendix 2 A Quick Introduction to x86 Assembly Language
Appendix 3 ARM Register Definitions and Calling Sequence
Appendix 4 Lab Exercises for a Computer Architecture Course