Computer Organisation and Design (2014)

Recommendations

Info

This page intentionally left blank
1 Civilization advances by extending the number of important operations which we can perform without thinking about them. Alfred North Whitehead, An Introduction to Mathematics, 1911 Computer Abstractions and Technology 1.1 Introduction 3 1.2 Eight Great Ideas in Computer Architecture 11 1.3 Below Your Program 13 1.4 Under the Covers 16 1.5 Technologies for Building Processors and Memory 24 Computer Organization and Design. DOI: http://dx.doi.org/10.1016/B978-0-12-407726-3.00001-1 © 2013 Elsevier Inc. All rights reserved.
Page 2 and 3: In Praise of Computer Organization
Page 4 and 5: F I F T H E D I T I O N Computer Or
Page 8 and 9: To Linda, who has been, is, and alw
Page 16 and 17: Preface The most beautiful thing we
Page 19 and 20: xviii Preface learning more about f
Page 21 and 22: xx Preface once again like a tightr
Page 23: xxii Preface Li (Arizona State Univ
Page 28: 1.1 Introduction 5 Classes of Compu
Page 33: 10 Chapter 1 Computer Abstractions
Page 39 and 40: 16 Chapter 1 Computer Abstractions
Page 46 and 47: 1.4 Under the Covers 23 To distingu
Page 50 and 51: 1.6 Performance 27 FIGURE 1.13 A 12
Page 52 and 53: 1.6 Performance 29 purchasers and t
Page 54 and 55: 1.6 Performance 31 In discussing a
Page 56 and 57: 1.6 Performance 33 some application
Page 58 and 59: 1.6 Performance 35 CPU time for B c
Page 64 and 65: 1.7 The Power Wall 41 Although powe
Page 70 and 71: 1.9 Real Stuff: Benchmarking the In
Page 72 and 73: 1.10 Fallacies and Pitfalls 49 boil
Page 74:
1.10 Fallacies and Pitfalls 51 is t
Page 79 and 80:
56 Chapter 1 Computer Abstractions
Page 81 and 82:
58 Chapter 1 Computer Abstractions
Page 83:
2 I speak Spanish to God, Italian t
Page 91 and 92:
68 Chapter 2 Instructions: Language
Page 93 and 94:
Page 97 and 98:
Page 99 and 100:
Page 101 and 102:
Page 104 and 105:
2.5 Representing Instructions in th
Page 106 and 107:
2.5 Representing Instructions in th
Page 111 and 112:
Page 114 and 115:
2.7 Instructions for Making Decisio
Page 116 and 117:
Page 118:
Page 121 and 122:
Page 123 and 124:
100 Chapter 2 Instructions: Languag
Page 125 and 126:
Page 128:
2.8 Supporting Procedures in Comput
Page 131 and 132:
Page 133:
Page 136 and 137:
2.10 MIPS Addressing for 32-bit Imm
Page 139:
Page 143 and 144:
Page 145:
Page 148 and 149:
2.12 Translating and Starting a Pro
Page 150 and 151:
Page 152 and 153:
Page 156:
2.13 A C Sort Example to Put It All
Page 159 and 160:
Page 161:
Page 166:
2.14 Arrays versus Pointers 143 Poi
Page 171:
Page 175 and 176:
Page 177 and 178:
Page 179 and 180:
Page 181:
Page 185:
Page 189 and 190:
Page 191 and 192:
Page 193 and 194:
Page 195 and 196:
Page 197 and 198:
Page 199:
3 Arithmetic for Computers Numerica
Page 204:
3.2 Addition and Subtraction 181 mo
Page 208:
3.3 Multiplication 185 Start Multip
Page 212:
3.4 Division 189 3.4 Division The r
Page 216:
3.4 Division 193 Elaboration: The o
Page 220 and 221:
3.5 Floating Point 197 Computer ari
Page 222 and 223:
3.5 Floating Point 199 Single preci
Page 224 and 225:
3.5 Floating Point 201 Floating-Poi
Page 226 and 227:
3.5 Floating Point 203 Floating-Poi
Page 229 and 230:
206 Chapter 3 Arithmetic for Comput
Page 231:
Page 234:
3.5 Floating Point 211 Step 5. Sinc
Page 237 and 238:
Page 239 and 240:
Page 241 and 242:
Page 245:
Page 250 and 251:
3.8 Going Faster: Subword Paralleli
Page 252 and 253:
3.9 Fallacies and Pitfalls 229 3.9
Page 254 and 255:
3.9 Fallacies and Pitfalls 231 Desp
Page 256:
3.10 Concluding Remarks 233 selecte
Page 260 and 261:
3.12 Exercises 237 3.12 Exercises 3
Page 262 and 263:
3.12 Exercises 239 3.23 [10] Write
Page 264 and 265:
3.12 Exercises 241 3.40 [10] Based
Page 268 and 269:
4.1 Introduction 245 However, it il
Page 270:
4.1 Introduction 247 on a load and
Page 279 and 280:
256 Chapter 4 The Processor PC + 4
Page 281:
258 Chapter 4 The Processor Instruc
Page 286:
4.4 A Simple Implementation Scheme
Page 291:
268 Chapter 4 The Processor 3. The
Page 294 and 295:
4.4 A Simple Implementation Scheme
Page 297 and 298:
274 Chapter 4 The Processor pipelin
Page 300 and 301:
4.5 An Overview of Pipelining 277 P
Page 302:
4.5 An Overview of Pipelining 279 T
Page 310 and 311:
4.6 Pipelined Datapath and Control
Page 312 and 313:
Page 314 and 315:
Page 316 and 317:
Page 318 and 319:
Page 320:
Page 323 and 324:
300 Chapter 4 The Processor 2. Tryi
Page 325:
302 Chapter 4 The Processor Signal
Page 328 and 329:
4.7 Data Hazards: Forwarding versus
Page 330:
4.7 Data Hazards: Forwarding versus
Page 333 and 334:
310 Chapter 4 The Processor Mux con
Page 337:
314 Chapter 4 The Processor use. Ch
Page 342:
4.8 Control Hazards 319 Forwarding
Page 347 and 348:
324 Chapter 4 The Processor branch
Page 351 and 352:
328 Chapter 4 The Processor we did
Page 353 and 354:
330 Chapter 4 The Processor 8000018
Page 357 and 358:
334 Chapter 4 The Processor Another
Page 359 and 360:
336 Chapter 4 The Processor instruc
Page 361 and 362:
338 Chapter 4 The Processor loop un
Page 363 and 364:
340 Chapter 4 The Processor Instruc
Page 366 and 367:
4.10 Parallelism via Instructions 3
Page 368:
4.11 Real Stuff: The ARM Cortex-A8
Page 373:
350 Chapter 4 The Processor 3 2.5 S
Page 376:
4.12 Going Faster: Instruction-Leve
Page 381 and 382:
358 Chapter 4 The Processor 4.3 Whe
Page 383:
360 Chapter 4 The Processor 4.7 In
Page 388 and 389:
4.17 Exercises 365 4.13.2 [10] Rep
Page 390 and 391:
4.17 Exercises 367 4.15.5 [10] Wit
Page 392 and 393:
4.17 Exercises 369 4.18.4 [10] Rep
Page 394 and 395:
Page 398 and 399:
5.1 Introduction 375 Speed Processo
Page 400:
5.1 Introduction 377 As we will see
Page 404 and 405:
5.2 Memory Technologies 381 write f
Page 406 and 407:
5.3 The Basics of Caches 383 refere
Page 411:
388 Chapter 5 Large and Fast: Explo
Page 415 and 416:
Page 417 and 418:
Page 421 and 422:
Page 423 and 424:
Page 425 and 426:
Page 427:
Page 430:
5.4 Measuring and Improving Cache P
Page 433 and 434:
Page 435 and 436:
Page 437 and 438:
Page 439 and 440:
Page 443:
Page 448 and 449:
5.6 Virtual Machines 425 allow thes
Page 450 and 451:
5.7 Virtual Memory 427 Because the
Page 453 and 454:
Page 455:
Page 459 and 460:
Page 462 and 463:
5.7 Virtual Memory 439 Because we a
Page 465 and 466:
Page 467 and 468:
Page 469 and 470:
Page 472 and 473:
5.7 Virtual Memory 449 The exceptio
Page 475 and 476:
Page 477:
Page 481 and 482:
Page 485:
Page 491 and 492:
Page 494:
5.13 Real Stuff: The ARM Cortex-A8
Page 499 and 500:
Page 502:
5.15 Fallacies and Pitfalls 479 Thi
Page 507:
Page 518:
5.18 Exercises 495 5.16 In this exe
Page 521 and 522:
Page 523:
6 Parallel Processors from Client t
Page 527 and 528:
504 Chapter 6 Parallel Processors f
Page 529 and 530:
Page 534 and 535:
6.3 SISD, MIMD, SIMD, SPMD, and Vec
Page 536 and 537:
6.3 SISD, MIMD, SIMD, SPMD, and Vec
Page 540:
6.4 Hardware Multithreading 517 Sim
Page 544 and 545:
6.5 Multicore and Other Shared Memo
Page 546:
6.5 Multicore and Other Shared Memo
Page 550 and 551:
6.6 Introduction to Graphics Proces
Page 553:
Page 557 and 558:
Page 560:
6.8 Introduction to Multiprocessor
Page 565:
Page 568:
6.10 Multiprocessor Benchmarks and
Page 574 and 575:
6.11 Real Stuff: Benchmarking and R
Page 576 and 577:
6.11 Real Stuff: Benchmarking and R
Page 578 and 579:
6.12 Going Faster: Multiple Process
Page 582:
6.13 Fallacies and Pitfalls 559 One
Page 587 and 588:
Page 590 and 591:
6.16 Exercises 567 continue until w
Page 593 and 594:
Page 595 and 596:
Page 598 and 599:
6.16 Exercises 575 §6.1, page 504:
Page 601 and 602:
A-4 Appendix A Assemblers, Linkers,
Page 603 and 604:
Page 605 and 606:
Page 607 and 608:
A-10 Appendix A Assemblers, Linkers
Page 609 and 610:
Page 611 and 612:
Page 613 and 614:
Page 617 and 618:
Page 619 and 620:
Page 622 and 623:
A.6 Procedure Call Convention A-25
Page 624 and 625:
Page 626 and 627:
Page 628 and 629:
Page 631:
Page 634 and 635:
A.7 Exceptions and Interrupts A-37
Page 637 and 638:
Page 640:
A.9 SPIM A-43 Another surprise (whi
Page 645 and 646:
Page 648 and 649:
A.10 MIPS R2000 Assembly Language A
Page 650 and 651:
Page 652 and 653:
Page 654 and 655:
Page 656 and 657:
Page 658 and 659:
Page 660 and 661:
Page 662 and 663:
Page 664 and 665:
Page 666 and 667:
Page 668 and 669:
Page 670 and 671:
Page 672 and 673:
Page 674 and 675:
Page 676 and 677:
Page 678:
A.11 Concluding Remarks A-81 A.11 C
Page 681:
B A P P E N D I X I always loved th
Page 686 and 687:
B.2 Gates, Truth Tables, and Logica
Page 688 and 689:
B.3 Combinational Logic B-9 B.3 Com
Page 690 and 691:
B.3 Combinational Logic B-11 Two-Le
Page 692 and 693:
B.3 Combinational Logic B-13 Inputs
Page 698:
B.4 Using a Hardware Description La
Page 701 and 702:
B-22 Appendix B The Basics of Logic
Page 703 and 704:
Page 705:
Page 713 and 714:
. . . B-34 Appendix B The Basics of
Page 715 and 716:
. . . B-36 Appendix B The Basics of
Page 718 and 719:
B.6 Faster Addition: Carry Lookahea
Page 720:
Page 724 and 725:
Page 726:
Page 730 and 731:
B.8 Memory Elements: Flip-Flops, La
Page 732 and 733:
Page 734 and 735:
Page 736 and 737:
Page 738 and 739:
B.9 Memory Elements: SRAMs and DRAM
Page 742 and 743:
Page 744:
Page 751 and 752:
Page 753 and 754:
Page 755 and 756:
Page 760 and 761:
B.14 Exercises B-81 B.10 [15] §§B
Page 762 and 763:
B.14 Exercises B-83 In Adder Load
Page 765 and 766:
Page 767 and 768:
Page 769 and 770:
I-2 Index Apple iPad 2 A1395, 20 lo
Page 771 and 772:
I-4 Index Cache misses (Continued)
Page 773 and 774:
I-6 Index Control units, 247. See a
Page 775 and 776:
I-8 Index Embedded RISCs. See also
Page 777 and 778:
I-10 Index Graphics displays comput
Page 779 and 780:
I-12 Index Intel Threading Building
Page 781 and 782:
I-14 Index Memory hierarchies (Cont
Page 783 and 784:
I-16 Index Next-state function, 463
Page 785 and 786:
I-18 Index Pipelining (Continued) e
Page 787 and 788:
I-20 Index Rounding, 218 accurate,
Page 789 and 790:
I-22 Index Status register fields,
Page 791:
I-24 Index Very large-scale integra
show all

Computer Organisation and Design (2014)

Create successful ePaper yourself

Delete template?

Save as template?