book

The Essentials of Computer Organization and Architecture, 4th Edition

by Linda Null, Julia Lobur

February 2014

Beginner

900 pages

28h 46m

English

Jones & Bartlett Learning

Read now

Unlock full access

1.1 Overview1.2 The Main Components of a Computer1.3 An Example System: Wading Through the Jargon1.4 Standards Organizations1.5 Historical Development1.5.1 Generation Zero: Mechanical Calculating Machines (1642–1945)1.5.2 The First Generation: Vacuum Tube Computers (1945–1953)1.5.3 The Second Generation: Transistorized Computers (1954–1965)1.5.4 The Third Generation: Integrated Circuit Computers (1965–1980)1.5.5 The Fourth Generation: VLSI Computers (1980–????)1.5.6 Moore’s Law1.6 The Computer Level Hierarchy1.7 Cloud Computing: Computing as a Service1.8 The Von Neumann Model1.9 Non–Von Neumann Models1.10 Parallel Processors and Parallel Computing1.11 Parallelism: Enabler of Machine Intelligence—Deep Blue and WatsonChapter SummaryFurther ReadingReferencesReview of Essential Terms and ConceptsExercises
2.1 Introduction2.2 Positional Numbering Systems2.3 Converting Between Bases2.3.1 Converting Unsigned Whole Numbers2.3.2 Converting Fractions2.3.3 Converting Between Power-of-Two Radices2.4 Signed Integer Representation2.4.1 Signed Magnitude2.4.2 Complement Systems2.4.3 Excess-M Representation for Signed Numbers2.4.4 Unsigned Versus Signed Numbers2.4.5 Computers, Arithmetic, and Booth’s Algorithm2.4.6 Carry Versus Overflow2.4.7 Binary Multiplication and Division Using Shifting2.5 Floating-Point Representation2.5.1 A Simple Model2.5.2 Floating-Point Arithmetic2.5.3 Floating-Point Errors2.5.4 The IEEE-754 Floating-Point Standard2.5.5 Range, Precision, and Accuracy2.5.6 Additional Problems with Floating-Point Numbers2.6 Character Codes2.6.1 Binary-Coded Decimal2.6.2 EBCDIC2.6.3 ASCII2.6.4 Unicode2.7 Error Detection and Correction2.7.1 Cyclic Redundancy Check2.7.2 Hamming Codes2.7.3 Reed-SolomonChapter SummaryFurther ReadingReferencesReview of Essential Terms and ConceptsExercisesFocus on Codes for Data Recording and Transmission2A.1 Non-Return-to-Zero Code2A.2 Non-Return-to-Zero-Invert Code2A.3 Phase Modulation (Manchester Code)2A.4 Frequency Modulation2A.5 Run-Length-Limited Code2A.6 Partial Response Maximum Likelihood Coding2A.7 SummaryExercises
3.1 Introduction3.2 Boolean Algebra3.2.1 Boolean Expressions3.2.2 Boolean Identities3.2.3 Simplification of Boolean Expressions3.2.4 Complements3.2.5 Representing Boolean Functions3.3 Logic Gates3.3.1 Symbols for Logic Gates3.3.2 Universal Gates3.3.3 Multiple Input Gates3.4 Digital Components3.4.1 Digital Circuits and Their Relationship to Boolean Algebra3.4.2 Integrated Circuits3.4.3 Putting It All Together: From Problem Description to Circuit3.5 Combinational Circuits3.5.1 Basic Concepts3.5.2 Examples of Typical Combinational Circuits3.6 Sequential Circuits3.6.1 Basic Concepts3.6.2 Clocks3.6.3 Flip-Flops3.6.4 Finite State Machines3.6.5 Examples of Sequential Circuits3.6.6 An Application of Sequential Logic: Convolutional Coding and Viterbi Detection3.7 Designing CircuitsChapter SummaryFurther ReadingReferencesReview of Essential Terms and ConceptsExercisesFocus on Karnaugh Maps3A.1 Introduction3A.2 Description of Kmaps and Terminology3A.3 Kmap Simplification for Two Variables3A.4 Kmap Simplification for Three Variables3A.5 Kmap Simplification for Four Variables3A.6 Don’t Care Conditions3A.7 SummaryExercises
4.1 Introduction4.2 CPU Basics and Organization4.2.1 The Registers4.2.2 The ALU4.2.3 The Control Unit4.3 The Bus4.4 Clocks4.5 The Input/Output Subsystem4.6 Memory Organization and Addressing4.7 Interrupts4.8 MARIE4.8.1 The Architecture4.8.2 Registers and Buses4.8.3 Instruction Set Architecture4.8.4 Register Transfer Notation4.9 Instruction Processing4.9.1 The Fetch–Decode–Execute Cycle4.9.2 Interrupts and the Instruction Cycle4.9.3 MARIE’s I/O4.10 A Simple Program4.11 A Discussion on Assemblers4.11.1 What Do Assemblers Do?4.11.2 Why Use Assembly Language?4.12 Extending Our Instruction Set4.13 A Discussion on Decoding: Hardwired Versus Microprogrammed Control4.13.1 Machine Control4.13.2 Hardwired Control4.13.3 Microprogrammed Control4.14 Real-World Examples of Computer Architectures4.14.1 Intel Architectures4.14.2 MIPS ArchitecturesChapter SummaryFurther ReadingReferencesReview of Essential Terms and ConceptsExercises

5.1 Introduction5.2 Instruction Formats5.2.1 Design Decisions for Instruction Sets5.2.2 Little Versus Big Endian5.2.3 Internal Storage in the CPU: Stacks Versus Registers5.2.4 Number of Operands and Instruction Length5.2.5 Expanding Opcodes5.3 Instruction Types5.3.1 Data Movement5.3.2 Arithmetic Operations5.3.3 Boolean Logic Instructions5.3.4 Bit Manipulation Instructions5.3.5 Input/Output Instructions5.3.6 Instructions for Transfer of Control5.3.7 Special-Purpose Instructions5.3.8 Instruction Set Orthogonality5.4 Addressing5.4.1 Data Types5.4.2 Address Modes5.5 Instruction Pipelining5.6 Real-World Examples of ISAs5.6.1 Intel5.6.2 MIPS5.6.3 Java Virtual Machine5.6.4 ARMChapter SummaryFurther ReadingReferencesReview of Essential Terms and ConceptsExercises
6.1 Introduction6.2 Types of Memory6.3 The Memory Hierarchy6.3.1 Locality of Reference6.4 Cache Memory6.4.1 Cache Mapping Schemes6.4.2 Replacement Policies6.4.3 Effective Access Time and Hit Ratio6.4.4 When Does Caching Break Down?6.4.5 Cache Write Policies6.4.6 Instruction and Data Caches6.4.7 Levels of Cache6.5 Virtual Memory6.5.1 Paging6.5.2 Effective Access Time Using Paging6.5.3 Putting It All Together: Using Cache, TLBs, and Paging6.5.4 Advantages and Disadvantages of Paging and Virtual Memory6.5.5 Segmentation6.5.6 Paging Combined with Segmentation6.6 A Real-World Example of Memory ManagementChapter SummaryFurther ReadingReferencesReview of Essential Terms and ConceptsExercises
7.1 Introduction7.2 I/O and Performance7.3 Amdahl’ s Law7.4 I/O Architectures7.4.1 I/O Control Methods7.4.2 Character I/O Versus Block I/O7.4.3 I/O Bus Operation7.5 Data Transmission Modes7.5.1 Parallel Data Transmission7.5.2 Serial Data Transmission7.6 Magnetic Disk Technology7.6.1 Rigid Disk Drives7.6.2 Solid State Drives7.7 Optical Disks7.7.1 CD-ROM7.7.2 DVD7.7.3 Blue-Violet Laser Discs7.7.4 Optical Disk Recording Methods7.8 Magnetic Tape7.9 RAID7.9.1 RAID Level 07.9.2 RAID Level 17.9.3 RAID Level 27.9.4 RAID Level 37.9.5 RAID Level 47.9.6 RAID Level 57.9.7 RAID Level 67.9.8 RAID DP7.9.9 Hybrid RAID Systems7.10 The Future of Data StorageChapter SummaryFurther ReadingReferencesReview of Essential Terms and ConceptsExercisesFocus on Data Compression7A.1 Introduction7A.2 Statistical Coding7A.2.1 Huffman Coding7A.2.2 Arithmetic Coding7A.3 Ziv-Lempel (LZ) Dictionary Systems7A.4 GIF and PNG Compression7A.5 JPEG Compression7A.6 MP3 Compression7A.7 SummaryFurther ReadingReferencesExercises
8.1 Introduction8.2 Operating Systems8.2.1 Operating Systems History8.2.2 Operating System Design8.2.3 Operating System Services8.3 Protected Environments8.3.1 Virtual Machines8.3.2 Subsystems and Partitions8.3.3 Protected Environments and the Evolution of Systems Architectures8.4 Programming Tools8.4.1 Assemblers and Assembly8.4.2 Link Editors8.4.3 Dynamic Link Libraries8.4.4 Compilers8.4.5 Interpreters8.5 Java: All of the Above8.6 Database Software8.7 Transaction ManagersChapter SummaryFurther ReadingReferencesReview of Essential Terms and ConceptsExercises
9.1 Introduction9.2 RISC Machines9.3 Flynn’s Taxonomy9.4 Parallel and Multiprocessor Architectures9.4.1 Superscalar and VLIW9.4.2 Vector Processors9.4.3 Interconnection Networks9.4.4 Shared Memory Multiprocessors9.4.5 Distributed Computing9.5 Alternative Parallel Processing Approaches9.5.1 Dataflow Computing9.5.2 Neural Networks9.5.3 Systolic Arrays9.6 Quantum ComputingChapter SummaryFurther ReadingReferencesReview of Essential Terms and ConceptsExercises
10.1 Introduction10.2 An Overview of Embedded Hardware10.2.1 Off-the-Shelf Embedded System Hardware10.2.2 Configurable Hardware10.2.3 Custom-Designed Embedded Hardware10.3 An Overview of Embedded Software10.3.1 Embedded Systems Memory Organization10.3.2 Embedded Operating Systems10.3.3 Embedded Systems Software DevelopmentChapter SummaryFurther ReadingReferencesReview of Essential Terms and ConceptsExercises
11.1 Introduction11.2 Computer Performance Equations11.3 Mathematical Preliminaries11.3.1 What the Means Mean11.3.2 The Statistics and Semantics11.4 Benchmarking11.4.1 Clock Rate, MIPS, and FLOPS11.4.2 Synthetic Benchmarks: Whetstone, Linpack, and Dhrystone11.4.3 Standard Performance Evaluation Corporation Benchmarks11.4.4 Transaction Processing Performance Council Benchmarks11.4.5 System Simulation11.5 CPU Performance Optimization11.5.1 Branch Optimization11.5.2 Use of Good Algorithms and Simple Code11.6 Disk Performance11.6.1 Understanding the Problem11.6.2 Physical Considerations11.6.3 Logical ConsiderationsChapter SummaryFurther ReadingReferencesReview of Essential Terms and ConceptsExercises
12.1 Introduction12.2 Early Business Computer Networks12.3 Early Academic and Scientific Networks: The Roots and Architecture of the Internet12.4 Network Protocols I: ISO/OSI Protocol Unification12.4.1 A Parable12.4.2 The OSI Reference Model12.5 Network Protocols II: TCP/IP Network Architecture12.5.1 The IP Layer for Version 412.5.2 The Trouble with IP Version 412.5.3 Transmission Control Protocol12.5.4 The TCP Protocol at Work12.5.5 IP Version 612.6 Network Organization12.6.1 Physical Transmission Media12.6.2 Interface Cards12.6.3 Repeaters12.6.4 Hubs12.6.5 Switches12.6.6 Bridges and Gateways12.6.7 Routers and Routing12.7 The Fragility of the InternetChapter SummaryFurther ReadingReferencesReview of Essential Terms and ConceptsExercises
13.1 Introduction13.2 SCSI Architecture13.2.1 “Classic” Parallel SCSI13.2.2 The SCSI Architecture Model-313.3 Internet SCSI13.4 Storage Area Networks13.5 Other I/O Connections13.5.1 Parallel Buses: XT to ATA13.5.2 Serial ATA and Serial Attached SCSI13.5.3 Peripheral Component Interconnect13.5.4 A Serial Interface: USB13.6 Cloud StorageChapter SummaryFurther ReadingReferencesReview of Essential Terms and ConceptsExercises
A.1 IntroductionA.2 Fundamental StructuresA.2.1 ArraysA.2.2 Queues and Linked ListsA.2.3 StacksA.3 TreesA.4 Network GraphsSummaryFurther ReadingReferencesExercises

Overview

Updated and revised, The Essentials of Computer Organization and Architecture, Third Edition is a comprehensive resource that addresses all of the necessary organization and architecture topics, yet is appropriate for the one-term course.