|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/operating-system-concepts-3/
课程评论：没有评论
**操作系统概念-3：深入理解内存管理** 本课程是操作系统系列课程的第三部分，专注于深入剖析操作系统的内存管理机制，重点讲解了分页、虚拟内存、页面置换、颠簸（thrashing）以及工作集等关键概念，旨在帮助学员在各类考试和面试中掌握这些核心知识点。 **您将学到：** * **内存的“无限”幻象：** 操作系统如何为用户呈现比物理内存更大的内存空间？ * **执行超大进程：** 操作系统如何在内存（RAM）有限的情况下执行比RAM更大的进程？ * **地址的来源：** 内存地址是如何产生的？ * **多进程共存：** 操作系统如何将多个进程同时加载到RAM中执行？ * **内存空间管理：** 当RAM已满时，操作系统如何为新进程腾出空间？ * **颠簸现象：** 如何理解和应对内存中进程过多时可能出现的性能问题？ **课程详细内容涵盖：** * **内存管理基础：** 术语解释、地址来源、必要属性。 * **简单内存分配：** 探讨基本的内存分配方法。 * **碎片化问题：** 详细解释内部碎片和外部碎片。 * **分页机制：** * 分页的核心思想、工作原理。 * 地址转换（包括硬件如何实现）。 * 无除法地址翻译。 * 提高分页效率的方法，包括TLB缓存（工作原理、性能影响）。 * **进程启动与分页：** 进程启动时的内存初始化，以及含分页机制下的上下文切换。 * **内存共享：** 分页如何促进内存共享。 * **按需分页（Demand Paging）：** * 工作原理、何时加载页面。 * 实现方式、交换空间（swap space）。 * 按需分页的性能影响。 * TLB缓存与按需分页的协同。 * **页面置换算法：** * FIFO（先进先出）、MIN（最优）、Random（随机）。 * LRU（最近最少使用）算法。 * Belady's anomaly（Belady异常）。 * **颠簸与工作集：** * 颠簸（thrashing）的定义及限制方法。 * 工作集（working set）的概念。 本课程由Udemy提供30天退款保证，并提供助学金申请机会（详情请访问讲师网站）。
Ace operating systems (OS) memory management, paging, virtual memory, page replacement, thrashing, working set questions in competitive exams, job interviews, and OS course exams.Do you know: How the OS presents an illusion of infinite memory to users? How can the OS execute processes much bigger than the RAM (main memory)? Where do memory addresses come from? How does OS keep several processes inside the RAM for execution? How OS makes room for new processes when the RAM is full? What happens if there are too many processes in the RAM? Learn the explanations to these and many more intriguing questions in this course!Specifically, the course will cover the following in detail.Memory management terminologyWhere do memory addresses come from?What are the required memory management properties?What are some simple memory allocation schemes?What is fragmentation?What is internal fragmentation?What is external fragmentation?What is paging?What is the key idea behind paging?How paging works?How is address translation done with paging?How does paging hardware work?How is memory address translated by the paging hardware?How do memory management systems perform address translation without division?How to make paging efficient?What is TLB cache?How does TLB cache work?What are the performance implications of a TLB cache?How is the main memory initialized when a process is started?How context switches are performed in presence of paging?How does paging facilitate memory sharing?What is demand paging?How does demand paging work?When to load a page in demand paging?How is demand paging implemented?What is swap space?What are the performance implications of demand paging?How is TLB cache updated with demand paging?What are page replacement algorithms?What is FIFO page replacement?What is MIN page replacement?What is Random page replacement?What is LRU page replacement?What is Belady's anomaly?What is thrashing?How to limit thrashing?What is working set?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.
