深入理解计算机系统
￥ 65 2.7折 ￥ 239 九五品
仅1件
北京通州
认证卖家担保交易快速发货售后保障
作者[美] 兰德尔 E.布莱恩特
出版社机械工业出版社
ISBN9787111561279
出版时间2017-04
版次1
装帧平装
开本16开
纸张胶版纸
页数1045页
字数99999千字
定价239元
上书时间2024-12-07
商品详情
- 品相描述：九五品
- 商品描述
-
基本信息
书名:深入理解计算机系统
定价：239.00元
作者:[美] 兰德尔 E.布莱恩特
出版社：机械工业出版社
出版日期：2017-04-01
ISBN：9787111561279
字数：500000
页码：1045
版次：1
装帧：平装
开本：16开
商品重量：
编辑推荐
内容提要
本书从程序员的视角详细阐述计算机系统的本质概念，并展示这些概念如何实实在在地影响应用程序的正确性、性能和实用性。全书共12章，主要包括信息的表示和处理、程序的机器级表示、处理器体系结构、优化程序性能、存储器层次结构、链接、异常控制流、虚拟存储器、系统级I/O、网络编程、并发编程等内容。书中提供了大量的例子和练习题，并给出部分答案，有助于读者加深对正文所述概念和知识的理解。
目录
ContentsPreface x About the Authors xxxv 1 A Tour of Computer Systems 1 1.1Information Is Bits Context 3 1.2Programs Are Translated by Other Programs into Different Forms 4 1.3It Pays to Understand How Compilation Systems Work 6 1.4Processors Read and Interpret Instructions Stored in Memory 7 1.4.1Hardware Organization of a System 8 1.4.2Running the helloProgram 10 1.5Caches Matter 11 1.6Storage Devices Form a Hierarchy 14 1.7The Operating System Manages the Hardware 14 1.7.1Processes 15 1.7.2Threads 17 1.7.3Virtual Memory 18 1.7.4Files 19 1.8Systems Communicate with Other Systems Using Networks 19 1.9Important Themes 22 1.9.1Amdahl’s Law 22 1.9.2Concurrency and Parallelism 24 1.9.3The Importance of Abstractions in Computer Systems 26 1.10Summary 27 Bibliographic Notes 28 Solutions to Practice Problems 28 Part I Program Structure and Execution 2 Representing and Manipulating Information 31 2.1Information Storage 34 2.1.1Hexadecimal Notation 36 2.1.2Data Sizes 39 2.1.3 Addressing and Byte Ordering 42 2.1.4 Representing Strings 49 2.1.5 Representing Code 49 2.1.6 Introduction to Boolean Algebra 50 2.1.7 Bit-Level Operations in C 54 2.1.8 Logical Operations in C 56 2.1.9 Shift Operations in C 57 2.2 Integer Representations 59 2.2.1 Integral Data Types 60 2.2.2 Unsigned Encodings 62 2.2.3 Two’s-Complement Encodings 64 2.2.4 Conversions between Signed and Unsigned 70 2.2.5 Signed versus Unsigned in C 74 2.2.6 Expanding the Bit Representation of a Number 76 2.2.7 Truncating Numbers 81 2.2.8 Advice on Signed versus Unsigned 83 2.3 Integer Arithmetic 84 2.3.1 Unsigned Addition 84 2.3.2 Two’s-Complement Addition 90 2.3.3 Two’s-Complement Negation 95 2.3.4 Unsigned Multiplication 96 2.3.5 Two’s-Complement Multiplication 97 2.3.6 Multiplying by Constants 101 2.3.7 Dividing by Powers of 2 103 2.3.8 Final Thoughts on Integer Arithmetic 107 2.4 Floating Point 108 2.4.1 Fractional Binary Numbers 109 2.4.2 IEEE Floating-Point Representation 112 2.4.3 Example Numbers 115 2.4.4 Rounding 120 2.4.5 Floating-Point Operations 122 2.4.6 Floating Point in C 124 2.5 Summary 126 Bibliographic Notes 127 Homework Problems 128 Solutions to Practice Problems 143 3 Machine-Level Representation of Programs 163 3.1 A Historical Perspective 166 3.2Program Encodings 169 3.2.1Machine-Level Code 170 3.2.2Code Examples 172 3.2.3Notes on Formatting 175 3.3Data Formats 177 3.4Accessing Information 179 3.4.1Operand Speci.ers 180 3.4.2Data Movement Instructions 182 3.4.3Data Movement Example 186 3.4.4Pushing and Popping Stack Data 189 3.5Arithmetic and Logical Operations 191 3.5.1Load Effective Address 191 3.5.2Unary and Binary Operations 194 3.5.3Shift Operations 194 3.5.4Discussion 196 3.5.5Special Arithmetic Operations 197 3.6Control 200 3.6.1Condition Codes 201 3.6.2Accessing the Condition Codes 202 3.6.3Jump Instructions 205 3.6.4Jump Instruction Encodings 207 3.6.5Implementing Conditional Branches withConditional Control 2093.6.6Implementing Conditional Branches withConditional Moves 2143.6.7Loops 220 3.6.8Switch Statements 232 3.7Procedures 238 3.7.1The Run-Time Stack 239 3.7.2Control Transfer 241 3.7.3Data Transfer 245 3.7.4Local Storage on the Stack 248 3.7.5Local Storage in Registers 251 3.7.6Recursive Procedures 253 3.8Array Allocation and Access 255 3.8.1Basic Principles 255 3.8.2Pointer Arithmetic 257 3.8.3Nested Arrays 258 3.8.4Fixed-Size Arrays 260 3.8.5Variable-Size Arrays 262 3.9 Heterogeneous Data Structures 265 3.9.1 Structures 265 3.9.2 Unions 269 3.9.3 Data Alignment 273 3.10 Combining Control and Data in Machine-Level Programs 276 3.10.1 Understanding Pointers 277 3.10.2 Life in the Real World: Using the gdbDebugger 279 3.10.3 Out-of-Bounds Memory References and Buffer Over.ow 279 3.10.4 Thwarting Buffer Over.ow Attacks 284 3.10.5 Supporting Variable-S
作者介绍
Randal E. Bryant1973年获得密歇根大学学士学位，随即就读麻省理工学院的研究生院，并在1981年获得计算机博士学位。从1984年至今一直任教于卡内基-梅隆大学，现在是卡内基-梅隆大学计算机科学学院院长、教授，同时受邀任教于工学院电子与计算机工程系。他还是ACM院士、IEEE院士和美国国家工程院院士。其研究成果获得过数项大奖，其中包括Semiconductor Research Corporation颁发的两个发明荣誉奖和一个技术成就奖，ACM颁发的Kanellakis理论与实践奖，还有IEEE颁发的W. R. G. Baker奖、Emmanuel Piore奖和Phil Kaufman奖。David R. O,Hallaro拥有弗吉尼亚大学计算机科学博士学位，现为Intel匹兹堡实验室主任，卡内基-梅隆大学计算机科学和电子与计算机工程副教授。他曾获得卡内基-梅隆大学计算机科学学院颁发的Herbert Simon杰出教学奖，并同Quake项目中其他成员一起获得了高性能计算领域中的高国际奖项——Gordon Bell奖。
序言
-
【封面】
— 没有更多了 —
以下为对购买帮助不大的评价