COA | Cache | Introduction to Cache Memory | Ravindrababu Ravula | Free GATE CS Classes
ฝัง
- เผยแพร่เมื่อ 17 ต.ค. 2024
- For Course Registration Visit: ravindrababura...
. For Any Queries, You can contact RBR on LinkedIn: / ravindrababu-ravula
Telegram: t.me/ravindrab...
Instagram: / ravindrababu_ravula_rbr
If you're considering studying abroad, don't forget to explore 'Games of Visas,' my dedicated consultancy service and TH-cam channel designed to streamline the process of studying abroad.
For Study Abroad, contact "Game of Visas" at 9494555454
Awesome explanation! I've always had some trouble understanding Computer Organization related courses, and you made it all so easy! Sadly, most teachers don't explain things so perfectly.
I'm a Pakistani and I personally think Indians are really good at explaining technical stuff. I've been learning coding from other Indian TH-camrs too! A big thank you to all of you people!
+Mishaal Ijaz can you tell me the channel names you learn from...?
your lectures helped me to score atleast 6-8 marks in engineering services exam, electronics engineering..Thank You.
exam at 10:00 am and starting the syllabus at 1:00 am with this lecture sugggested by my freinds
4 hours before my exams...here we go!!xD
2 hours before mine XD
exam going on XD
i am still in the room and giving exam 😂🤣
😂 lmao
Same
I am crushed, my database course was so boring i regret if i had you then. Excellent presentation
I can't thank you enough man. You have helped me with my OS and Architecture class.
Sir big thanks and salute to u...i have never seen this type of explanation on these topics...now i am big fan of urs...
I admire you for such a good educational video. I also love your accent. I think indian accent is the accent of hardworking people of the world that are peaceful and free-minded.
Consider the machine of Figure 3.4 in top level view of computer architecture chapter also has the following instruction: 1010= xor to AC from device 1110 = Jump if sign=0 1111 = halt Where the sign bit is the most significant bit of an integer. Halt is the end of the program
For the following program, the program start at address 400:
1. Load AC from memory 110
- 2. Xor to Ac from device 200
- 3. Jump if sign=0 to 410
- 4. Store Ac to memory 111
- 5. halt
the program in address 410: -1. store Ac to memory 112 , - 2. halt
please
Help me solve the exercise
Good one but temporal locality i got confused...actually temporal locality is If at one point a particular memory location is referenced, then it is likely that the same location will be referenced again in the near future.
I can't find paging among the OS videos :(
I wish I could register for full course.
Still, Thank you for sharing your knowledge Sir :D
5:24 "Time taken to find out if the required element is present in the cache or not is hit latency", isn't hit latency the time taken to fetch data from the cache in case of a cache hit?
Thank you for your videos. You helped me so much with my OS and Architectural Concepts class.
At 11:00 "Temporal Locality says Least recently used element is going to be used again.Most Frequently Used item is Least Recently Used". This is confusing !
Most Frequently Used is actually opposite to Least Recently Used. Temporal locality says that Recently used item will be referred again. ie. Least Recently Used item will NOT be referred !
NO dear, He said "The Most Frequently used Algorithm, is LRU". it means out of FIFO, Optimal,and LRU. LRU is preferred more.
your explanation is awesome , now i got the clear concept behind this, thank you for making such awesome video lectures😊😊😊
This is an awesome description! Great job! Keep making videos man!
Sir I can't find paging concept... please provide link sir
You are amazing!!! The concept was so beautifully explained😍thank you so much
CPU registers do not store instructions. Registers only store operands values, addresses and results of ALU operations. So correct yourself
ur teaching style is very coooll
Thank you sir for Clear explanation about it...
i liked without even watching the video!!
because i know he is amazing
can anyone link me to the video about paging..
Sir pls tell which is better Hamacher or Stallings for coa?
The explanation of temporal locality was incorrect. 12:20 He said that "Least" frequently used has high chances of getting used again.
Temporal Locality: (from wiki: en.wikipedia.org/wiki/Locality_of_reference )
If at one point a particular memory location is referenced, then it is likely that the same location will be referenced again in the near future. There is a temporal proximity between the adjacent references to the same memory location.
Please, add subtitles! Lecture was great, but it's really hard to understand your accent!
PS I wish I had so hot teachers at my uni :D
Increase the speed to 1.25 or 1.5 for convenience.
Hi , Nice lecture ..where is the second part of cache lecture where it explains..how it decides that which part of main memory cache takes ? how it works ?
Were all the gate lectures available over youtube.?
Sir your lecture was really great!
Awesome explanation! Can you please make videos on High Performance Computing (HPC) ?
Great Job sir
Please sir make complete tutorial series for computer architecture and organization
Can u upload a video explaining algorithms for addition. And substraction in computer organisation and design 'with example'
Great sir...im totally depend on u for gate exam
I would go half an hour early to his lecture if i had him during my engineering :D
Awesome explanation sir....kindly put more vedios
Your explanations are very much helpful for understanding concepts clearly and studying them in gate point of view
so please plan ut more vedios sir...its my humble request
His accent is too thick for me to understand, is there anyway they could add subtitles?
I made the speed 0,75 because I feel he is speaking Hindi not English but thank you very very very much for him
Sr please upload the course for COA ESE syllabus for electronics people
thanks for nice explain. please upload a video on various addressing schemes used....
Can I have a link to the discussion about paging?
can u share the virtual memory (paging,segmentation concepts in depth)?
Very nice sir.
Please upload all the videos.
Sir paging video in operating system not found.
sir i am preparing for the ugc net. Sir please unhide the hidden videos too. i like your teaching methodology. i have studied from your compiler designing playlist and found it amazing
best teaching i have ever seen!!!
Very Good Lecture. Thanks a lot.
Your tutorial are good and really have contents (very rear in our country if not none). Could you include some example in C (may be in x86). Too much of theory is boring !!
sir can you please post videos on pipelining
Ur teaching is supper sir ur style also
Easy TO UNDERSTAND.....any videos on instruction pipelining?
can u name the book which you refer?
Nice explanation! Sir
How can I get all the videos of coa.
plz. Sir,Can you give me definition of Cache memory?In order to proper Understanding...
Imagine cache as a fridge in ur kitchen an you are the chef(CPU). When you cook you need to take the food from the fridge and cook it in the kitchen, this helps you to cook faster than going to the supermarket for example to buy every time you cook. Cache helps to provide data faster to cpu than main memory ( cache cpi
sir plzz upload all the videos of computer organization and architecture
Is this playlist is completed and is it relevant for gate 2025
thanks for the great video , what is "demand pagging "? thanks anyway
sir how i can watch your private videos??
nice explanation!!
I am little confused about mapping and paging technique.
pls tell me sir.
sir, i am a non cse/it student, can i apply for lateral entery at iiit hyderabad for cse....????/
Your videos are very good.. thanks for the uploads.. :D
great explanation
rly vry useful for students....thanks a lot sir....
Plz make a video about locality of reference
nice explain and best
teaching method
Sir give me full course on computer organization
You made a mistake. You said that the CPU is faster than memory (which is correct). But you gave an example assuming CPU has a speed of 10^-12 and to read from memory it will take 10^-9 seconds. But 10^-12 < 10^-9.
You got a conceptual mistake. Whatever said is correct since the speed of memory is slower as compared to CPU. So at the time of fetching data from the memory CPU will be under waiting state and will become active after 10^-9 sec. So eventually CPU fetches data at the rate of 10^-9 sec.
@aprender faster means less time.
Good explanation. I will follow other videos too!!
very easy to understand sir thank you
For people asking for subs:
The auto generated subs "hit rate" is around 92%-94%.
Enjoy your day.
sir it's really useful. nice explanation🤗
please upload video on memory reference while addessing mode
Is this a ARM cache
sir can u update memory organization concepts
Mr Aditya this is new generation science I am not conversant with it pl
sir please do videos on 8086 microprocessor
Super explanation sir
Thanks sir
thank you soo much Buddy too much help full
Topics on DMA controller please....
I need one guessing correct options trick video too sir.. :p
awesome tutorial,, thanks
excellant
Great lecture!
Great work
Thank you Sir. Nice information.
how cpu crates logical address ??
awesome knowledge thanks
Nice explanation..
hi
thanks for this.its really helpful.
I have a question about cache if anyone can help,thanks in advance.
the problem in keeping cache in MULTIPROCESSOR SYSTEM COHERENT is significantly more complex than
UNI PROCESSOR SYSTEM why?
Super explication bro
great video keep uploading
The algorithm LRU is least recently used.
Asalam o Aliqum Sir very nice lecture
Pls sir explain the topic interleaved memory
sunil shetty picked up a new profession
Super sir
Amazing sir :)
can have intefacing circuits lecture
Very nic tq sir
Please re-do with a clearer Mic, hard to hear especially with an accent.