Computer Architecture Performance Example

Показать описание

Jeff Will

Рекомендации по теме

Комментарии

a video 5 years ago saved my 4th year ass in 2022. thank you so much :)

ninakimberlyn

I loved the way you explained this. So clear and in a way that's understandable, thank you.

shpoopdy

Thank you.You saved my college career. ❤️🍀

SumaiaAlIssa

Thank you for making this video--it really helped me understand this!

LibbyAudrey

3k views and no The world is better now.

KULDEEPSINGH-rhgo

thank you very much for the comprehensible explanation

apiahpetertoch

Thank you, this really helped me understand!

auspicium.

thank you for simplifying this problem

isaactenesi

i like to be a good boy that does all the chores in a house in 60 minutes long

alexopa

pico(p) is 10^-12 and micro(u) is 10^-6 Hence the execution time is 500us and the Cycle count is rather 30ps

ballingCheckout

thanks very much, sir! you helped me out

tommytien

Why didn't you multiply integer instructions by 7 cycles, but you did for floating point?

halilmertdeveli

Isn't it for the last question, we have to compare between 3 processors? Processor A with program 1, Processor A with program 2 and Processor B. So in that case Processor A with program 1 will be the fastest?

lhakpadhondup

How did you get the 500 picoseconds is problem A?

ramoncitovillasanta

sir can you give Some more advanced example

LAGsubham

where did u get the 2 times 10 of the 9 power?

winkwhiskey

Isn't prossesor b faster than a by 2/1.8 (clock rates)

michaelroditis

202011010243 cycle time how to integration this number

blue_pink_Tv

can you help with this exercise
1) Please describe what will be done and what result will be in R1 after each instruction

R1=10, R2=5, R3=5, M[5] = 23, M[10] =122

Addressing mode

instruction

What to do

R1 content

Immediate

add R1, #5

Direct

add R1, (5)

Register direct

add R1, R2

Register indirect

add R1, (R2)

Indexed

add R1, (R2+R3)

Base

add R1, 5(R2)

2) Write program witch calculates:

For i=1 to 3

Z=((A[i]*B[i])+C[i])/D[i]

where A, B, C, D and Z are memory locations an operand size is 1 byte.

a) Using three address instructions and any addressing mode

b) Using two address instructions and any addressing mode

andihoxha

Wow, you are running these programs on a computer with no operating system and no interrupts. On a real computer with a multitasking O/S it is not possible to deterministically calculate a program's run time. Modern processors are superscalar so good luck in trying to determine instruction execution time. This is just an exercise in a vacuum.

KevinInPhoenix

Computer Architecture Performance Example

Computer Architecture Performance Example

1 1 5 CPU Performance Equation

Performance Measures on CPU

Computer Architecture Performance Example 2

CPU Performance Parameters in COA: Average CPI, MIPS, and Execution Time | COA

Tutorial 2 (Part 1: CPU time calculation Demonstration)

Computer Architecture - What is CPI? (Performance Measurement)

[COMPUTER ORGANIZATION AND ARCHITECTURE] 2 - Performance Issues

Complete Training: TensorFlow and PyTorch 2024

Computer Organization and Design-4: Performance Evaluation and CPU Time

5-Stage Pipeline Processor Execution Example

Amdahl's Law - Georgia Tech - HPCA: Part 1

Pipeline Performance

Computer System Architecture - System Attributes to Performance Part1

1 3 1 Pipelining Principles

Computer System Architecture - System Attributes to Performance Part2

computer architecture CPU instructions and addresses explained

The Fetch-Execute Cycle: What's Your Computer Actually Doing?

Video 3: Performance metrics, CS/ECE 3810 Computer Organization

Computer Architecture: Pipeline and Non pipeline Comparision Problem

L-4.2: Pipelining Introduction and structure | Computer Organisation

Amdahl's Law in COA: Basics, Proof, and CPU Performance Explained

Amdahl's law and speedup in concurrent and parallel processing explained with example

Speed up example problem and formula in computer architecture Amdahl's law