tailieunhanh - Ebook Computer organization and design (4th edition): Part 2

(BQ) This new emphasis on parallelism is supported by updates reflecting the newest technologies, with examples highlighting the latest processor designs and benchmarking standards. As with previous editions, a MIPS processor is the core used to present the fundamentals of hardware technologies, assembly language, computer arithmetic, pipelining, memory hierarchies and I/O. | Ideally one would desire an indefinitely large memory capacity such that any particular. word would be immediately available. We are. forced to recognize the possibility of constructing a hierarchy of memories each of which has greater capacity than the preceding but which is less quickly accessible. A. w. Burks H. H. Goldstine and J. von Neumann Preliminary Discussion of the Logical Design of an Electronic Computing Instrument 1946 Large and Fast Exploiting Memory Hierarchy Introduction 452 The Basics of Caches 457 Measuring and Improving Cache Performance 475 Virtual Memory 492 A Common Framework for Memory Hierarchies 518 Virtual Machines 525 Computer Organization and Design. DOI 2012 Elsevier. Inc All rights reserved. Using a Finite-State Machine to Control a Simple Cache 529 Parallelism and Memory Hierarchies Cache Coherence 534 n Advanced Material Implementing Cache Controllers 538 Real stuff the AMD Opteron X4 Barcelona and intel Nehalem Memory Hierarchies 539 Fallacies and Pitfalls 543 Concluding Remarks 547 o Historical Perspective and Further Reading 548 Exercises 548 The Five Classic Components of a Computer Compiler Interface Evaluating performance 452 Chapter 5 Large and Fast Exploiting Memory Hierarchy Introduction temporal localit . The principle stating that if a data location is referenced then it will tend to be referenced again soon. spatial locality The locality principle stating that ư a data location is referenced data locations with nearby addresses will tend to be referenced From the earliest days of computing programmers have wanted unlimited amounts of fast memory. The topics in this chapter aid programmers by creating that illusion. Before we look at creating the illusion let s consider a simple analogy that illustrates the key principles and mechanisms that we use. Suppose you were a student writing a term paper on important historical .