COA | Memory Organization: Cache Memory 2 | Lec 27 | GATE CSE 2021 Exam
Вставка
- Опубліковано 12 жов 2024
- The Great Learning Festival is here!
Get an Unacademy Subscription of 7 Days for FREE!
Enroll Now - unacademy.com/...
.. In this live lecture, you will learn the Computer Organization & Architecture (COA) for GATE Computer Science Engineering. Vishvadeep Sir will explain Memory organization and what is Cache Memory in Computer Organization and Architecture. ➤ Use Referral Code: VDEEP10, To Get 10% Discount on Unacademy Subscription.
Subscribe Unacademy Computer Science Channel now: bit.ly/2PTRRxk
Follow your Favorite Educators on Unacademy:
1)Vishvadeep Sir: www.unacademy.c...
Join our Telegram Group here for all the useful Resources: t.me/Unacademy...
Welcome to Unacademy Computer Science Channel, your one-stop solution for all Computer Science Engineers. India’s top educators will be teaching you daily on this channel.
We will cover the entire syllabus, strategy, updates, and notifications which will help you to crack the GATE exams.
During the live session, our educators will be sharing a lot of tips and tricks to crack the exam. GATE aspirants who are preparing for their exam will be benefited from this channel. Unacademy platform has the best educators from all over the country, who take live classes every day.
Subscribe to our channel!
✤ Download the Unacademy Learning App here:
➤ Android: goo.gl/02OhYI
➤ iOS: goo.gl/efbytP
✤ For More Such Classes Get Subscription Advantage:
👉 GATE & ESE: bit.ly/2uoyyVQ
➤ Use Referral Code: VDEEP10
To Get 10% Discount on Unacademy Subscription
Unacademy Subscription Benefits: -
1. One Subscription, Unlimited Access
2. Learn from your favorite teacher
3. Real time interaction with teacher
4. You can ask doubts in live class
5. Limited students
6. Download the videos & watch offline
#MemoryOrganization #CacheMemory #ComputerScience #COA
Sir i have watch every video of yours from this playlist till now(not live).
But i can say, the level of understanding these videos made for me..No other teacher could ever do such great work explaining such a wide topic in the simplest manner. Kudos👍
The best videos for COA out there. Keep up the great work
MIND-BLOWING TEACHING SKILLS👍👍😎
GPK 1 : Tavg = 0.9x(10) + 0.1x(16x50 + 10) = 9 + 81 = 90ns
GPK 2 : Tavg = 0.9x(12) + 0.1x(12+120x16+12) = 10.8 + 194.4 = 205.2
"don't scroll down its correct ans"===**HAPPY LEARNING!!**===
Gpk2 me 12 quyn add kiye ho bhai
@@nishantshukla9493 extra Tcm to copy the block into cache memory
Refer Tavg formula when block transfer included
@@TrendWatchersTV12 i got it thank
Thanks dude!
I always used to first like and comment on your video then I watch the videos that level of confidence on you GURUDEV
Thank you for everything
Great lecture 😁
Start Time: 7:55
Ans of the GPK1 is 90 ns
Ans of the GPK2 is 205.2 ns
Ans of the GPK1 GATE - 2014 is 1.68 ns
hello are you preparing for 2024? can we contact on discord if you dont mind as i am also a 2024 aspirant
I have a doubt. In case of write back, why do the write back only when there is a cache miss? Suppose there is a hit, and that block is modified too, then also we should do write back for that block? So according to me the formula for effective time should be -
Tavg = H*(tcm) + (1-H)*(t_block) + x * t_block : SIMULTANEOUS ACCESS
Tavg = H*(tcm) + (1-H)*(tcm + t_block) + x * t_block : HIERARCHAL ACCESS
writing x * t_block at the last, without multiplying it with hit or miss ratio, means that we do the write back at the end, no matter when there is a hit or miss.
Why should write back be dependent on cache hit or cache miss?
It is an operation that we do every time at the end and it should only depend on the fraction of blocks which have been modified.
Therefore write back should have no relation with hit ratio. It should be only dependent on fraction of modified blocks.
[Taught in Lecture 27 @ 01:00:00]
No as when there is miss then only the address is replaced with any address from the main memory. And till the time when it has not been replaced the content is not write back to the memory
GPK 4): 90 nsec
5): 205.2 nsec
1):1.96 nsec
Very nice explanation I hv ever got thanku sir ..🙏🙏
amazing session!
SAVE YOUR TIME 8:10
GPK1= 91nsec
GPK2=205.2nsec
sir GPK 1 ka solution samjha dejeye??
great learning
Awesome
Why tcm is not included with twrite-back in write back for simultaneous access as it is used for copying the block to cache???
Hey
Did u got the answer why tcm not included in write back?
@@lazy7172 did you got the answer ??
GPK 1: 160*(0.9*1+0.1*5)+40(0.9*2+0.1*10)=336ns Ans
they've asked average per instruction, so we will divide by 336 by 200. 1.68 is the right answer.
@@xor_255 yupp
@@divyanshusingh6105 I have a doubt. In case of write back, why do the write back only when there is a cache miss? Suppose there is a hit, and that block is modified too, then also we should do write back for that block? So according to me the formula for effective time should be -
Tavg = H*(tcm) + (1-H)*(t_block) + x * t_block : SIMULTANEOUS ACCESS
Tavg = H*(tcm) + (1-H)*(tcm + t_block) + x * t_block : HIERARCHAL ACCESS
writing x * t_block at the last, without multiplying it with hit or miss ratio, means that we do the write back at the end, no matter when there is a hit or miss.
Why should write back be dependent on cache hit or cache miss?
It is an operation that we do every time at the end and it should only depend on the fraction of blocks which have been modified.
Therefore write back should have no relation with hit ratio. It should be only dependent on fraction of modified blocks.
[Taught in Lecture 27 @ 01:00:00]
@TECOC341 Pawan Nirpal don't overthink it dude. in gate whenever they ask average you have to divide it by something, else they would have framed it like "total time for sequence of instructions...". either way there will be options.
So in this question you are not consdering the cache write through concept?? as in memory write scenario, you are including seperate time for both, cache write and main memory. why so??
advantage and disadvantages of write back case
😊 = Very less time required
😔 = Coherence problem but data loss doesn't occur
sir,where to go for the ppts
Great teacher
Very very nice teaching sir ji
Day 15 of COA Prep :}
GPK - 1 : 90ns
GPK - 2 : 205.2ns
preparing for 24? can we contact as I am also a 2024 aspirant
@@growwithsomangshu1463 yes ofcourse welcome bro.
GPK1. Answer 90 ns ?
GPK2 Answer 246.8 ns ?
Can you please confirm the GPK2 answer as it will be t(avg) = 12 + 0.1*(16*120 + 12) = 205.2
and can u clear me one thing do we have to consider block size in bytes ?
cause can you check once the units....
t(block) = blocksize * t(main memory)
here time to access block size units?
Please do reply as I'm also facing in GPK problem
@@rajendrakujur2078 we will consider block size in bytes bcz it is given in bytes and by default memory is byte addressable..I think your answer is correct.
@@it_25preetigupta86 thanks 😊
How gpk 2 answer is becomes 246.8 something it should be 205.2 please Explain
Would you give me a gpk solutions
What the heck !! How can someone dislike this video
Is gpk2 answer 196.
In the hierarchical access why aren't u multiplying hit with cache memory access time... But in the extended version u are multiplying. Seriously you are confusing us
Go and Study the previous video, and then comment...
Please provide PDF..
the average m/m access formula do not seem make any reason to me. Seems like he has mugged it from somewhere and then he is just barfing off here!!!
The most confusing lecture of the entire lecture series. Specifically each and every formula written for EMAT in this video lecture, probably needs more explanation... Other than the formula given for "write through" all the rest of the formula seems weird to be me... I do not how other people did not say anything about it... A request to others, please do not mug things up without the reason/logic behind the same... And I request sir, to make a more elaborate video discussing the formula...
So bro, can u suggest some other resources to get better understanding of these formulas?
Which formulae u didn't get tht mch bro?..I prepare my notes from different sources..I found this lecture consistent with all. But although it was too direct and let us made some assumptions...
I can help or direct ...if u like
@@sachinsd4663 Can u plz suggest some good sources to prepare?
Each of the AMAT formula discussed in this lecture seems fuzzy to me. Probably the teacher himself does not know the stuff. Lol.
" If you can't explain it simply, you don't understand it well enough." -Albert Eistein.
I do not want to see how many Mtechs you have done, or how much rank you have received. It does not matter to me. All that matters is how you can explain complex topics that too without errors.
IT SEEMS THAT THIS LECTURE IS THE WORST IN THE ENTIRE PLAYLIST. SAB Tavg KA KAISE ILL LOGICAL JAISE LAG RAHA HAI. SIR, EK MORE ELABORATE VIDEO BANAIYE NA. SAB FORMULA K WORKING KO ELABORATE KARKE, STANDARD BOOKS K REFERENCE DE KAR.