|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/cpu-cache-and-the-memory-hierarchy/
课程评论：没有评论
课程名称：计算机组织：CPU缓存与存储层次 课程概述：本课程旨在帮助学员掌握缓存组织相关的知识，以便在竞争性考试、求职面试以及计算机组织和架构课程考试中取得成功。通过本课程，学员将深入理解现代计算机中缓存的实现和工作原理。课程首先介绍现代计算机的存储层次，解释为何计算机会使用多种不同类型的存储，如CPU寄存器、缓存、主存、硬盘等。之后课程的重点将转向缓存。缓存是一种小而快速的内存，位于快速的CPU与较慢的RAM（主存）之间。 课程分为九个部分：引言、时间局部性、缓存的性能影响、空间局部性、缓存中的写操作、内容可寻址内存、直接映射缓存、集合关联缓存、缓存驱逐和层次缓存。每个部分包含多个短小的讲座、实践问题、详细的动画示例以及测验。所有实践问题的详细解答将在视频中提供，并在习题列表的最后一页列出。测验问题的关键和解释也会悉数提供。 特别地，课程将详细回答以下问题： 1. 我们的计算机为何有这么多不同类型的存储？ 2. 什么是缓存？ 3. 为什么需要缓存？ 4. 应该在缓存中保留哪些数据？ 5. 什么是时间局部性和空间局部性？ 6. 缓存如何利用时间局部性？ 7. 缓存如何利用空间局部性？ 8. 什么是经典的LRU缓存替换策略？ 9. 什么是缓存块？为什么要使用它们？ 10. 什么是缓存的关联性？ 11. 什么是完全关联缓存？ 12. 什么是直接映射缓存？ 13. 什么是集合关联缓存？ 14. 如何判断特定内存地址在缓存中是命中还是未命中？ 15. 完全关联、直接映射及集合关联缓存的数据访问地址是如何拆分的？ 16. 如何修改缓存中的数据？ 17. 什么是直写缓存？ 18. 什么是回写缓存？ 19. 在回写缓存中，脏位（dirty bits）是如何使用的？ 20. 除了LRU，还有其他缓存驱逐算法吗？ 21. 现代计算机中缓存如何组织成层次？ 课程提供30天的退款保证。对于有兴趣参加课程但无法支付学费的学员，可以申请智慧奖学金，详情可访问我的网站了解申请流程。
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.
