CDA 3103 Computer Organization Review Instructor: Hao Zheng Dept. Comp. Sci & Eng. USF.

Slides:

Advertisements

Similar presentations

Cache Memory Exercises. Questions I Given: –memory is little-endian and byte addressable; memory size; –number of cache blocks, size of cache block –An.

Advertisements

Princess Sumaya Univ. Computer Engineering Dept. Chapter 2: IT Students.

1 CMPT 300 Introduction to Operating Systems Virtual Memory Sample Questions.

Topics covered: Memory subsystem CSE243: Introduction to Computer Architecture and Hardware/Software Interface.

Practical Caches COMP25212 cache 3. Learning Objectives To understand: –Additional Control Bits in Cache Lines –Cache Line Size Tradeoffs –Separate I&D.

Virtual Memory. Hierarchy Cache Memory : Provide invisible speedup to main memory.

COE Computer Organization & Assembly Language

The Lord of the Cache Project 3. Caches Three common cache designs: Direct-Mapped store in exactly one cache line Fully Associative store in any cache.

How caches take advantage of Temporal locality

Memory Hierarchies Exercises [ ] Describe the general characteristics of a program that would exhibit very little spatial or temporal locality with.

Direct Map Cache Tracing Exercise. Exercise #1: Setup Information CS2100 Cache I 2 Memory 4GB Memory Address 310N-1N Block Number Offset 1 Block = 8 bytes.

Riyadh Philanthropic Society For Science Prince Sultan College For Woman Dept. of Computer & Information Sciences CS 251 Introduction to Computer Organization.

Caches – basic idea Small, fast memory Stores frequently-accessed blocks of memory. When it fills up, discard some blocks and replace them with others.

Paging Examples Assume a page size of 1K and a 15-bit logical address space. How many pages are in the system?

Lecture Objectives: 1)Define the terms least significant bit and most significant bit. 2)Explain how unsigned integer numbers are represented in memory.

Ch. 12 Cache Direct Mapped Cache. Comp Sci mem hierarchy 2 Memory Hierarchy Registers: very few, very fast cache memory: small, fast main memory:

CSE 241 Computer Engineering (1) هندسة الحاسبات (1) Lecture #3 Ch. 6 Memory System Design Dr. Tamer Samy Gaafar Dept. of Computer & Systems Engineering.

Computer Architecture Memory, Math and Logic. Basic Building Blocks Seen: – Memory – Logic & Math.

Computer Organization and Architecture Instructions: Language of the Machine Hennessy Patterson 2/E chapter 3. Notes are available with photocopier 24.

GCSE ICT Storing data - Internal memory, backing storage, and measuring memory.

Represents different voltage levels High: 5 Volts Low: 0 Volts At this raw level a digital computer is instructed to carry out instructions.

1 Chapter Seven. 2 Users want large and fast memories! SRAM access times are ns at cost of $100 to $250 per Mbyte. DRAM access times are ns.

1 Chapter Seven. 2 Users want large and fast memories! SRAM access times are ns at cost of $100 to $250 per Mbyte. DRAM access times are ns.

Binary 101 Gads Hill School. Aim To strengthen understanding of how computers use the binary number system to store information.

Additional Slides By Professor Mary Jane Irwin Pennsylvania State University Group 1.

COMP SYSTEM ARCHITECTURE PRACTICAL CACHES Sergio Davies Feb/Mar 2014COMP25212 – Lecture 3.

Cache Organization 1 Computer Organization II © CS:APP & McQuain Cache Memory and Performance Many of the following slides are taken with.

CSE 351 Caches. Section Feedback Before we begin, we’d like to get some feedback about section If you could answer the following questions on the provided.

MIPS Processor.

Representation of Data Binary Representation of Instructions teachwithict.weebly.com.

First Foray into Programming (the hard way). A reminder from last lesson: A machine code instruction has two parts:  Op-code  Operand An instruction.

COSC2410: LAB 19 INTRODUCTION TO MEMORY/CACHE DIRECT MAPPING 1.

Memory Hierarchy and Cache. A Mystery… Memory Main memory = RAM : Random Access Memory – Read/write – Multiple flavors – DDR SDRAM most common 64 bit.

Number Systems Decimal Can you write 12,045 in expanded form? Base? Allowable digits for each place?

Improving Memory Access The Cache and Virtual Memory

Data representation How do we represent data in a digital system?

Tutorial Nine Cache CompSci Semester One 2016.

CS2100 Computer Organization

COMPUTER ARCHITECTURE & OPERATIONS I

Direct Cache Structure

Consider a Direct Mapped Cache with 4 word blocks

TAO1221 COMPUTER ARCHITECTURE AND ORGANIZATION LAB 6

Computer Architecture

Paging Examples Assume a page size of 1K and a 15-bit logical address space. How many pages are in the system?

Instruction Formats Each instruction consists of two parts:

The Processor and Machine Language

CSCI206 - Computer Organization & Programming

Computer Architecture

CSCI206 - Computer Organization & Programming

FIGURE 12-1 Memory Hierarchy

Interconnect with Cache Coherency Manager

MIPS Processor.

MIPS Instruction Encoding

Lecture 22: Cache Hierarchies, Memory

Help! How does cache work?

Direct Mapping.

MIPS Instruction Encoding

CSCI 6307 Foundation of Systems – Exercise (3)

Chapter 6 Memory Linda Null, Julia Lobur.

Data representation How do we represent data in a digital system?

Basic Cache Operation Prof. Eric Rotenberg

Cache Memory and Performance

Data representation How do we represent data in a digital system?

MIPS Processor.

Digital Logic Design.

Memory Management & Virtual Memory

Presentation transcript:

CDA 3103 Computer Organization Review Instructor: Hao Zheng Dept. Comp. Sci & Eng. USF

Worksheet

A digital computer has a memory unit with 32 bits per word. The instruction set consists of 150 different operations. All instructions have an operation code part (opcode) and an address part (allowing for only one address). Each instruction is stored in one word of memory. 1.How many bits are needed for the opcode? 2.How many bits are left for the address part of the instruction? 3.What is the maximum allowable size for memory? 4.What is the largest unsigned binary number that can be accommodated in one word of memory?

A digital computer has a memory unit with 32 bits per word. The instruction set consists of 150 different operations. All instructions have an operation code part (opcode) and an address part (allowing for only one address). Each instruction is stored in one word of memory. 5.Assume the memory is byte-addressable. How many bits are in the memory address? 6.If only 1M × 8 bits RAM chips are available, how many such chips are needed to build the memory? 7.In a memory address, how many bits are used to select a chip? How many bits are needed to find offset on a chip?

5. Suppose a computer using fully associative cache has 224 bytes of byte-addressable main memory and a cache of 128 blocks, where each cache block contains 64 bytes. 1.How many blocks of main memory are there? 2.What is the format of a memory address as seen by the cache, i.e., what are the sizes of the tag and offset fields? 3.To which cache block will the memory address 0x01D872 map?