COMP375 Practice Final Exam

Similar documents
Quiz for Chapter 6 Storage and Other I/O Topics 3.10

ECE331: Hardware Organization and Design

Perfect Student CS 343 Final Exam May 19, 2011 Student ID: 9999 Exam ID: 9636 Instructions Use pencil, if you have one. For multiple choice

STORING DATA: DISK AND FILES

User. Application program. Interfaces. Operating system. Hardware

IA-32 Architecture COE 205. Computer Organization and Assembly Language. Computer Engineering Department

The CPU and Memory. How does a computer work? How does a computer interact with data? How are instructions performed? Recall schematic diagram:

Chapter 6 Part 1 Understanding Hardware

Module 1: Basics and Background Lecture 4: Memory and Disk Accesses. The Lecture Contains: Memory organisation. Memory hierarchy. Disks.

Structure of Computer Systems

BASIC COMPUTER ORGANIZATION. Operating System Concepts 8 th Edition

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

Storage Devices for Database Systems

( D ) 4. Which is not able to solve the race condition? (A) Test and Set Lock (B) Semaphore (C) Monitor (D) Shared memory

EE 457 Unit 7b. Main Memory Organization

Computer Organization

Data Storage and Query Answering. Data Storage and Disk Structure (2)

[537] I/O Devices/Disks. Tyler Harter

Virtual Memory - Objectives

Basic Concepts COE 205. Computer Organization and Assembly Language Dr. Aiman El-Maleh

Microcomputer Architecture and Programming

CMPUT101 Introduction to Computing - Summer 2002

Name: Instructions. Problem 1 : Short answer. [56 points] CMU Storage Systems 25 Feb 2009 Spring 2009 Exam 1

CSE 451: Operating Systems Spring Module 12 Secondary Storage. Steve Gribble

Show how to connect three Full Adders to implement a 3-bit ripple-carry adder

Memory hierarchy and cache

CS 201 The Memory Hierarchy. Gerson Robboy Portland State University

CS433 Homework 6. Problem 1 [15 points] Assigned on 11/28/2017 Due in class on 12/12/2017

Memory Management Outline. Operating Systems. Motivation. Paging Implementation. Accessing Invalid Pages. Performance of Demand Paging

Final Exam Preparation Questions

The Von Neumann Architecture Odds and Ends. Designing Computers. The Von Neumann Architecture. CMPUT101 Introduction to Computing - Spring 2001

ECE 3055: Final Exam

CC312: Computer Organization

CS433 Homework 6. Problem 1 [15 points] Assigned on 11/28/2017 Due in class on 12/12/2017

Database Systems II. Secondary Storage

Data Storage - I: Memory Hierarchies & Disks. Contains slides from: Naci Akkök, Pål Halvorsen, Hector Garcia-Molina, Ketil Lund, Vera Goebel

Multiple Choice Type Questions

Memory: Page Table Structure. CSSE 332 Operating Systems Rose-Hulman Institute of Technology

CSE 451: Operating Systems Spring Module 12 Secondary Storage

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

Lecture 18: Memory Systems. Spring 2018 Jason Tang

CS 471 Operating Systems. Yue Cheng. George Mason University Fall 2017

Designing Computers. The Von Neumann Architecture. The Von Neumann Architecture. The Von Neumann Architecture

The Von Neumann Architecture. Designing Computers. The Von Neumann Architecture. CMPUT101 Introduction to Computing - Spring 2001

CMPUT101 Introduction to Computing - Summer 2002

Summary of Computer Architecture

Computer System Overview OPERATING SYSTEM TOP-LEVEL COMPONENTS. Simplified view: Operating Systems. Slide 1. Slide /S2. Slide 2.

Computer System Overview

Two hours - online. The exam will be taken on line. This paper version is made available as a backup

Introduction. Operating Systems. Outline. Hardware. I/O Device Types. Device Controllers. One OS function is to control devices

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

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

Introduction. Operating Systems. Outline. Hardware. I/O Device Types. Device Controllers. One OS function is to control devices

Computer Architecture 2/26/01 Lecture #

ELE 375 Final Exam Fall, 2000 Prof. Martonosi

CSE 451: Operating Systems Winter Lecture 12 Secondary Storage. Steve Gribble 323B Sieg Hall.

MEHRAN UNIVERSITY OF ENGINEERING AND TECHNOLOGY, JAMSHORO. FIRST TERM FIRST YEAR (1 ST TERM) B.E.(ELECTRICAL) REGULAR EXAMINATION 2009 OF 09-BATCH.

Improving System. Performance: Caches

Monday, May 4, Discs RAID: Introduction Error detection and correction Error detection: Simple parity Error correction: Hamming Codes

CSE 451: Operating Systems Winter Secondary Storage. Steve Gribble. Secondary storage

CHAPTER 4 MARIE: An Introduction to a Simple Computer

Cache memories are small, fast SRAM-based memories managed automatically in hardware. Hold frequently accessed blocks of main memory

Chapter 5 Input/Output

Computer Architecture (part 2)

Introduction. Operating Systems. Outline. Hardware. I/O Device Types. Device Controllers. (done)

Chapter 5. Large and Fast: Exploiting Memory Hierarchy

Author : Dalbir Singh, Computer Science Deptt. CPU Structure and Functions. 1. Processor Organization

File system internals Tanenbaum, Chapter 4. COMP3231 Operating Systems

CSE 378 Final 3/18/10

Virtual to physical address translation

CS143: Disks and Files

CS 265. Computer Architecture. Wei Lu, Ph.D., P.Eng.

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

William Stallings Computer Organization and Architecture 8 th Edition. Chapter 11 Instruction Sets: Addressing Modes and Formats

The University of Adelaide, School of Computer Science 13 September 2018

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

CIT 668: System Architecture. Computer Systems Architecture

Advanced Memory Organizations

3 Computer Architecture and Assembly Language

In 8086 Carry flag, Parity flag, Auxiliary carry flag, Zero flag, Overflow flag, Trace flag, Interrupt flag, Direction flag, and Sign flag.

1. Truthiness /8. 2. Branch prediction /5. 3. Choices, choices /6. 5. Pipeline diagrams / Multi-cycle datapath performance /11

Practice Exercises 449

Main Memory (RAM) Organisation

Outlines. Chapter 2 Storage Structure. Structure of a DBMS (with some simplification) Structure of a DBMS (with some simplification)

Hard Disk Drives. Nima Honarmand (Based on slides by Prof. Andrea Arpaci-Dusseau)

CPU. Fall 2003 CSE 207 Digital Design Project #4 R0 R1 R2 R3 R4 R5 R6 R7 PC STATUS IR. Control Logic RAM MAR MDR. Internal Processor Bus

Disks and Files. Storage Structures Introduction Chapter 8 (3 rd edition) Why Not Store Everything in Main Memory?

Where Have We Been? Ch. 6 Memory Technology

Hardware and Software Architecture. Chapter 2

CS 351 Exam 4, Fall 2010

Operating System Review

William Stallings Computer Organization and Architecture. Chapter 11 CPU Structure and Function


Problem Points 1 /20 2 /20 3 /20 4 /20 5 /20 Total /100

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

EEE3410 Microcontroller Applications Department of Electrical Engineering Lecture 4 The 8051 Architecture

Lecture: Storage, GPUs. Topics: disks, RAID, reliability, GPUs (Appendix D, Ch 4)

CS 351 Exam 3 Mon. 5/11/2015

Components of the Virtual Memory System

Introduction. Computer System Organization. Languages, Levels, Virtual Machines. A multilevel machine. Sarjana Magister Program

Transcription:

You are allowed one and only one 8½ by 11 inch page of notes during this exam. You are not allowed to use more than 187 square inches of paper surface to hold your notes. Telephone calls and texting are not allowed during the exam. The following table represents the microcode for the simple CPU shown above. Each column represents the possible setting of the switches shown as small circles in the diagram. The possible tions are ADD, SUB, AND, OR, DECrement by 1 and INCrement by 1. The possible memory tions are READ, WRITE, and WAIT. 1. [8 points] add R2, 47 Add the constant to R2. Show the instruction fetch and program counter incrementation. IR IRadr result oprnd R1 R1 R2 R2 MAR Mem 2. [7 points] return Pop the return address from the stack and put it in the program counter. Assume R2 is the stack pointer. Do NOT show the instruction fetch. IR IRadr result oprnd R1 R1 R2 R2 MAR Mem (The tables may or may not be longer than necessary.) 3. [7 points] Imagine your company has a database server that you need to keep running even if one of the disk drives fails. The operating system uses 24 GB of space and the database requires 200 GB of space. There is a good deal on 320 GB drives. How should you configure the server s disks and how many disks are required? COMP375-001 Computer Architecture and Organization page 1 of 5 page total

A protocol requires the CPU to put the address on the during the first clock period. On the fourth clock period and every clock period afterwards data is retrieved from the RAM. 4. [10 points] Assume the system has a 256 bit wide. The system always reads 96 bytes at a time. How many clock cycles does it take from when the CPU first requests the data until 96 bytes have been read? (Note the diagram above may or may not show more or less cycles than necessary.) If the operates at 800 MHz, how long is a single clock cycle? How many nanoseconds does it take to read 96 bytes from the RAM? 5. [4 points] New Intel processors have a feature called Enhanced Intel SpeedStep Technology that reduces the system voltage and clock frequency when the system is relatively idle. Why might you want to do this? What advantage does this provide? 6. [7 points] You just purchased a server with a RAID 5 controller that has 5 physical disk drives of 320 GB each. How much data can you store on the server? COMP375-001 Computer Architecture and Organization page 2 of 5 page total

7. [12 points] Write a program in Intel assembler to perform the equivalent calculations as shown in C++. int horse, mule, donkey; cin >> horse >> mule >> donkey; // reads data in C++ _asm { /* write this part in assembler horse = donkey * (mule + horse); mule++; if ( mule > 42 ) { donkey = 23; } else { donkey = 12; } */ } cout << horse << mule << donkey << endl; 8. [8 points] Consider a system with a 64 bit address space, 4 MB cache with 64 byte lines using direct mapping. Divide the address below labeling each part of the address and specify the size of each field in bits. COMP375-001 Computer Architecture and Organization page 3 of 5 page total

Rotational Speed 15,000 RPM Average Read Seek Time 4.8 ms Track-To-Track Seek Time 2.0 ms Full Stroke Seek 19.2 ms Cylinders 32,767 Number of Heads (Physical) 4 Sectors Per Track 63 Bytes Per Sector 512 9. [10 points] How long, on the average, will it take to read a 24 KB file from the above disk assuming all blocks are stored together on a track? 10. [9 points] A memory system has RAM with an access time of 54.0 nsec and cache memory with an access time of 4.8 nsec. If the system gets an average hit rate of 91%, what is the average memory access time? 11. [2 points] Roughly how many nanoseconds are there in a millisecond? COMP375-001 Computer Architecture and Organization page 4 of 5 page total

12. [8 points] Explain the two different forms of the locality of reference. 13. [8 points] Explain how locality of reference and the memory hierarchy work together to improve system performance. COMP375-001 Computer Architecture and Organization page 5 of 5 page total