All in one go
Welcome to the OS Simulator! Explore operating system essentials like deadlock handling, disk scheduling, memory management, process scheduling, file allocation, memory fitting and more.
Experience the core concepts of OS functionality in an engaging, user-friendly environment.
Page Replacement Algorithms
Since actual physical memory is much smaller than virtual memory, page faults happen. In case of a page fault, Operating System might have to replace one of the existing pages with the newly needed page. Different page replacement algorithms suggest different ways to decide which page to replace. The target for all algorithms is to reduce the number of page faults.
File Allocation
The allocation method defines how the files are stored in the disk blocks. The direct access nature of the disks gives us the flexibility to implement the files. In many cases, different files or many files are stored on the same disk.
Directory Structure
A directory is a container that is used to contain folders and files. It organizes files and folders in a hierarchical manner. There are several logical structures of a directory, these are given below. Single-level directory - The single-level directory is the simplest directory structure.
Memory Fit Algorithms
Memory Fit Algorithms are used to fill holes in main main memory efficiently.
MVT and MFT
MFT and MVT are different memory management techniques in operating systems. MFT or fixed partitioning scheme. 1. The OS is partitioned into fixed sized blocks at the time of installation. For example, there can be total 4 partitions and the size of each block can be 4KB
Process Scheduling
The process scheduling is the activity of the process manager that handles the removal of the running process from the CPU and the selection of another process on the basis of a particular strategy. Process scheduling is an essential part of a Multiprogramming operating systems.
Process Synchronization
Producer-Consumer Problem is also known as bounded buffer problem. The Producer-Consumer Problem is one of the classic problems of synchronization. There is a buffer of N slots and each slot is capable of storing one unit of data. There are two processes running, i.e. Producer and Consumer, which are currently operated in the buffer.
Disk Scheduling
Disk scheduling is a function of operating systems that schedules I/O requests arriving for the disk. Since only one I/O request can be served at a time by the disk controller, it is necessary to have algorithms in order to serve the I/O requests one by one. These algorithms need to ensure that the disk arm movement need to be minimal as hard drives being mechanical, are one of the slowest parts of the computer system.
Deadlock Algorithms
Deadlock Algorithms are algorithms that are used by the operating system to prevent and avoid deadlocks in the system
Paging
Paging is a function of memory management where a computer will store and retrieve data from a device's secondary storage to the primary storage. Memory management is a crucial aspect of any computing device, and paging specifically is important to the implementation of virtual memory.
Project by
This project is succesfully completed under the valuable guidance of Shashidhar Sir
S1 CSE, BATCH 2022-26
© Copyright Team 221CS111-221CS120 CSE NITK . All Rights Reserved
CS-254
CS-254
Mini
Mini
Project
Project