HOT
blank

Computer Organization: CPU Cache and the Memory Hierarchy

IT & Software

Rating4.4
Enroll Now

Computer Organization: CPU Cache and the Memory Hierarchy, available at $74.99, has an average rating of 4.35, with 36 lectures, 9 quizzes, based on 72 reviews, and has 5162 subscribers.

You will learn about Why do our computers have so many different types of memories? What is a cache? Why is a cache needed? What data should be kept in a cache? What are temporal and spatial locality? How do caches exploit temporal locality? How do caches exploit spatial locality? What is the classic LRU cache replacement policy? What are cache blocks? Why use them? What is associativity in caches? What is a fully associative cache? What is a direct mapped cache? What is a set associative cache? How to determine whether a particular memory address will hit or miss in the cache? How the address breakdown works for accessing data stored in fully associative, direct mapped, and set-associative caches? How to modify data in caches? What is a write-through cache? What is a write-back cache? How dirty bits are used in a write-back cache? What other cache eviction algorithms, besides LRU, can be used? How are caches organized in a hierarchy in modern computers? This course is ideal for individuals who are Anyone interested in learning about caches in modern computers could benefit from this course. or Computer science undergraduate students taking a computer organization or computer architecture course could benefit from the course. or You may (optionally) wish to print some of the material It is particularly useful for Anyone interested in learning about caches in modern computers could benefit from this course. or Computer science undergraduate students taking a computer organization or computer architecture course could benefit from the course. or You may (optionally) wish to print some of the material.

Enroll now: Computer Organization: CPU Cache and the Memory Hierarchy

Summary

Title: Computer Organization: CPU Cache and the Memory Hierarchy

Price: $74.99

Average Rating: 4.35

Number of Lectures: 36

Number of Quizzes: 9

Number of Published Lectures: 36

Number of Published Quizzes: 9

Number of Curriculum Items: 45

Number of Published Curriculum Objects: 45

Original Price: $199.99

Quality Status: approved

Status: Live

What You Will Learn

  • Why do our computers have so many different types of memories?
  • What is a cache?
  • Why is a cache needed?
  • What data should be kept in a cache?
  • What are temporal and spatial locality?
  • How do caches exploit temporal locality?
  • How do caches exploit spatial locality?
  • What is the classic LRU cache replacement policy?
  • What are cache blocks? Why use them?
  • What is associativity in caches?
  • What is a fully associative cache?
  • What is a direct mapped cache?
  • What is a set associative cache?
  • How to determine whether a particular memory address will hit or miss in the cache?
  • How the address breakdown works for accessing data stored in fully associative, direct mapped, and set-associative caches?
  • How to modify data in caches?
  • What is a write-through cache?
  • What is a write-back cache?
  • How dirty bits are used in a write-back cache?
  • What other cache eviction algorithms, besides LRU, can be used?
  • How are caches organized in a hierarchy in modern computers?

Who Should Attend

  • Anyone interested in learning about caches in modern computers could benefit from this course.
  • Computer science undergraduate students taking a computer organization or computer architecture course could benefit from the course.
  • You may (optionally) wish to print some of the material

Target Audiences

  • Anyone interested in learning about caches in modern computers could benefit from this course.
  • Computer science undergraduate students taking a computer organization or computer architecture course could benefit from the course.
  • You may (optionally) wish to print some of the material

Ace cache organization questions in competitive exams, job interviews, and computer organization and architecture course exams. Genuinely understand the implementation and working of caches in modern computers.

In this course, we will begin with an introduction to the memory hierarchy in modern computers. We will see why the computers employ several different types of memories, such as CPU registers, caches, main memory, hard disk, etc. After the introduction, the rest of the course focuses on caches. We will see that cache is a small but extremely fast piece of memory that sits between the fast CPU and slower RAM (main memory). The course is divided into the following nine sections: Introduction, Temporal locality, Performance implications of caches, Spatial locality, Writes in caches, Content addressable memory, Direct mapped caches, Set associative caches, Cache eviction, and hierarchical caches. The sections have several bite-sized lectures, practice problems, detailed animation examples illustrating concepts, and quizzes. Detailed solutions to the practice problems are included in the video and on the last page of the worksheets. Keys and explanations for the quiz questions are also provided. Specifically, the course will answer the following questions in detail.

1. Why do our computers have so many different types of memories?

2. What is a cache?

3. Why is a cache needed?

4. What data should be kept in a cache?

5. What are temporal and spatial locality?

6. How do caches exploit temporal locality?

7. How do caches exploit spatial locality?

8. What is the classic LRU cache replacement policy?

9. What are cache blocks? Why use them?

10. What is associativity in caches?

11. What is a fully associative cache?

12. What is a direct mapped cache?

13. What is a set associative cache?

14. How to determine whether a particular memory address will hit or miss in the cache?

15. How the address breakdown works for accessing data stored in fully associative, direct mapped, and set-associative caches?

16. How to modify data in caches?

17. What is a write-through cache?

18. What is a write-back cache?

19. How dirty are bits used in a write-back cache?

20. Can other cache eviction algorithms besides LRU be used?

21. How are caches organized in a hierarchy in modern computers?

30 day money back guaranteed by Udemy.

Wisdom scholarships. If you are interested in taking one of our courses but cannot purchase it, you can apply for a scholarship to enroll. Learn more about the application process at my website.

Course Curriculum

Chapter 1: Introduction

Lecture 1: Welcome to the course!

Lecture 2: Memory hierarchy

Lecture 3: What is a cache?

Lecture 4: Cache-real world analogy

Lecture 5: How to populate a cache?

Chapter 2: Temporal locality

Lecture 1: Temporal locality

Lecture 2: Logical model of cache

Lecture 3: Cache introductory example

Chapter 3: Performance implications of caches

Lecture 1: Cache performance implications

Lecture 2: Activity: Practice problem 1

Lecture 3: How to improve memory access times

Chapter 4: Spatial locality

Lecture 1: Spatial locality

Lecture 2: Cache Blocks

Lecture 3: Cache blocks more info

Lecture 4: Activity: Cache blocks practice problem 2

Lecture 5: Animation example illustrating caches with blocks

Chapter 5: Writes in caches

Lecture 1: Writes in caches (write through)

Lecture 2: Write back caches

Lecture 3: Dirty bit

Lecture 4: Write allocation in caches

Lecture 5: Animation example illustrating write back cache

Chapter 6: Content addressable memory

Lecture 1: Cache as a content addressable memory

Lecture 2: Associativity in caches

Chapter 7: Direct mapped caches

Lecture 1: Direct mapped caches

Lecture 2: Address breakdown in direct mapped caches

Lecture 3: Activity: Address breakdown in DM caches practice problem 3

Lecture 4: Direct mapped cache implementation

Lecture 5: Animation example direct mapped cache

Lecture 6: Direct mapped cache advantages and disadvantages

Chapter 8: Set associative caches

Lecture 1: Set associative caches

Lecture 2: Animation example set associative cache

Lecture 3: Activity: Set associative cache address breakdown practice problem 4

Lecture 4: Set associative cache advantages and disadvantages

Lecture 5: Activity: Set associative cache example problem 5

Chapter 9: Cache eviction and hierarchical caches

Lecture 1: Cache eviction algorithms

Lecture 2: Cache hierarchy

Instructors

Rating Distribution

  • 1 stars: 0 votes
  • 2 stars: 0 votes
  • 3 stars: 3 votes
  • 4 stars: 22 votes
  • 5 stars: 47 votes

Frequently Asked Questions


How long do I have access to the course materials?


You can view and review the lecture materials indefinitely, like an on-demand channel.


Can I take my courses with me wherever I go?


Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!

You may also like

Top 10 Cybersecurity Fundamentals Courses to Learn in November 2024

Top 10 Smart Home Technology Courses to Learn in November 2024

Top 10 Agile Methodologies Courses to Learn in November 2024