Tag:Page table

  • [Homemade operating system] The 14th memory management system


    Table of contents 1. Prospect Review 2. Bitmap bitmap and function implementation Three, memory pool division 4. Operation 1. Prospect Review We have spent a round to improve our system before, including adding makefile, ASSERT and some common string manipulation functions. About makefile, I learned a little bit when I used to learn Linux system […]

  • Linux 0.11 source code reading notes – memory management


    memory management The Linux kernel uses segment page memory management. Memory pool Physical pages: physical free memory is divided into pages of fixed size (4K) Memory pool: all free physical pages form a memory pool, which is allocated and recycled in pages. The bitmap records whether each physical page is idle, and the bitmap subscript […]

  • [xv6 source code snooping (0)] page table


    preface The default reader has a basic understanding of the structure of the three-level page table; All of the following contents can be found in the xv6 book, experimental instructions and xv6 source code; When you find errors or improvements, please don’t be stingy with your keyboard. 1、 Preparatory work 1. Kernel memory layout On […]

  • [xv6 source code snooping (2)] lazy allocation strategy


    preface This article is about MIT 6 Implementation of s081-2020-lab5; If you find any problems in the content, please don’t be stingy with your keyboard. Lazy allocation && Lazytests and Usertests The two exercises are tightly coupled, so I’ll write one. The idea of lazy allocation was done beforePage table experimentFinally mentioned, so this experiment […]

  • Linux kernel source code analysis setup_ Arch (III)


    1. Preface stayLinux kernel source code analysis setup_ Arch (II)The memory allocation function memblock in the current startup phase is introduced in_ Alloc, the memory allocation function, will be introduced in this article_ Init is used for page table and memory allocation_ The general flow of init function is shown in the figure below. 2. […]

  • (storage management) 01 Paging storage management


    Divide the memory into several equal sized partitions, called blocks; Dividing the logical space into partitions consistent with the block size is called pages. When the job is running, the correspondence between page and block is realized through address relocation technology. In this way, storage blocks are managed in the form of pages, which is […]

  • Deep parsing segmentation and paging


    Segmentation and paging introduction What are fragments? Predecessor of segment model: base address plus boundary register (dynamic relocation) Segmented management Segmented thought Segmented address translation Another advantage of segment: good support for sharing Virtual address translation is too slow? Disadvantages of segment: too many external fragments Paging management Pagination thought Paging address translation Disadvantages of […]

  • Windows memory management – paging


    0x01 PAE paging mode is not enabled If the PG bit of CR0 register is 1, it means that after the paging mode is turned on, some addresses are virtual addresses, which can be accessed after being converted to physical addresses When PS = 0   When PS = 1           […]

  • Virtual Memory Essence


    Blog original Virtual Memory Essence introduction Virtual memory is one of the most important abstract concepts in today’s computer system. It is proposed to manage memory more effectively and reduce the probability of memory error. Virtual memory affects all aspects of computer, including hardware design, file system, shared objects and process / thread scheduling. Every […]

  • 15 minutes! A text helps Xiaobai understand the memory of the operating system


    preface Operating system is a difficult course to learn. At the same time, operating system knowledge is very important for developers. I believe that when you learn the operating system, there are too many abstract words and concepts that are difficult to understand, which directly dissuade us. Even if you learn the operating system with […]

  • 【ASPLOS’20】Elastic Cuckoo Page Tables


    ☕ Parallelized address translation [asplos’ 20] elastic cuckoo hash page table paper reading notes Elastic Cuckoo Page Tables: Rethinking Virtual Memory Translation for Parallelism https://dl.acm.org/doi/pdf/10… brief introduction basic thought The sequential pointer tracking of traditional multi-layer cardinal page table is transformed into fully parallel search, and the memory level parallel address translation is realized for […]

  • [operating system virtualization] memory paging


    introduce There is an inherent problem in segmented memory management: after the space is divided into different lengths, the space itself will be fragmented, and it will become more difficult to allocate memory over time. Therefore, it is worth considering another method: dividing the space into fixed length pieces. In virtual memory, we call this […]