[MIT 6.s081] Xv6 Lab 11: Mmap Record
Notes on xv6 Lab 11 mmap, covering virtual-memory-area tracking, lazy page faults, file-backed mappings, munmap, and process cleanup.
[MIT 6.s081] Xv6 Lab 10: File System Record
Notes on xv6 Lab 10 file systems, extending inode block addressing for large files and implementing symbolic links with correct system-call behavior.
[MIT 6.s081] Xv6 Lab 9: Locks Record
Notes on xv6 Lab 9 locks, reducing contention in the memory allocator and buffer cache through per-CPU free lists and hashed buffer buckets.
Solving Ordinary Differential Equations With the Runge-Kutta Method
Introduces the Runge–Kutta method for solving ordinary differential equations numerically, including formulas, errors, and experimental results.
[MIT 6.s081] Xv6 Lab 8: Networking Record
Notes on xv6 Lab 8 networking, explaining E1000 descriptor rings and registers and implementing packet transmission and reception in the driver.
[MIT 6.s081] Xv6 Lab 7: Multithreading Record
Notes on xv6 Lab 7 multithreading, implementing user-level thread switching and studying POSIX threads, synchronization, and barriers.
[MIT 6.s081] Xv6 Lab 6: Copy-on-Write Record
Notes on xv6 Lab 6 copy-on-write fork, covering shared mappings, page-fault copying, reference counts, uvmcopy, and copyout.
[MIT 6.s081] Xv6 Lab 5 (2020): Lazy Page Allocation Record
Notes on xv6 Lab 5 lazy page allocation, removing eager sbrk allocation, handling page faults, and passing lazy-allocation and user tests.
[MIT 6.s081] Xv6 Lab 4: Traps Record
Notes on xv6 Lab 4 traps, covering RISC-V assembly, stack backtraces, timer alarms, trap handling, and restoring interrupted execution.
CC (CodeChef) STARTERS 48 Solutions
Solutions to several CodeChef Starters 48 problems, explaining the key observations, algorithms, complexity, and C++ implementations.
CF1705 B, C, D1 Solutions
Solutions to Codeforces 1705 B, C, and D1, explaining greedy array operations, copied-string position mapping, and colored-tower construction.
CF1705 C, D Solutions
Solutions to Codeforces 1705 C and D, covering reverse mapping of copied-string queries and the feasibility and minimum cost of binary-string changes.
![[MIT 6.s081] Xv6 Lab 11: Mmap Record](/img/xv6/note/xv6%E4%B9%A6%E5%B0%81%E9%9D%A2.png)






