TAG Word 0 Word 1 Word 2 Word 3 0x0A0 D2 55 C7 C8 0x0A0 FC FA AC C7 0x0A0 A5 A6 FF 00

Similar documents
ELE 758 * DIGITAL SYSTEMS ENGINEERING * MIDTERM TEST * Circle the memory type based on electrically re-chargeable elements

Chapter Seven. Memories: Review. Exploiting Memory Hierarchy CACHE MEMORY AND VIRTUAL MEMORY

1. Creates the illusion of an address space much larger than the physical memory

ELEC 5200/6200 Computer Architecture and Design Spring 2017 Lecture 7: Memory Organization Part II

COSC 6385 Computer Architecture - Memory Hierarchies (III)

Adapted from instructor s supplementary material from Computer. Patterson & Hennessy, 2008, MK]

Figure 1: Organisation for 128KB Direct Mapped Cache with 16-word Block Size and Word Addressable

Memory latency: Affects cache miss penalty. Measured by:

ELE 375 Final Exam Fall, 2000 Prof. Martonosi

Memory latency: Affects cache miss penalty. Measured by:

CSE Computer Architecture I Fall 2011 Homework 07 Memory Hierarchies Assigned: November 8, 2011, Due: November 22, 2011, Total Points: 100

Computer Systems Architecture I. CSE 560M Lecture 18 Guest Lecturer: Shakir James

Main Memory. EECC551 - Shaaban. Memory latency: Affects cache miss penalty. Measured by:

Chapter 5. Large and Fast: Exploiting Memory Hierarchy

Basics DRAM ORGANIZATION. Storage element (capacitor) Data In/Out Buffers. Word Line. Bit Line. Switching element HIGH-SPEED MEMORY SYSTEMS

Topic 18: Virtual Memory

Pipelined processors and Hazards

Memory Technology. Chapter 5. Principle of Locality. Chapter 5 Large and Fast: Exploiting Memory Hierarchy 1

Memory Technology. Caches 1. Static RAM (SRAM) Dynamic RAM (DRAM) Magnetic disk. Ideal memory. 0.5ns 2.5ns, $2000 $5000 per GB

Caches. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University

Contents. Memory System Overview Cache Memory. Internal Memory. Virtual Memory. Memory Hierarchy. Registers In CPU Internal or Main memory

Virtual to physical address translation

CS152 Computer Architecture and Engineering Lecture 19: I/O Systems

Computer System Components

COSC 6385 Computer Architecture - Memory Hierarchies (II)

Mainstream Computer System Components

Memory systems. Memory technology. Memory technology Memory hierarchy Virtual memory

Chapter 5 Large and Fast: Exploiting Memory Hierarchy (Part 1)

Chapter 4 Main Memory

Computer Organization (Autonomous)

Chapter 5B. Large and Fast: Exploiting Memory Hierarchy

EE414 Embedded Systems Ch 5. Memory Part 2/2

Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier

Mainstream Computer System Components CPU Core 2 GHz GHz 4-way Superscaler (RISC or RISC-core (x86): Dynamic scheduling, Hardware speculation

Improving Memory Access The Cache and Virtual Memory

Spring 2018 :: CSE 502. Main Memory & DRAM. Nima Honarmand

CS650 Computer Architecture. Lecture 9 Memory Hierarchy - Main Memory

Computer Architecture A Quantitative Approach, Fifth Edition. Chapter 2. Memory Hierarchy Design. Copyright 2012, Elsevier Inc. All rights reserved.

Timing System Modules

EN1640: Design of Computing Systems Topic 06: Memory System


Structure of Computer Systems

COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. 5 th. Edition. Chapter 5. Large and Fast: Exploiting Memory Hierarchy

Adapted from David Patterson s slides on graduate computer architecture

CS152 Computer Architecture and Engineering. Lecture 15 Virtual Memory Dave Patterson. John Lazzaro. www-inst.eecs.berkeley.

Virtual Memory Nov 9, 2009"

Chapter Seven Morgan Kaufmann Publishers

Multilevel Memories. Joel Emer Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology

Computer Memory. Textbook: Chapter 1

Memory. Lecture 22 CS301

EEM 486: Computer Architecture. Lecture 9. Memory

Lecture 8: Virtual Memory. Today: DRAM innovations, virtual memory (Sections )

Views of Memory. Real machines have limited amounts of memory. Programmer doesn t want to be bothered. 640KB? A few GB? (This laptop = 2GB)

Mainstream Computer System Components

Memory. Objectives. Introduction. 6.2 Types of Memory

ECE 3056: Architecture, Concurrency, and Energy of Computation. Sample Problem Set: Memory Systems

ECE7995 (4) Basics of Memory Hierarchy. [Adapted from Mary Jane Irwin s slides (PSU)]

FINALTERM EXAMINATION Fall 2008 CS501- Advance Computer Architecture (Session - 1) Marks: 75

Embedded System Design

Chapter 2: Memory Hierarchy Design (Part 3) Introduction Caches Main Memory (Section 2.2) Virtual Memory (Section 2.4, Appendix B.4, B.

Midterm #2 Solutions April 23, 1997

COMPUTER ORGANIZATION AND DESIGN

CS 333 Introduction to Operating Systems. Class 11 Virtual Memory (1) Jonathan Walpole Computer Science Portland State University

Reducing Hit Times. Critical Influence on cycle-time or CPI. small is always faster and can be put on chip

EN1640: Design of Computing Systems Topic 06: Memory System

CS 261 Fall Mike Lam, Professor. Memory

Introduction to cache memories

LECTURE 5: MEMORY HIERARCHY DESIGN

Computer Architecture. Memory Hierarchy. Lynn Choi Korea University

and data combined) is equal to 7% of the number of instructions. Miss Rate with Second- Level Cache, Direct- Mapped Speed

Original Processor Frequency: AMD FX(tm)-6100 Six-Core Processor. CPU Thermal Design Power (TDP): Microcode Update Revision:

CS 3510 Comp&Net Arch

Chapter 8 Virtual Memory

UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering. Computer Architecture ECE 568/668

Memory hierarchy and cache

Main Memory (Fig. 7.13) Main Memory

Copyright 2012, Elsevier Inc. All rights reserved.

Computer Architecture. A Quantitative Approach, Fifth Edition. Chapter 2. Memory Hierarchy Design. Copyright 2012, Elsevier Inc. All rights reserved.

Memory Technologies. Technology Trends

ECE 485/585 Midterm Exam

Midterm II December 3 rd, 2007 CS162: Operating Systems and Systems Programming

Virtual Memory. Reading. Sections 5.4, 5.5, 5.6, 5.8, 5.10 (2) Lecture notes from MKP and S. Yalamanchili

14:332:331. Week 13 Basics of Cache

The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL

Read this before starting!

Computer Systems Laboratory Sungkyunkwan University

LECTURE 10: Improving Memory Access: Direct and Spatial caches

Computer Organization. 8th Edition. Chapter 5 Internal Memory

The levels of a memory hierarchy. Main. Memory. 500 By 1MB 4GB 500GB 0.25 ns 1ns 20ns 5ms

Copyright 2012, Elsevier Inc. All rights reserved.

registers data 1 registers MEMORY ADDRESS on-chip cache off-chip cache main memory: real address space part of virtual addr. sp.

CENG3420 Lecture 08: Memory Organization

Architectural Differences nc. DRAM devices are accessed with a multiplexed address scheme. Each unit of data is accessed by first selecting its row ad

Product Technical Brief S3C2413 Rev 2.2, Apr. 2006

Memory hierarchy Outline

The Memory Hierarchy Part I

Chapter Seven. SRAM: value is stored on a pair of inverting gates very fast but takes up more space than DRAM (4 to 6 transistors)

Embedded Systems Design: A Unified Hardware/Software Introduction. Outline. Chapter 5 Memory. Introduction. Memory: basic concepts

Embedded Systems Design: A Unified Hardware/Software Introduction. Chapter 5 Memory. Outline. Introduction

CS252 S05. Main memory management. Memory hardware. The scale of things. Memory hardware (cont.) Bottleneck

Transcription:

ELE 758 Final Examination 2000: Answers and solutions Number of hits = 15 Miss rate = 25 % Miss rate = [5 (misses) / 20 (total memory references)]* 100% = 25% Show the final content of cache using the content of SDRAM (4) TAG Word 0 Word 1 Word 2 Word 3 0x0A0 D2 55 C7 C8 0x0A0 FC FA AC C7 0x0A0 A5 A6 FF 00 Fig. 1.1 Direct-mapped cache (4 x 4 words) Question # 1.2 a) Determine block size (N) in BYTES if miss penalty Tm = Taddr (SDRAM) + NxTw: Block size N = 64 Bytes Tav = Rhit x Th + R miss x T miss = R hit x Th + (1 Rhit) x [Taddr (SDRAM) + N x Tw ] N = [ T av R hit x Th (1 R hit)x Taddr (SDRAM)] / (1- Rhit) x Tw = = [21.5 ns 0.95 x 10 ns x 10 ns (1 0.95) x 80 ns ] / (1 0.95) x 10 ns = 16 Words = 16 x 4 Bytes = 64 Bytes b) Determine number of cache entries - N entr = 4096 N entr = Cache SRAM volume / Block size = 64 K x 32 bits / 16 x 32 bites = 4096 b) Create address word fields: Byte offset field contains 2 bits, because 32 bits Word contains 4 Bytes Block offset field contains 4 bits, because block contains 16 words Index field contains 12 bits, because cache contains 4096 entries Tag field contains 14 bits, because 32 bits (Addr. Word) 12 bits (Index field) 4 bits (block offset field) 2 bits (byte offset field) = 14 bits

CPU initiates data loads from the following Virtual addresses: a) 0x000061F3; b) 0x0000C015; c) 0x0000A034 For each reference determine Virtual and Physical page number, Page offset and Physical address, TLB and Cache hit or miss, Data read and necessity of Write back procedure initiation: Note: If the data is located in Main memory please put DMM- Data in the Main Memory For Virtual address = 0x000061F3 Determine the followings: Virtual page # = 00006 Page offset = 1F3 TLB hit or miss Hit Cache hit or miss Hit Physical page # 204 Physical address 0x2041F3 Data to CPU 0xAC Initiate the write back procedure? Yes or No (circle)? For Virtual address = 0x0000C015 Determine the followings: Virtual page # = 0000C Page offset = 015 TLB hit or miss Miss Cache hit or miss Hit Physical page # 02A Physical address 02A015 Data to CPU 7F Initiate the write back procedure? Yes or No (circle)? For Virtual address = 0x0000A034 Determine the followings: Virtual page # = 0000A Page offset = 034 TLB hit or miss Miss Cache hit or miss Miss Physical page # 1C0 Physical address 0x1C0034 Data to CPU DMM Initiate the write back procedure? Yes or No (circle)? Question # 3.1 V fpp = 2 sides x 80 tracks x 18 sectors x 512 B = 1440 KB Question # 3.2 Number of disks = 8

Ndisks = Total volume / (Number of cylinders * number of sectors * block size * 2) = =2167000000 B / (4200 x 63 x 512 B x 2) = 7.99 = 8 Data transfer rate in Mbytes / S (speed with which data can be transferred to CPU from the disk). R hdd = 3.076 MB / S R hdd = Number of rotations per second * number of sectors per track * block size = (6000 RPM / 60 S) x 63 x 512 B = 3225600 B /S = 3.076 MB / S Page fault penalty (time to replace block when page fault occurs), assuming that write back procedure is always initiated (worst case scenario) and there is no HDDcontroller overhead: T fp = 5 ms T fp = (Access time + Page transfer time) x 2 = 1.23 ms + 4096 B / 3225600 B/S = =(1.23mS + 1.27 ms) x 2 = 5 ms Question # 3.3 a) Video-output sub-system: D-to-A converters for R, G and B channels -Resolution and video-signal frequency: R-channel DAC: Resolution 10 bits; G-channel DAC: Resolution 12 bits; B-channel DAC: Resolution 10 bits; Conversion rate for RGB DACs 131.072 M Samples / S Conv. Rate = 1280 x 1024 pixels x 100 frames / s = 131.072 MS/s b) Calculate the frequency for synchro-signals for the non-interlived video-output: Vertical synchro-signal frequency F vs = 100 Hz

Horizontal synchro-signal frequency F hs = 102.4 KHz F hs = 1024 rows x 100 frames / s = 102.4 KHz c) Video-RAM subsystem : Calculate the total value of Video-RAM (Graphic mode), which should have two pages. One page is used for synchronous video-output and another to accumulate the data from the PCI-bus (next frame). Total Video-RAM volume = 10 M bytes V vram = 1280 pixels / row x 1024 rows x 32 bits /pixel x 2pages = 10240 KB = 10 MB Calculate minimum data transfer rate in M Bytes / S necessary to transfer the next frame (picture) within the display period of current frame: R dt (video) = 500 MB / S (2) R dt = 1280 pixels / row x 4 B / pixel x 1024 rows / frame x 100 frames / S = 500 MB / S Question #.4.1 a) Calculate the maximum PCI-bus data transfer rate for addressed (each data has individual address) and non-addressed (burst) data transmission (page transfer, etc.) Addressed mode Data transfer rate R dt (addr) = 132 Mbyte / S (1) Non-addressed mode Data transfer rate R dt (addr) = 264 Mbyte / S (1) Addr mode R = 8 B x 33 MHz / 2 (addr / data multiplexed) = 132 MB /S Non-addr mode R = 8 B x 33 MHz = 264 MB / S b) What a maximum refresh rate is possible to support by the above designed videoadapter (Question 3.3) if non-addressed mode for data transfer is used in PCI-bus. Max. Refresh rate (pictures / sec.) = 52.8 ~ 50 pictures / S Max. Refresh rate = 264 MB / S / 5 MB / picture = 52.8 pictures / S

Question # 4.2 Design the PCI-to- Centronics interface controller. Parameters of the Centronics parallel port are known from the timing diagram: - Data Strobe generates 2 us after the Data (1 Byte) is set on the data lines; - Data Strobe pulse width (pulled down) = 4 us (microseconds); - Time delay between front edge of Data Strobe and front edge (falling) of Acknowledge signal = 8 us (During this period of time device is busy ); - Acknowledge pulse width = 5 us; - It is necessary to have 5 us between the end edge (rising) of the Acknowledge signal and front edge of new Data Strobe signal to set properly next Data on the data lines. Calculate bus bandwidth for the Centronics parallel port: BW ( Centronics ) = _54.25_ KBytes / S (3) BW = 1Byte / (8 + 5 + 5) us = 54.25 KB / S Calculate volume of the FIFO-buffer for above interface controller, which can provide permanent data transmission via Centronics parallel port with the minimum interrupt signal period (from the controller to CPU) = 100 ms. V fifo = 5.425 Kbytes (3) V fifo = 54.25 KB / S x 100 ms = 5.425 KB 5. Section: Computer Networks Question # 5.1 Shared media LAN can interconnect up to 65536 computers. There are 12 types of messages ( Request, Reply, Acknowledge, etc.) Data length in each message can vary from 0 byte to 64 K Bytes (with step = 1 Byte) Maximum length of the file to be transmitted = 4 G Bytes Maximum number of files to be transmitted in the buffer of the network card = 256 Fill blank spaces in the list of packet format fields (Table 5.1):

Table 5.1 (6) Field name Minimum number of bits Type of message 4 Length of the Data 16 Identifier 8 Fragment 16 Source Address 16 Destination Addr. 16 Identifier should generate ID for each of 256 files to be transmitted via buffer. Thus, Identifier field should have 8 bits. Fragment # = Maximum length of the file / Maximum length of message = 16 4 GB / 64 KB = 65536 = 2 Source / Destination Address fields = 16 bits because LAN can interconnect up to 65536 computers. Question # 5.2 In the table 5.2 is shown the packet format for switched media network. Cross the field in the packet, which is not necessary in this type of network. Table 5.2 (1) Field # Field name 1. Type of message 2. N/A Source address 3. Virtual Channel # 4. DATA 5. Check data