C structs It’s simply explain basic of structs in C, how it behave etc. Important to know to solve this week’s assigment
What is virtual memory? – Gary explains Nice visualization for Virtual Memory in general. This video introduce you with virtual adress, lookup table, and physical memory with all the function.
The fork() function in C It basically explain what is fork function does, how it turns, what it will do, and what it will return. Turns out, fork function is very important function for concurrent processing.
Process IDs in C The sequel of the last multiprocessing video, we are introduced to getpid() and getppid(), which return, respectively, the process ID of the child and the process ID of the parent. This video also demonstrates some cases using fork and those 2 function.
Waiting for processes to finish (using the wait function) in C Next up, we meet this special function that called wait. As the name describe, it will yield until the other process done return. This video also demonstrates some cases using wait function.
Process Synchronization This demonstration video will first introduce you with how cooperating processes work. But this processes have some problem, so it has the solution for it which explained in next video.
The Critical-Section Problem Explain one of the problem that appears when some processes try to changing something with the same variable/file/something else. So the the solution for this is to implement critical section where no two processes are executing in their critcal sections at the same time.
6. Chapter 5: Compiling a Cross Toolchain - How to build Linux From Scratch (LFS) 12.2 - Tutorial This video provides a clear, step-by-step guide on building the toolchain necessary for creating a Linux From Scratch (LFS) system. It focuses on configuring and compiling essential tools like GCC and Binutils, which are foundational for compiling a Linux environment from scratch. The tutorial is especially helpful for users looking to understand the intricacies of cross-compilation and dependencies in Linux system development.
Operating System #21 Scheduling in Linux: O(n), O(1) Scheduler This video breaks down the evolution of Linux scheduling algorithms, focusing on O(n) and O(1) schedulers. It clarifies the efficiency differences between these approaches, particularly how the O(1) scheduler optimizes task selection speed, which is crucial for enhancing system performance. This is valuable for anyone looking to grasp how Linux handles multitasking efficiently.