Recommended 2 super classic books

Recommend to all friends I think is a very good book, a matter Another one is This book doesn't know what to say, in short, Tan Grandpa's strong n times, English original $ 40, can't afford it! English's photocopy version is currently not bought, it is said to have been out of print, hehe! Didn't get it, but China-pub can bought it in English original 220 yuan! Strongly recommended Special Thank Yanq to buy the second book for me, super invincible thanks! The English version of this book has been famous. He is called "the greatest computer textbook" by many professionals. The famous American Carnegie University's Computer Science Department has always used this book as a teaching material. The thorough story of programmer's eyes The Ding's work. Author Randal E. Bryant is Director of Computer Science, ACM and IEEE Double Academic Secretary, ACM and IEEE Double Academy (FELLOW), which has received many ACMs and IEEE awards. This book is divided into thirteen chapters, which introduces the representation and processing of information. The machine-level representation of the program, the processor architecture, memory hierarchy, static and dynamic links, virtual storage, system level I / O, network programming and concurrency Programming and other exciting content. Its purpose is to explain all the essential concepts of the computer system and show the reader how these concepts actually affect the correctness, performance and practicality of the application. Unlike other systematic books that are primarily for system constructors, this book is written to programmers, which is described from the perspective of programmers. This book has a bridge between software and hardware, which gives a way to help readers understand a program and its behavior from hardware and software, which also fills a domestic computer system teaching. blank. The biggest advantage of this book is to help readers understand the concept, let readers construct a layer-type computer system in their minds, representation from the lowest layer data in memory (as we have been strange floating point number), to the pipeline instruction Composition, to the virtual memory, to the compilation system, to the dynamic load library, to the final user application. This book provides a large number of examples and exercises and some answers. It is particularly worth mentioning that there is a corresponding pen or program trial for each basic concept, deepening the reader's understanding.

Chapter 1 Computer System Roam 1.1 Information is Bit Context 1.2 Program Translated into Different Formats by Other Programs 1.3 How to work on how to work is a greatly beneficial 1.4 processor read and interpret the instructions stored in memory 1.4.1 system Hardware composition 1.4.2 Execution Hello Program 1.5 Cache 1.6 Forming hierarchy storage device 1.7 Operating System Management Hardware 1.7.1 Process 1.7.2 Thread 1.7.3 Virtual Memory 1.7.4 File 1.8 Using Network Systems and Other System Communication 1.9 Step 2 Description Chapter 2 Information representation and processing 2.1 Information Storage 2.2 Integer Representation 2.3 Integer Operation 2.4 Floating Point 2.5 Split Reference Description Household Practice Questions Answer Chapter 3 Program 3.1 History 3.2 Program Coding 3.3 Data Format 3.4 Access Information 3.5 Arithmetic and Logic Operation 3.6 Control 3.7 Procedure 3.8 Arrange Assignment and Access 3.9 Available Data Structure 3.10 Alignment 3.11 Comprehensive: Understanding Pointer 3.12 Real Life: Using GDB Debugger 3.13 Memory Offshore reference and buffer District overflow 3.14 * Floating point code 3.15 * Included in the C program 3.16 Split Chapter 4 Processor Architecture 4.1 Y86 Instruction Collective Structure 4.2 Logic Design and Hardware Control Language HCl 2714.3 Y86 Sequential Realization 4.4 Pipeline General Principle 4.5 Y86 Tail 4.6 Split Chapter 5 Optimizer 5.1 Optimized Compiler Ability and Limitations 5.2 Representation Program Performance 5.3 Program Example 5.4 Elimination of Cycles 5.5 Reduction Procedure Call 5.6 Elimination Unnecessary Memory Quote 5.7 Understanding Modern processor 5.8 Reduce cycle overhead 5.9 Conversion to pointer code 5.11 Improve parallelism 5.11 Comprehensive: Optimized consolidation code effect Summary 5.12 Branch prediction and prediction error penalty 5.13 Understanding memory performance 5.14 Realistic life: Performance improvement technology 5.15 confirmation and elimination performance bottleneck 5.16 Summary Chapter 6 Memory Hierarchy 6.1 Storage Technology 6.2 Local 6.3 Memory Hierarchy 6.4 Cache 6.5 Writing Cache Friendly Code 6.6 Comprehensive: The effect of cache on program performance 6.7 Comprehensive: Using local 6.8 small knot in your program Reference Description Household Practice Questions Answer Chapter 7 Links 7.1 Compiler Drivers 7.2 Static Links 7.3 Target Files 7.5 Symbols and Symbol Table 7.6 Symbol Resolution 7.7 Refilled 7.8 Executive Target File 7.9 Load executable target file 7.10 Dynamic Link Sharing Library 7.11 Loading and Linking Size (PIC) 7.13 Designing Tools 7.13 Split 8.2 Process 8.3 System Call and error handling 8.4 Process Control 8.5 Signal 8.6 Non-Local Jump 8.7 Operation Process Tools 8.8 Split Chapter 9 Measurement Program Execution Time 9.1 Time Stream on Computer System 9.2 Time 9.3 Measurement Time 9.3 Periodic Counter 9.4 Periodic counter to measure the program execution time 9.5 Measurement of the getTimeOfDay function 9.6 Comprehensive: An experimental protocol 9.7 Outlook for the future 9.8 Real life: K times Optimal Measurement Method 9.9 Lessons learned 9.10 Split Chapter 10 Virtual Memory 10.1 Physical and Virtual Find Address 10.2 address space 10.3 VM as a cache tool 10.4 VM as a tool 10.5 VM as a tool for memory 10.6 Address Translation 10.7 Case Study: