CIT 668: System Architecture. Computer Systems Architecture
|
|
- Harold Chambers
- 5 years ago
- Views:
Transcription
1 CIT 668: System Architecture Computer Systems Architecture
2 1. System Components Topics 2. Bandwidth and Latency 3. Processor 4. Memory 5. Storage 6. Network 7. Operating System 8. Performance Implications Images courtesy of Majd F. Sakr or from Wikipedia unless otherwise noted.
3 A Single CPU Computer Components
4 Von Neumann Architecture Single storage for both data and commands Storage separate from control unit RAM CPU The Brain von Neumann 4
5 The 5 Von Neumann Components Input/Output CPU and ALU Memory
6 Motherboard
7 High Level Machine Architecture
8 Bandwidth and Latency Bandwidth (aka throughput) Rate of data transfer (bit rate) How wide is your pipe. Latency (aka lag) Time to get data since request was sent. How long is your pipe.
9 Latency Examples
10 Latency lags Bandwidth Moore s Law More transistors help bandwidth, hurt latency. Faster transistors helps both. Latency helps bandwidth Faster disk rotation improves both. More devices in parallel improve bandwidth, hurt latency. Distance limits latency. Speed of light bound. Source: David A. Patterson, Latency lags bandwith, Communications of the ACM, Vol. 47 No. 10, Pages 71-75
11 The Processor The Brain: a functional unit that interprets and carries out instructions (mathematical operations) Also called a CPU (actually includes CPU + ALU) Consists of hundreds of millions of transistors.
12 Instruction Set Architecture (ISA) Every processor has its own set of operations Written in binary machine language (ML) Each instruction consists of operator + operand Assembly language is humanly-readable ML Category Arithmetic Logic Program Control Data Movement I/O Example Add, subtract, multiply, divide And, or, not, exclusive ov Branch (conditional), call, jump Move, load, store Read, write
13 Source Code to Machine Language
14 Program Execution Cycle Fetch/Execute Cycle Fetch: retrieve instruction from memory Execute: decode instruction, fetch operands, execute instruction, store results to memory (if any) Fetch Store Decode Execute
15 Synchronous Execution Each step waits for click tick to begin A 100 MHz processor uses a clock that ticks 100,000,000 times per second. Fetch Store Decode Cycle speed of 1 GHz: billionths of a second Execute
16 Processor Components
17 Processor Layout
18 From Sand to Silicon Wafers Purification and heating to make a pure silicon crystal. Sand, made up of 25% silicon, is the starting point 100kg of % pure silicon crystal Slicing the crystal into 300mm wafers for use in photolithography.
19 Photolithography
20 Packaging Wafer is cut into dies, each containing one processor. Substrate, die, and heatspreader assembled to make final CPU product for use in a PC.
21 Processor Components: Control Control Unit Processor s supervisor Fetch/execute cycle Retrieve instruction Decode instruction Execute actions Program Counter (PC): stores address of instruction to be fetched. Instruction Register (IR): has instruction most recently fetched.
22 Processor Components: Datapath Register File: General purpose storage locations inside processor that hold addresses or values. Arithmetic Logic Unit: Set of functional units that perform arithmetic and logic operations. A 32-bit processor has registers that are typically 32 bits in size.
23 Superscalar Architecture Instead of one ALU, use multiple execution units Some execution units are identical to others Others are different: Integer, FPU, multi-media
24 AMD Athlon Architecture
25 Computer System Layers
26 Moore s Law Number of transistors doubles every 18 months More transistors = Cheaper CPUs Higher speeds More features More cache 26
27 Improvements in CPU Clock Speed
28 Computation Produces Heat
29 Processor Power Density Sun s Surface Power Density (W/cm 2 ) Hot Plate Rocket Nozzle Nuclear Reactor Pentium Pentium IV Pentium III Pentium II Pentium Pro Year Source: Intel 29
30 The Single CPU is History What can you do with more transistors at same speed? Multicore CPUs Multiple processors (cores) on a single chip Run different programs on each core Some programs can be rewritten to run on multiple cores: PhotoShop, bzip2 Most of you are running multi-core
31 2014 Server CPUs Intel Xeon Up to 15 cores with 2 threads 2.2 to 4.0 GHz Up to 30 MB L3 cache AMD Opteron Up to to 3.5 GHz Up to 16 MB L3 cache IBM Power 7+ Up to 8 cores with 4 threads 3.0 to 4.4 GHz 10 MB L3 cache per core (up to 80MB for 8-core) Sun/Oracle SPARC T5 16 cores with 8 threads 3.6 GHz 8 MB L3 cache
32 End of Moore s Law Si 0.3 nm
33 Where do we go from here? Better Materials More Machines Better Algorithms GaAs Cloud Map Reduce Diamond Containers Fuzzy Logic
34 Main Memory
35 Memory Bandwidth and Latency Generation Type Peak Bandwidth Latency (1 st word) SDRAM (1990s) PC GB/s 20ns DDR (2000) DDR GB/s 20ns DDR DDR GB/s 15ns DDR2 (2003) DDR GB/s 15ns DDR2 DDR GB/s 15ns DDR3 (2007) DDR GB/s 13ns DDR3 DDR GB/s 11.25ns DDR4 (2014) DDR GB/s?
36 Processor-Memory Bottleneck Solution: Caches
37 Processor-Memory Gap
38 Principle of Locality Programs tend to reuse data and instructions near those they have used recently. Temporal locality: Recently referenced items are likely to be referenced in the near future. Spatial locality: Items with nearby addresses tend to be referenced close together in time.
39 Caches Cache: A smaller, faster storage device that transparently stores a subset of the data in a larger slower device so that future requests for that data can be served more quickly. Average Access Time = Time for a Cache Hit + Miss Rate Miss Penalty
40 Improving Cache Performance Reduce the time for a cache hit Reduce cache size Use direct mapped cache Reduce the miss rate Increase cache size More flexible placement Reduce the miss penalty Use multiple cache levels
41 Memory Hierarchy
42 Memory Design: Hierarchy Fundamental Idea: Faster, smaller storage devices at level k serve as a cache for the larger, slower device at level k+1. CPU cache hit rates typically above 90% If hit rate is high, gives illusion that large amount of slow memory is just as fast as fastest memory Why can t all of our memory be fastest type? Size and cost Speed of light
43 AMAT Computation Example #1 CPU speed is 1 GHz 2 cycles to access L1 cache 80 cycles to access RAM L1 (90%) RAM (100%) AMAT = 2 cycles + 10% 80 cycles = (2 cycles+8 cycles) 1 second / 10 9 cycles = 10-8 seconds = 10ns
44 AMAT Computation Example #2 CPU speed is 1 GHz AMAT = 2 cycles + 10% (6 cycles + 5% 80 cycles) L1 (90%) L2 (95%) RAM (100%) 2 cycles 6 cycles 80 cycles AMAT = 2 cycles + 10% (6 cycles + 4 cycles) = (2 cycles + 1 cycle) 1 second / 10 9 cycles = seconds = 3 ns
45 Cores may share Caches
46 Error Correcting Code (ECC) DRAM SECDED is most widely used ECC Single Error Correction Double Error Detection ECC DRAM costs more than non-ecc Need extra bit for ECC + Lower volume of ECC DRAM sold Memory errors per year
47 Disk
48 Disk Geometry Disks consist of platters, each with two surfaces Each surface consists of concentric rings called tracks Each track consists of sectors separated by gaps Aligned tracks form a cylinder.
49 Disk Operation Disk spins at a fixed rotational rate (rpm) Read/write heads are attached to end of arm Moving radially, arm positions head over desired track Arm waits for disk to spin desired sector under head
50 Hard Drive Components
51 Disk Performance Seek Time Time to move head to desired track (3-8 ms) Rotational Latency Average time to position head over desired sector ½ 1/RPMs 60sec/min (8ms for 7200rpm) Total Latency Seek Time + Rotational Delay Transfer Time Time to read bits in target sector 1/RPM 1/(average # sectors/track) 60sec/min
52 I/O Bus
53
54
55
56 Latency Across Memory Hierarchy
57 Solid State Drives (SSDs) Integrated circuit-based data storage devices. Usually flash memory. OS sees as a hard drive. Compared to HDs Low latency (10X) High throughput (2-10X) High cost (5-10X) Low capacity (5-10X) Reliability: No moving parts, but all SSDs except Intel shown to lose data on repeated power failures.
58 RAID: Redundant Array of Independent Disks RAID 0: Striping (non-redundant) RAID 1: Mirroring RAID 3: Bit Striping + Parity Disk RAID 4: Block Striping + Parity Disk RAID 5: Block Striping + Distributed Parity RAID 6: Block Striping + Multiple Parity Nested RAID: Combinations of above Files are striped across multiple disks (spindles) Throughput increases via use of many disks Reliability increases as data on a failed disk can be reconstructed from parity data
59 Network
60 The Bus: An Internal Computer Network A bus is a collection of parallel wires that carry address, data, and control signals. Buses typically connect multiple devices.
61 I/O Bus and Devices
62 Network Adapter connects Bus to Other PCs
63 Bus Speeds Bus Name Theoretical Throughput Purpose USB Mb/s Connect PCs to peripherals (high overhead) USB Gb/s Connect PCs to peripherals, incl external HDs Thunderbolt 2 20 Gb/s Fast external peripherals, like GPUs and SSDs Ethernet 10 Mb/s to 100 Gb/s Local area network (LAN) n 600 Mb/s Wireless local area network (WLAN) T Mb/s Basic wide area network (WAN) connection OC-12 to Mb/s to 160 Gb/s Optical carrier (OC) WAN connections Fiber Channel 2 Gb/s to 16 Gb/s Storage area networks SATA Gb/s Connect mass storage devices PCIe 3.0 (16x) 128 Gb/s Connect internal peripherals like GPUs, SSDs DDR Gb/s Connect DDR3 RAM to CPU QPI 256 Gb/s Connect CPUs to each other or to I/O bus
64 Network Network: collection of computers connected together through some communication channel (Ethernet, Fiber Channel, wireless, DSL, etc.) Internet
65 Bandwidth Data transmission rate Bits/second Latency Time to transfer data from end to end ms Network
66 OSI Model
67 Routing
68 Operating Systems
69 Process Control A process is an instance of a program in execution. Processes can be executed concurrently. The OS is responsible for: Process creation and termination Allocating resources (CPU, memory, I/O) for processes Interprocess communication
70 Memory Management Each process has its own virtual memory space. OS maintains a page table of virtual address to physical address translations CPU has a Memory Management Unit that performs translations automatically based on register pointing to OS page table
71 A filesystem is a way of storing and organizing data on a disk to ensure easy human access. Filesystems usually support nested sets of directories forming a tree structure. Filesystem
72 Key Points 1. Slow CPU speed increases focus on parallelism 1. Can t increase clock speeds much above 4GHz 2. Use increased transistor counts for multi-core CPUs 3. Moore s law will end, stopping transistor growth 2. Processor-storage bottleneck 1. Use caching to hide slowness of storage 2. Registers > CPU Cache >> Main memory >> Disk 3. Lots of cheap, slow memory + little expensive, fast memory leads to memory hierarchy architecture 3. To improve disk performance, we can use 1. Solid State Drives (SSDs) and/or 2. RAID combinations of disks.
73 References 1. Jeff Dean, Latency Numbers Every Programmer Should Know, 2. David A. Patterson. "Latency lags bandwidth." Communications of the ACM (2004): Wikipedia, List of Device Bit Rates, bit_rates
CIT 668: System Architecture
CIT 668: System Architecture Computer Systems Architecture I 1. System Components 2. Processor 3. Memory 4. Storage 5. Network 6. Operating System Topics Images courtesy of Majd F. Sakr or from Wikipedia
More informationVirtual Memory. Reading. Sections 5.4, 5.5, 5.6, 5.8, 5.10 (2) Lecture notes from MKP and S. Yalamanchili
Virtual Memory Lecture notes from MKP and S. Yalamanchili Sections 5.4, 5.5, 5.6, 5.8, 5.10 Reading (2) 1 The Memory Hierarchy ALU registers Cache Memory Memory Memory Managed by the compiler Memory Managed
More informationRecap: Machine Organization
ECE232: Hardware Organization and Design Part 14: Hierarchy Chapter 5 (4 th edition), 7 (3 rd edition) http://www.ecs.umass.edu/ece/ece232/ Adapted from Computer Organization and Design, Patterson & Hennessy,
More informationCS 201 The Memory Hierarchy. Gerson Robboy Portland State University
CS 201 The Memory Hierarchy Gerson Robboy Portland State University memory hierarchy overview (traditional) CPU registers main memory (RAM) secondary memory (DISK) why? what is different between these
More informationECE232: Hardware Organization and Design
ECE232: Hardware Organization and Design Lecture 21: Memory Hierarchy Adapted from Computer Organization and Design, Patterson & Hennessy, UCB Overview Ideally, computer memory would be large and fast
More informationMemory Hierarchy Y. K. Malaiya
Memory Hierarchy Y. K. Malaiya Acknowledgements Computer Architecture, Quantitative Approach - Hennessy, Patterson Vishwani D. Agrawal Review: Major Components of a Computer Processor Control Datapath
More informationSerial. Parallel. CIT 668: System Architecture 2/14/2011. Topics. Serial and Parallel Computation. Parallel Computing
CIT 668: System Architecture Parallel Computing Topics 1. What is Parallel Computing? 2. Why use Parallel Computing? 3. Types of Parallelism 4. Amdahl s Law 5. Flynn s Taxonomy of Parallel Computers 6.
More information7/28/ Prentice-Hall, Inc Prentice-Hall, Inc Prentice-Hall, Inc Prentice-Hall, Inc Prentice-Hall, Inc.
Technology in Action Technology in Action Chapter 9 Behind the Scenes: A Closer Look a System Hardware Chapter Topics Computer switches Binary number system Inside the CPU Cache memory Types of RAM Computer
More informationShow how to connect three Full Adders to implement a 3-bit ripple-carry adder
Show how to connect three Full Adders to implement a 3-bit ripple-carry adder 1 Reg. A Reg. B Reg. Sum 2 Chapter 5 Computing Components Yet another layer of abstraction! Components Circuits Gates Transistors
More informationComputer Organization
INF 101 Fundamental Information Technology Computer Organization Assistant Prof. Dr. Turgay ĐBRĐKÇĐ Course slides are adapted from slides provided by Addison-Wesley Computing Fundamentals of Information
More informationCENG3420 Lecture 08: Memory Organization
CENG3420 Lecture 08: Memory Organization Bei Yu byu@cse.cuhk.edu.hk (Latest update: February 22, 2018) Spring 2018 1 / 48 Overview Introduction Random Access Memory (RAM) Interleaving Secondary Memory
More informationChapter 6. Storage and Other I/O Topics
Chapter 6 Storage and Other I/O Topics Introduction I/O devices can be characterized by Behaviour: input, output, storage Partner: human or machine Data rate: bytes/sec, transfers/sec I/O bus connections
More informationThe Memory Hierarchy 10/25/16
The Memory Hierarchy 10/25/16 Transition First half of course: hardware focus How the hardware is constructed How the hardware works How to interact with hardware Second half: performance and software
More informationStorage Technologies and the Memory Hierarchy
Storage Technologies and the Memory Hierarchy 198:231 Introduction to Computer Organization Lecture 12 Instructor: Nicole Hynes nicole.hynes@rutgers.edu Credits: Slides courtesy of R. Bryant and D. O Hallaron,
More informationCSCI-GA Database Systems Lecture 8: Physical Schema: Storage
CSCI-GA.2433-001 Database Systems Lecture 8: Physical Schema: Storage Mohamed Zahran (aka Z) mzahran@cs.nyu.edu http://www.mzahran.com View 1 View 2 View 3 Conceptual Schema Physical Schema 1. Create a
More informationCS429: Computer Organization and Architecture
CS429: Computer Organization and Architecture Dr. Bill Young Department of Computer Sciences University of Texas at Austin Last updated: November 28, 2017 at 14:31 CS429 Slideset 18: 1 Random-Access Memory
More informationCS429: Computer Organization and Architecture
CS429: Computer Organization and Architecture Dr. Bill Young Department of Computer Sciences University of Texas at Austin Last updated: April 9, 2018 at 12:16 CS429 Slideset 17: 1 Random-Access Memory
More informationLecture 23. Finish-up buses Storage
Lecture 23 Finish-up buses Storage 1 Example Bus Problems, cont. 2) Assume the following system: A CPU and memory share a 32-bit bus running at 100MHz. The memory needs 50ns to access a 64-bit value from
More informationCSE 153 Design of Operating Systems
CSE 153 Design of Operating Systems Winter 2018 Lecture 20: File Systems (1) Disk drives OS Abstractions Applications Process File system Virtual memory Operating System CPU Hardware Disk RAM CSE 153 Lecture
More informationCS 33. Memory Hierarchy I. CS33 Intro to Computer Systems XVI 1 Copyright 2016 Thomas W. Doeppner. All rights reserved.
CS 33 Memory Hierarchy I CS33 Intro to Computer Systems XVI 1 Copyright 2016 Thomas W. Doeppner. All rights reserved. Random-Access Memory (RAM) Key features RAM is traditionally packaged as a chip basic
More informationComputer Systems. Binary Representation. Binary Representation. Logical Computation: Boolean Algebra
Binary Representation Computer Systems Information is represented as a sequence of binary digits: Bits What the actual bits represent depends on the context: Seminar 3 Numerical value (integer, floating
More informationPERFORMANCE MEASUREMENT
Administrivia CMSC 411 Computer Systems Architecture Lecture 3 Performance Measurement and Reliability Homework problems for Unit 1 posted today due next Thursday, 2/12 Start reading Appendix C Basic Pipelining
More informationComputer Systems. Memory Hierarchy. Han, Hwansoo
Computer Systems Memory Hierarchy Han, Hwansoo Random-Access Memory (RAM) Key features RAM is traditionally packaged as a chip. Basic storage unit is normally a cell (one bit per cell). Multiple RAM chips
More informationComputers: Inside and Out
Computers: Inside and Out Computer Components To store binary information the most basic components of a computer must exist in two states State # 1 = 1 State # 2 = 0 1 Transistors Computers use transistors
More informationChapter 5 12/2/2013. Objectives. Computer Systems Organization. Objectives. Objectives (continued) Introduction. INVITATION TO Computer Science 1
Chapter 5 Computer Systems Organization Objectives In this chapter, you will learn about: The components of a computer system Putting all the pieces together the Von Neumann architecture The future: non-von
More informationStorage. CS 3410 Computer System Organization & Programming
Storage CS 3410 Computer System Organization & Programming These slides are the product of many rounds of teaching CS 3410 by Deniz Altinbuke, Kevin Walsh, and Professors Weatherspoon, Bala, Bracy, and
More informationCSE 153 Design of Operating Systems Fall 2018
CSE 153 Design of Operating Systems Fall 2018 Lecture 12: File Systems (1) Disk drives OS Abstractions Applications Process File system Virtual memory Operating System CPU Hardware Disk RAM CSE 153 Lecture
More informationI/O CANNOT BE IGNORED
LECTURE 13 I/O I/O CANNOT BE IGNORED Assume a program requires 100 seconds, 90 seconds for main memory, 10 seconds for I/O. Assume main memory access improves by ~10% per year and I/O remains the same.
More informationStorage Systems. Storage Systems
Storage Systems Storage Systems We already know about four levels of storage: Registers Cache Memory Disk But we've been a little vague on how these devices are interconnected In this unit, we study Input/output
More informationIntroduction Disks RAID Tertiary storage. Mass Storage. CMSC 420, York College. November 21, 2006
November 21, 2006 The memory hierarchy Red = Level Access time Capacity Features Registers nanoseconds 100s of bytes fixed Cache nanoseconds 1-2 MB fixed RAM nanoseconds MBs to GBs expandable Disk milliseconds
More informationWhere We Are in This Course Right Now. ECE 152 Introduction to Computer Architecture Input/Output (I/O) Copyright 2012 Daniel J. Sorin Duke University
Introduction to Computer Architecture Input/Output () Copyright 2012 Daniel J. Sorin Duke University Slides are derived from work by Amir Roth (Penn) Spring 2012 Where We Are in This Course Right Now So
More informationCMSC 313 COMPUTER ORGANIZATION & ASSEMBLY LANGUAGE PROGRAMMING LECTURE 26, SPRING 2013
CMSC 313 COMPUTER ORGANIZATION & ASSEMBLY LANGUAGE PROGRAMMING LECTURE 26, SPRING 2013 TOPICS TODAY End of the Semester Stuff Homework 5 Memory Hierarchy Storage Technologies (RAM & Disk) Caching END OF
More informationCENG4480 Lecture 09: Memory 1
CENG4480 Lecture 09: Memory 1 Bei Yu byu@cse.cuhk.edu.hk (Latest update: November 8, 2017) Fall 2017 1 / 37 Overview Introduction Memory Principle Random Access Memory (RAM) Non-Volatile Memory Conclusion
More informationComputer Organization: A Programmer's Perspective
A Programmer's Perspective Computer Architecture and The Memory Hierarchy Gal A. Kaminka galk@cs.biu.ac.il Typical Computer Architecture CPU chip PC (Program Counter) register file ALU Main Components
More informationCOMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. 5 th. Edition. Chapter 5. Large and Fast: Exploiting Memory Hierarchy
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface 5 th Edition Chapter 5 Large and Fast: Exploiting Memory Hierarchy Principle of Locality Programs access a small proportion of their address
More informationCISC 360. The Memory Hierarchy Nov 13, 2008
CISC 360 The Memory Hierarchy Nov 13, 2008 Topics Storage technologies and trends Locality of reference Caching in the memory hierarchy class12.ppt Random-Access Memory (RAM) Key features RAM is packaged
More informationCSCI-UA.0201 Computer Systems Organization Memory Hierarchy
CSCI-UA.0201 Computer Systems Organization Memory Hierarchy Mohamed Zahran (aka Z) mzahran@cs.nyu.edu http://www.mzahran.com Programmer s Wish List Memory Private Infinitely large Infinitely fast Non-volatile
More informationGiving credit where credit is due
CSCE 230J Computer Organization The Memory Hierarchy Dr. Steve Goddard goddard@cse.unl.edu http://cse.unl.edu/~goddard/courses/csce230j Giving credit where credit is due Most of slides for this lecture
More informationModule 1: Basics and Background Lecture 4: Memory and Disk Accesses. The Lecture Contains: Memory organisation. Memory hierarchy. Disks.
The Lecture Contains: Memory organisation Example of memory hierarchy Memory hierarchy Disks Disk access Disk capacity Disk access time Typical disk parameters Access times file:///c /Documents%20and%20Settings/iitkrana1/My%20Documents/Google%20Talk%20Received%20Files/ist_data/lecture4/4_1.htm[6/14/2012
More informationI/O CANNOT BE IGNORED
LECTURE 13 I/O I/O CANNOT BE IGNORED Assume a program requires 100 seconds, 90 seconds for main memory, 10 seconds for I/O. Assume main memory access improves by ~10% per year and I/O remains the same.
More informationLecture 18: Memory Systems. Spring 2018 Jason Tang
Lecture 18: Memory Systems Spring 2018 Jason Tang 1 Topics Memory hierarchy Memory operations Cache basics 2 Computer Organization Computer Processor Memory Devices Control Datapath Input Output So far,
More informationCMSC 411 Computer Systems Architecture Lecture 2 Trends in Technology. Moore s Law: 2X transistors / year
CMSC 411 Computer Systems Architecture Lecture 2 Trends in Technology Moore s Law: 2X transistors / year Cramming More Components onto Integrated Circuits Gordon Moore, Electronics, 1965 # on transistors
More informationChapter 5. Large and Fast: Exploiting Memory Hierarchy
Chapter 5 Large and Fast: Exploiting Memory Hierarchy Principle of Locality Programs access a small proportion of their address space at any time Temporal locality Items accessed recently are likely to
More informationChapter 5. Large and Fast: Exploiting Memory Hierarchy
Chapter 5 Large and Fast: Exploiting Memory Hierarchy Review: Major Components of a Computer Processor Devices Control Memory Input Datapath Output Secondary Memory (Disk) Main Memory Cache Performance
More informationMass-Storage. ICS332 - Fall 2017 Operating Systems. Henri Casanova
Mass-Storage ICS332 - Fall 2017 Operating Systems Henri Casanova (henric@hawaii.edu) Magnetic Disks! Magnetic disks (a.k.a. hard drives ) are (still) the most common secondary storage devices today! They
More information+ Random-Access Memory (RAM)
+ Memory Subsystem + Random-Access Memory (RAM) Key features RAM is traditionally packaged as a chip. Basic storage unit is normally a cell (one bit per cell). Multiple RAM chips form a memory. RAM comes
More informationComputer Organization and Structure. Bing-Yu Chen National Taiwan University
Computer Organization and Structure Bing-Yu Chen National Taiwan University Storage and Other I/O Topics I/O Performance Measures Types and Characteristics of I/O Devices Buses Interfacing I/O Devices
More informationContents. Memory System Overview Cache Memory. Internal Memory. Virtual Memory. Memory Hierarchy. Registers In CPU Internal or Main memory
Memory Hierarchy Contents Memory System Overview Cache Memory Internal Memory External Memory Virtual Memory Memory Hierarchy Registers In CPU Internal or Main memory Cache RAM External memory Backing
More informationRandom Access Memory (RAM)
Random Access Memory (RAM) Key features RAM is traditionally packaged as a chip. Basic storage unit is normally a cell (one bit per cell). Multiple RAM chips form a memory. Static RAM (SRAM) Each cell
More informationWhere Have We Been? Ch. 6 Memory Technology
Where Have We Been? Combinational and Sequential Logic Finite State Machines Computer Architecture Instruction Set Architecture Tracing Instructions at the Register Level Building a CPU Pipelining Where
More informationCS 31: Intro to Systems Storage and Memory. Kevin Webb Swarthmore College March 17, 2015
CS 31: Intro to Systems Storage and Memory Kevin Webb Swarthmore College March 17, 2015 Transition First half of course: hardware focus How the hardware is constructed How the hardware works How to interact
More informationCS 261 Fall Mike Lam, Professor. Memory
CS 261 Fall 2016 Mike Lam, Professor Memory Topics Memory hierarchy overview Storage technologies SRAM DRAM PROM / flash Disk storage Tape and network storage I/O architecture Storage trends Latency comparisons
More informationKey Points. Rotational delay vs seek delay Disks are slow. Techniques for making disks faster. Flash and SSDs
IO 1 Today IO 2 Key Points CPU interface and interaction with IO IO devices The basic structure of the IO system (north bridge, south bridge, etc.) The key advantages of high speed serial lines. The benefits
More informationPC-based data acquisition II
FYS3240 PC-based instrumentation and microcontrollers PC-based data acquisition II Data streaming to a storage device Spring 2015 Lecture 9 Bekkeng, 29.1.2015 Data streaming Data written to or read from
More informationDatabase Systems II. Secondary Storage
Database Systems II Secondary Storage CMPT 454, Simon Fraser University, Fall 2009, Martin Ester 29 The Memory Hierarchy Swapping, Main-memory DBMS s Tertiary Storage: Tape, Network Backup 3,200 MB/s (DDR-SDRAM
More informationChapter 6 External Memory
Chapter 6 External Memory Magnetic Disk Removable RAID Disk substrate coated with magnetizable material (iron oxide rust) Substrate used to be aluminium Now glass Improved surface uniformity Increases
More informationCSC1201 Computer Applications. Budditha Hettige Department of Computer Science
CSC1201 Computer Applications Budditha Hettige Department of Computer Science Session 01 Introduction to Computers What is a computer? is a machine comprise of electronic components has ability to store
More informationRandom-Access Memory (RAM) CS429: Computer Organization and Architecture. SRAM and DRAM. Flash / RAM Summary. Storage Technologies
Random-ccess Memory (RM) CS429: Computer Organization and rchitecture Dr. Bill Young Department of Computer Science University of Texas at ustin Key Features RM is packaged as a chip The basic storage
More informationComputer Architecture and System Software Lecture 08: Assembly Language Programming + Memory Hierarchy
Computer Architecture and System Software Lecture 08: Assembly Language Programming + Memory Hierarchy Instructor: Rob Bergen Applied Computer Science University of Winnipeg Announcements Chapter 6 The
More informationCS6303 Computer Architecture Regulation 2013 BE-Computer Science and Engineering III semester 2 MARKS
CS6303 Computer Architecture Regulation 2013 BE-Computer Science and Engineering III semester 2 MARKS UNIT-I OVERVIEW & INSTRUCTIONS 1. What are the eight great ideas in computer architecture? The eight
More informationFUNCTIONS OF COMPONENTS OF A PERSONAL COMPUTER
FUNCTIONS OF COMPONENTS OF A PERSONAL COMPUTER Components of a personal computer - Summary Computer Case aluminium casing to store all components. Motherboard Central Processor Unit (CPU) Power supply
More informationShow how to connect three Full Adders to implement a 3-bit ripple-carry adder
Show how to connect three Full Adders to implement a 3-bit ripple-carry adder 1 Reg. A Reg. B Reg. Sum 2 Chapter 5 Computing Components Yet another layer of abstraction! Components Circuits Gates Transistors
More informationReadings. Storage Hierarchy III: I/O System. I/O (Disk) Performance. I/O Device Characteristics. often boring, but still quite important
Storage Hierarchy III: I/O System Readings reg I$ D$ L2 L3 memory disk (swap) often boring, but still quite important ostensibly about general I/O, mainly about disks performance: latency & throughput
More informationCOMP283-Lecture 3 Applied Database Management
COMP283-Lecture 3 Applied Database Management Introduction DB Design Continued Disk Sizing Disk Types & Controllers DB Capacity 1 COMP283-Lecture 3 DB Storage: Linear Growth Disk space requirements increases
More informationMemory Technology. Chapter 5. Principle of Locality. Chapter 5 Large and Fast: Exploiting Memory Hierarchy 1
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface Chapter 5 Large and Fast: Exploiting Memory Hierarchy 5 th Edition Memory Technology Static RAM (SRAM) 0.5ns 2.5ns, $2000 $5000 per GB Dynamic
More informationComputer Architecture and System Software Lecture 09: Memory Hierarchy. Instructor: Rob Bergen Applied Computer Science University of Winnipeg
Computer Architecture and System Software Lecture 09: Memory Hierarchy Instructor: Rob Bergen Applied Computer Science University of Winnipeg Announcements Midterm returned + solutions in class today SSD
More informationFoundations of Computer Systems
18-600 Foundations of Computer Systems Lecture 12: The Memory Hierarchy John Shen & Zhiyi Yu October 10, 2016 Required Reading Assignment: Chapter 6 of CS:APP (3 rd edition) by Randy Bryant & Dave O Hallaron
More informationLECTURE 5: MEMORY HIERARCHY DESIGN
LECTURE 5: MEMORY HIERARCHY DESIGN Abridged version of Hennessy & Patterson (2012):Ch.2 Introduction Programmers want unlimited amounts of memory with low latency Fast memory technology is more expensive
More informationCMSC 313 COMPUTER ORGANIZATION & ASSEMBLY LANGUAGE PROGRAMMING LECTURE 26, FALL 2012
CMSC 313 COMPUTER ORGANIZATION & ASSEMBLY LANGUAGE PROGRAMMING LECTURE 26, FALL 2012 TOPICS TODAY Homework 5 RAM in Circuits Memory Hierarchy Storage Technologies (RAM & Disk) Caching HOMEWORK 5 RAM IN
More informationMultilevel Memories. Joel Emer Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology
1 Multilevel Memories Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology Based on the material prepared by Krste Asanovic and Arvind CPU-Memory Bottleneck 6.823
More informationSemiconductor Memory Types Microprocessor Design & Organisation HCA2102
Semiconductor Memory Types Microprocessor Design & Organisation HCA2102 Internal & External Memory Semiconductor Memory RAM Misnamed as all semiconductor memory is random access Read/Write Volatile Temporary
More informationSAE5C Computer Organization and Architecture. Unit : I - V
SAE5C Computer Organization and Architecture Unit : I - V UNIT-I Evolution of Pentium and Power PC Evolution of Computer Components functions Interconnection Bus Basics of PCI Memory:Characteristics,Hierarchy
More informationThe Memory Hierarchy /18-213/15-513: Introduction to Computer Systems 11 th Lecture, October 3, Today s Instructor: Phil Gibbons
The Memory Hierarchy 15-213/18-213/15-513: Introduction to Computer Systems 11 th Lecture, October 3, 2017 Today s Instructor: Phil Gibbons 1 Today Storage technologies and trends Locality of reference
More informationStorage. Hwansoo Han
Storage Hwansoo Han I/O Devices I/O devices can be characterized by Behavior: input, out, storage Partner: human or machine Data rate: bytes/sec, transfers/sec I/O bus connections 2 I/O System Characteristics
More informationNode Hardware. Performance Convergence
Node Hardware Improved microprocessor performance means availability of desktop PCs with performance of workstations (and of supercomputers of 10 years ago) at significanty lower cost Parallel supercomputers
More informationComputer Architecture Review. ICS332 - Spring 2016 Operating Systems
Computer Architecture Review ICS332 - Spring 2016 Operating Systems ENIAC (1946) Electronic Numerical Integrator and Calculator Stored-Program Computer (instead of Fixed-Program) Vacuum tubes, punch cards
More informationChapter 5: Computer Systems Organization. Invitation to Computer Science, C++ Version, Third Edition
Chapter 5: Computer Systems Organization Invitation to Computer Science, C++ Version, Third Edition Objectives In this chapter, you will learn about: The components of a computer system Putting all the
More informationChapter 5: Computer Systems Organization
Objectives Chapter 5: Computer Systems Organization Invitation to Computer Science, C++ Version, Third Edition In this chapter, you will learn about: The components of a computer system Putting all the
More informationStorage Devices for Database Systems
Storage Devices for Database Systems 5DV120 Database System Principles Umeå University Department of Computing Science Stephen J. Hegner hegner@cs.umu.se http://www.cs.umu.se/~hegner Storage Devices for
More informationUNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering. Computer Architecture ECE 568
UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering Computer Architecture ECE 568 Part 6 Input/Output Israel Koren ECE568/Koren Part.6. CPU performance keeps increasing 26 72-core Xeon
More informationChapter 9: A Closer Look at System Hardware
Chapter 9: A Closer Look at System Hardware CS10001 Computer Literacy Chapter 9: A Closer Look at System Hardware 1 Topics Discussed Digital Data and Switches Manual Electrical Digital Data Representation
More informationTechnology in Action
Technology in Action Chapter 9 Behind the Scenes: A Closer Look at System Hardware 1 Binary Language Computers work in binary language. Consists of two numbers: 0 and 1 Everything a computer does is broken
More informationChapter 9: A Closer Look at System Hardware 4
Chapter 9: A Closer Look at System Hardware CS10001 Computer Literacy Topics Discussed Digital Data and Switches Manual Electrical Digital Data Representation Decimal to Binary (Numbers) Characters and
More informationAdministrivia. CMSC 411 Computer Systems Architecture Lecture 19 Storage Systems, cont. Disks (cont.) Disks - review
Administrivia CMSC 411 Computer Systems Architecture Lecture 19 Storage Systems, cont. Homework #4 due Thursday answers posted soon after Exam #2 on Thursday, April 24 on memory hierarchy (Unit 4) and
More informationA Review of Chapter 5 and. CSc 2010 Spring 2012 Instructor: Qian Hu
A Review of Chapter 5 and Chapter 6 Chapter 5 Computer Systems Organization Von Neumann Architecture 4 Components Memory Input/output ALU Control Unit Two major features Stored program concept Sequential
More informationMass-Storage Structure
CS 4410 Operating Systems Mass-Storage Structure Summer 2011 Cornell University 1 Today How is data saved in the hard disk? Magnetic disk Disk speed parameters Disk Scheduling RAID Structure 2 Secondary
More informationThe Memory Hierarchy & Cache
Removing The Ideal Memory Assumption: The Memory Hierarchy & Cache The impact of real memory on CPU Performance. Main memory basic properties: Memory Types: DRAM vs. SRAM The Motivation for The Memory
More informationComputer System Architecture
CSC 203 1.5 Computer System Architecture Department of Statistics and Computer Science University of Sri Jayewardenepura Secondary Memory 2 Technologies Magnetic storage Floppy, Zip disk, Hard drives,
More informationFinal Lecture. A few minutes to wrap up and add some perspective
Final Lecture A few minutes to wrap up and add some perspective 1 2 Instant replay The quarter was split into roughly three parts and a coda. The 1st part covered instruction set architectures the connection
More informationCOMPUTER ORGANIZATION AND DESIGN
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface 5 th Edition Chapter 5 Large and Fast: Exploiting Memory Hierarchy Principle of Locality Programs access a small proportion of their address
More informationEN1640: Design of Computing Systems Topic 06: Memory System
EN164: Design of Computing Systems Topic 6: Memory System Professor Sherief Reda http://scale.engin.brown.edu Electrical Sciences and Computer Engineering School of Engineering Brown University Spring
More informationComputer Architecture A Quantitative Approach, Fifth Edition. Chapter 2. Memory Hierarchy Design. Copyright 2012, Elsevier Inc. All rights reserved.
Computer Architecture A Quantitative Approach, Fifth Edition Chapter 2 Memory Hierarchy Design 1 Introduction Programmers want unlimited amounts of memory with low latency Fast memory technology is more
More informationLatches. IT 3123 Hardware and Software Concepts. Registers. The Little Man has Registers. Data Registers. Program Counter
IT 3123 Hardware and Software Concepts Notice: This session is being recorded. CPU and Memory June 11 Copyright 2005 by Bob Brown Latches Can store one bit of data Can be ganged together to store more
More informationCS 140 Introduction to Computing & Computer Technology. Computing Components
CS 140 Introduction to Computing & Computer Technology Computing Components We ve looked at the elementary building blocks of computers transistors, gates, and circuits OK, but how do computers really
More informationSummary of Computer Architecture
Summary of Computer Architecture Summary CHAP 1: INTRODUCTION Structure Top Level Peripherals Computer Central Processing Unit Main Memory Computer Systems Interconnection Communication lines Input Output
More informationCS 2461: Computer Architecture 1 The Memory Hierarchy and impact on program performance
Next CS 2461: The Memory Hierarchy and impact on program performance Instructor: Prof. Bhagi Narahari Performance of programs What to measure Model? Technology trends real processors how to improve performance
More informationIntroduction. Computer System Organization. Languages, Levels, Virtual Machines. A multilevel machine. Sarjana Magister Program
Computer System Organization Sarjana Magister Program Introduction Tb. Maulana Kusuma Week 1 Session 1 Languages, Levels, Virtual Machines A multilevel machine 1 Contemporary Multilevel Machines A six-level
More informationTechnology in Action. Chapter Topics. Participation Question. Participation Question. Participation Question 8/8/11
Technology in Action Chapter 6 Understanding and Assessing Hardware: Evaluating Your System 1 Chapter Topics To buy or to upgrade? Evaluating your system CPU RAM Storage devices Video card Sound card System
More informationUNIT 2 Data Center Environment
UNIT 2 Data Center Environment This chapter provides an understanding of various logical components of hosts such as file systems, volume managers, and operating systems, and their role in the storage
More informationRandom-Access Memory (RAM) Lecture 13 The Memory Hierarchy. Conventional DRAM Organization. SRAM vs DRAM Summary. Topics. d x w DRAM: Key features
Random-ccess Memory (RM) Lecture 13 The Memory Hierarchy Topics Storage technologies and trends Locality of reference Caching in the hierarchy Key features RM is packaged as a chip. Basic storage unit
More information