Measuring Performance

Slides:



Advertisements
Similar presentations
CMSC 611: Advanced Computer Architecture Performance Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted.
Advertisements

Chapter 4 Device Management and Disk Scheduling DEVICE MANAGEMENT Content I/O device overview I/O device overview I/O organization and architecture I/O.
CA 714CA Midterm Review. C5 Cache Optimization Reduce miss penalty –Hardware and software Reduce miss rate –Hardware and software Reduce hit time –Hardware.
Performance Evaluation of Architectures Vittorio Zaccaria.
Lecture Objectives: 1)Explain the limitations of flash memory. 2)Define wear leveling. 3)Define the term IO Transaction 4)Define the terms synchronous.
Computer Organization and Architecture 18 th March, 2008.
CSCE 212 Chapter 4: Assessing and Understanding Performance Instructor: Jason D. Bakos.
04/18/2007CSCI 315 Operating Systems Design1 Mass Storage Structure Notice: The slides for this lecture have been largely based on those accompanying the.
OS2-1 Chapter 2 Computer System Structures. OS2-2 Outlines Computer System Operation I/O Structure Storage Structure Storage Hierarchy Hardware Protection.
DMA Direct memory access  Problems with programmed I/O  Processor wastes time polling  In our example I.Waiting for a key to be pressed, II.Waiting.
Computational Astrophysics: Methodology 1.Identify astrophysical problem 2.Write down corresponding equations 3.Identify numerical algorithm 4.Find a computer.
Performance D. A. Patterson and J. L. Hennessey, Computer Organization & Design: The Hardware Software Interface, Morgan Kauffman, second edition 1998.
SECTIONS 13.1 – 13.3 Sanuja Dabade & Eilbroun Benjamin CS 257 – Dr. TY Lin SECONDARY STORAGE MANAGEMENT.
Computer Architecture Lecture 2 Instruction Set Principles.
Csci4203/ece43631 Review Quiz. 1)It is less expensive 2)It is usually faster 3)Its average CPI is smaller 4)It allows a faster clock rate 5)It has a simpler.
Using Secondary Storage Effectively In most studies of algorithms, one assumes the "RAM model“: –The data is in main memory, –Access to any item of data.
Informationsteknologi Friday, October 19, 2007Computer Architecture I - Class 61 Today’s class Floating point numbers Computer systems organization.
Fall 2001CS 4471 Chapter 2: Performance CS 447 Jason Bakos.
Amdahl's Law.
Data Storage Technology
5.1 Chaper 4 Central Processing Unit Foundations of Computer Science  Cengage Learning.
Introduction to Database Systems 1 The Storage Hierarchy and Magnetic Disks Storage Technology: Topic 1.
CMSC 611: Advanced Computer Architecture Performance Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted.
Indira Gandhi National Open University presents. A Video Lecture Course: Computer Platforms.
I/O Example: Disk Drives To access data: — seek: position head over the proper track (8 to 20 ms. avg.) — rotational latency: wait for desired sector (.5.
1 Embedded Systems Computer Architecture. Embedded Systems2 Memory Hierarchy Registers Cache RAM Disk L2 Cache Speed (faster) Cost (cheaper per-byte)
Recall: Three I/O Methods Synchronous: Wait for I/O operation to complete. Asynchronous: Post I/O request and switch to other work. DMA (Direct Memory.
1 Chapter 2: Computer-System Structures  Computer System Operation  I/O Structure  Storage Structure  Storage Hierarchy  Hardware Protection  General.
2.1 Operating System Concepts Chapter 2: Computer-System Structures Computer System Operation Storage Structure Storage Hierarchy Hardware Protection General.
Computer Organization and Architecture Tutorial 1 Kenneth Lee.
Chapter 8 External Storage. Primary vs. Secondary Storage Primary storage: Main memory (RAM) Secondary Storage: Peripheral devices  Disk drives  Tape.
Lecture 8: 9/19/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
Adapted from Computer Organization and Design, Patterson & Hennessy ECE232: Hardware Organization and Design Part 17: Input/Output Chapter 6
Performance Performance
ECE568 Final_Exam.1 Copyright 2012 Koren, UMass Israel Koren UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering Computer Architecture.
Overview von Neumann Architecture Computer component Computer function
September 10 Performance Read 3.1 through 3.4 for Wednesday Only 3 classes before 1 st Exam!
Performance – Last Lecture Bottom line performance measure is time Performance A = 1/Execution Time A Comparing Performance N = Performance A / Performance.
Review of Computer System Organization. Computer Startup For a computer to start running when it is first powered up, it needs to execute an initial program.
Processor Memory Processor-memory bus I/O Device Bus Adapter I/O Device I/O Device Bus Adapter I/O Device I/O Device Expansion bus I/O Bus.
EGRE 426 Computer Organization and Design Chapter 4.
Device Management Mark Stanovich Operating Systems COP 4610.
Disk Average Seek Time. Multi-platter Disk platter Disk read/write arm read/write head.
Performance Computer Organization II 1 Computer Science Dept Va Tech January 2009 © McQuain & Ribbens Defining Performance Which airplane has.
SSU 1 Dr.A.Srinivas PES Institute of Technology Bangalore, India 9 – 20 July 2012.
Chapter 11 System Performance Enhancement. Basic Operation of a Computer l Program is loaded into memory l Instruction is fetched from memory l Operands.
10/15: Lecture Topics Input/Output –Types of I/O Devices –How devices communicate with the rest of the system communicating with the processor communicating.
Performance. Moore's Law Moore's Law Related Curves.
Computer System Structures Storage
September 2 Performance Read 3.1 through 3.4 for Tuesday
Chapter 2: Computer-System Structures
How do we evaluate computer architectures?
Defining Performance Which airplane has the best performance?
I/O Resource Management: Software
Basic Computer Organization
CSCE 212 Chapter 4: Assessing and Understanding Performance
CS2100 Computer Organisation
Computer Organization
Sanuja Dabade & Eilbroun Benjamin CS 257 – Dr. TY Lin
Defining Performance Section /14/2018 9:52 PM.
Computer-System Architecture
Module 2: Computer-System Structures
Computer Organization
Module 2: Computer-System Structures
Chapter 5 Computer Organization
Module 2: Computer-System Structures
Module 2: Computer-System Structures
Chapter 2: Performance CS 447 Jason Bakos Fall 2001 CS 447.
Computer Organization and Design Chapter 4
CS2100 Computer Organisation
Presentation transcript:

Measuring Performance Early method – MIPS (millions of instructions per second) - measured by dividing the number of instructions executed in running a program by the time required to run the program. Less useful due to :- Different systems often require different number of instructions to implement a given program. MIPS does not provide number of instructions require to perform a given task.

IPC is the reciprocal of CPI . CPI/IPC Another method of measuring performance Cycles per instruction (CPI). Calculated by dividing the number of clock cycles required to execute the program by the number of instructions executed in running the program. For systems that can execute more than one instruction per clock cycle, the number of instructions executed per clock cycle (IPC) is often used. IPC is the reciprocal of CPI . The lower CPI the better the system performance.

Example A given program consists of a 100- instruction loop that is executed 42 times. If it takes 16,000 cycles to execute the program on a given system, what are the system’s CPI and IPC for the program?

Solution Total number of instructions executed = 100 x 42 = 4,200 It takes 16,000 cycle to execute the program. So CPI = 16,000 / 4200 = 3.81 IPC = 1/CPI or 4,200/16,000. =0.26

speedup=(Execution time before)/(Execution time after) IPC and CPI –also rarely used because both are lack of system’s clock rate information. SPEED UP - Used to describe how the performance of an architecture changes as different improvements are made to the architecture. speedup=(Execution time before)/(Execution time after) Example : if a program takes 25 seconds to run on one version of an architecture and 15 seconds to run on a new version, the overall speedup is 25 seconds / 15 seconds = 1.67.

Amdahl’s Law Amdahl’s Law: Make the common case (frequently used task) faster. Overall Speed up of a System = 1/ [( fraction unused) +( fraction used) / ( speed up) ] where fraction unused is the fraction of time for which the task is not in use, fraction used is the fraction of time for which the task is in use and speed up is the performance improvement for the task.

Example Suppose that a given architecture does not have hardware support for multiplication, so multiplication have to be done through repeated addition. If it takes 200 cycles to perform a multiplication in software, and 4 cycles in hardware, what is the overall speedup from hardware support for multiplication a) if a program spends 10 % of its time doing multiplications? b) if a program that spends 40 % of Its time doing multiplications.

Solution = 1/ [( 0.9) +( 0.1) / (50) ] = 1.11 In both cases, speedup when multiplication hardware is used = 200/4 = 50 (ratio of time to do a multiplication without the hardware to time with the hardware) a) Overall Speed up of a System = 1/ [( fraction unused) +( fraction used) / ( speed up) ] = 1/ [( 0.9) +( 0.1) / (50) ] = 1.11 Overall Speed up of a System = = 1/ [( 0.6) +( 0.4) / (50) ] = 1.64

TUTORIAL #2 5.3 Differentiate between DRAM and SRAM and give the application example for each. 5.5 Explain why one type of RAM is considered to be analog and the other digital. 5.6 List the applications of ROM 5.7 Differentiate among EPROM, EEPROM and Flash Memory. 6.2 Briefly explain how are data written onto a magnetic disk 6.3 Briefly explain how are data read from a magnetic disk 6.4 Explain the difference between CAV system and a multiple zoned recording system. 6.3 Consider a single-platter disk with the following parameters: Rotation speed = 7200 rpm; number of tracks on one side of platter=30,000; number of sectors per track=600; seek time=one ms for every hundred tacks traversed . Let the disk receive a request to access a random sector on a random track and assume the head starts at track 0. Determine the average seek time, average rotational latency, transfer time for a sector, the total average time to satisfy a request. 7.3 List the major functions of I/O Module. 7.4 List and briefly define three techniques for performing I/O 7.5 What is the difference between memory-mapped I/O and isolated I/O 7.6 Suppose a device interrupt occurs, how does the processor determine which device issued the interrupt? 7.7 When a DMA module takes control of a bus, and while it retains control of the bus, what does the processor do?

TUTORIAL #2 2.11 A common measure of performance for a processor is the rate at which instructions are executed , expressed in MIPS. Express the MIPS rate in terms of the clock rate and CPI. 2.12 SEE P/g 46 2.13 SEE P/g 46 8.1 Define an Operating System 8.2 List and briefly define the key services provided by the operating system 8.3 List and briefly define the major type of OS scheduling 8.4 Differentiate between a process and a program 8.5 What is the purpose of swapping 8.10 What is the purpose of a translation look aside buffer? 13.1 what are some typical characteristics of RISC organization? 13.2 Briefly explain the two basic approaches used to minimize register- memory operations on RISC machines. 14.1 What is the essential characteristic of the superscalar approach processor design? 14.2 Differentiate between the superscalar and superpipelined approaches. 17.1 What is the difference between a hardwired implementation and a microprogrammed implementation of a control unit? 17.6 what is the basic tasks performed by a microprogrammed control unit? 17.10 List some common applications of microprogramming.