500E-12 * 60,000 = 30,000,000E-12 = 30E-6 and cycle count cannot have units of time. We can't have 30ps instructions, only a number of instructions. In this case, we have a total of 30,000 instructions, but some instructions take 1 cycle, some 7. It wouldn't make sense to say, "I have 45 s instructions." Only, "I have 45 instructions, which take X ms to run."
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?
There are only two processors in the problem - A & B There are two programs. The last question asks to compare between A & B using Program 2 as the benchmark.
In oscillations, period is always the reciprocal of the frequency. (T = 1/f) Processor A is running at 2.0 GHz (2,000,000,000 Hz). One divided by that number is 500 x 10^-12 sec.
This is from given information in the problem statement -- third sentence of the first paragraph. Floating point instructions are more complicated so they take more time (and thus more cycles).
That's Hennessey & Patterson's whole point with the chapter. Performance isn't measured in Hertz. It is measured in time. Time is calculated by the product of cycle time, CPI, and # instruction per program.
@@michaelroditis1952Yes! The program matters a lot. Different programs will give different relative performances. This is a big issue with benchmarking... choosing a representative mix of instructions. The average CPI of a processor is dependent on the mix of instructions (and the underlying CPIs of each instruction class)
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.
Hi Kevin. These examples are taken from Computer Organization and Design by Patterson and Hennessy, the canonical textbook on computer architecture. I work through example problems representative of the textbook material to help my and other students in their computer architecture courses. The authors have a more advanced text (Computer Architecture: A Quantitative Approach) that is used in advanced computer architecture courses and does address some of the issues you criticize my video for not having. Their undergraduate textbook is not perfect, but it is meant as an introduction and is the text almost universally adopted.
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
a video 5 years ago saved my 4th year ass in 2022. thank you so much :)
I loved the way you explained this. So clear and in a way that's understandable, thank you.
Thanks, man. Much appreciated.
Thank you.You saved my college career. ❤️🍀
Wonderful study material. Thank you
Thank you for making this video--it really helped me understand this!
Same!
Great video!
thank you very much for the comprehensible explanation
Thank you, this helped a lot!
Thank you, this really helped me understand!
Thank you so much, it was awesome
You are the best ty !!!
thanks very much , sir! you helped me out
I Really understand it , thanks a lot
Thank you so much! :)
3k views and no dislike..... The world is better now.
thanks sooooo much!
Thank you so much sir.
thank you for simplifying this problem
Glad it was useful. Please let me know if there is any other content you need help with.
Thank you very much
Thanks jeff
thank you :)
Thank you
thanks alot
Thank you sir
thanks bruh
thanks
pico(p) is 10^-12 and micro(u) is 10^-6 Hence the execution time is 500us and the Cycle count is rather 30ps
500E-12 * 60,000 = 30,000,000E-12 = 30E-6
and cycle count cannot have units of time. We can't have 30ps instructions, only a number of instructions. In this case, we have a total of 30,000 instructions, but some instructions take 1 cycle, some 7. It wouldn't make sense to say, "I have 45 s instructions." Only, "I have 45 instructions, which take X ms to run."
tnx man
i like to be a good boy that does all the chores in a house in 60 minutes long
how is this related to the video lmao
sir can you give Some more advanced example
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?
There are only two processors in the problem - A & B
There are two programs.
The last question asks to compare between A & B using Program 2 as the benchmark.
Oh! on that note you are right. Thank you for the response.
How did you get the 500 picoseconds is problem A?
In oscillations, period is always the reciprocal of the frequency. (T = 1/f) Processor A is running at 2.0 GHz (2,000,000,000 Hz). One divided by that number is 500 x 10^-12 sec.
Why didn't you multiply integer instructions by 7 cycles, but you did for floating point?
This is from given information in the problem statement -- third sentence of the first paragraph. Floating point instructions are more complicated so they take more time (and thus more cycles).
where did u get the 2 times 10 of the 9 power?
giga = 10^9
Isn't prossesor b faster than a by 2/1.8 (clock rates)
That's Hennessey & Patterson's whole point with the chapter. Performance isn't measured in Hertz. It is measured in time. Time is calculated by the product of cycle time, CPI, and # instruction per program.
First of all I really appreciate how fast you replied. OK but from program to program won't the ratio of the time be different for the two prossesors?
@@michaelroditis1952Yes! The program matters a lot. Different programs will give different relative performances. This is a big issue with benchmarking... choosing a representative mix of instructions. The average CPI of a processor is dependent on the mix of instructions (and the underlying CPIs of each instruction class)
you're too fast :(
202011010243 cycle time how to integration this number
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.
Hi Kevin. These examples are taken from Computer Organization and Design by Patterson and Hennessy, the canonical textbook on computer architecture. I work through example problems representative of the textbook material to help my and other students in their computer architecture courses. The authors have a more advanced text (Computer Architecture: A Quantitative Approach) that is used in advanced computer architecture courses and does address some of the issues you criticize my video for not having. Their undergraduate textbook is not perfect, but it is meant as an introduction and is the text almost universally adopted.
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
LOL why in the fuck would you post your homework on youtube