Memory management keeps track of the status of each memory location, whether it is allocated or free. It allocates the memory dynamically to the programs at the
Virtual Memory is a storage allocation scheme in which secondary memory can be addressed as though it were part of main memory. The addresses a program may use
Prerequisite – Buddy System Two strategies for managing free memory that is assigned to kernel processes: 1. Buddy system – Buddy allocation system is an al
Unix file system is a logical method of organizing and storing large amounts of information in a way that makes it easy to manage. A file is a smallest unit in
A process is divided into Segments. The chunks that a program is divided into which are not necessarily all of the same sizes are called segments. Segmentation
Prerequisite – Page Replacement Algorithms In Operating System, process data is loaded in fixed sized chunks and each chunk is referred to as a page. The proc
There are three types of process scheduler. Long Term or job scheduler It brings the new process to the ‘Ready State’. It controls Degree of Multi-programmi
Prerequisite – Microkernel The kernel provides many services related to I/O. Several services such as scheduling, caching, spooling, device reservation, and e
Basically for a computer to start running to get an instance when it is powered up or rebooted it need to have an initial program to run. And this initial progr
In computing, a system call is the programmatic way in which a computer program requests a service from the kernel of the operating system it is executed on. A
Kernel is the core part of an operating system which manages system resources. It also acts like a bridge between application and hardware of the computer. It i
Critical Section: In simple terms a critical section is group of instructions/statements or region of code that need to be executed atomically (read this post f
Prerequisite: process-synchronization, Mutex vs Semaphore Semaphore is simply a variable. This variable is used to solve the critical section problem and to ach
Prerequisite – Critical Section, Process Synchronization, Inter Process Communication The Bakery algorithm is one of the simplest known solutions to the mutua
In a distributed system deadlock can neither be prevented nor avoided as the system is so vast that it is impossible to do so. Therefore, only deadlock detectio
What is a Thread? A thread is a path of execution within a process. A process can contain multiple threads. Why Multithreading? A thread is also known as lightw
Prerequisite – Partition Allocation Methods Static partition schemes suffer from the limitation of having the fixed number of active processes and the usage o
Paging is a memory management scheme that eliminates the need for contiguous allocation of physical memory. This scheme permits the physical address space of a
An operating system acts as an intermediary between the user of a computer and computer hardware. The purpose of an operating system is to provide an environmen
Prerequisite – Introduction of Operating System – Set 1 An Operating System acts as a communication bridge (interface) between the user and computer hardwar
The 8085 microprocessor is an example of Microcomputer System. A microprocessor system contains : two types of memory that are EPROM and R/WM, Input and Output
In this article, we will try to understand and compare different aspects of centralized, decentralized and distributed systems. 1. CENTRALIZED SYSTEMS: We start
Distribution basically leads to increased complexity in the system design and implementation. This is to achieve the potential advantages such as: Network Trans
A distributed database is basically a database that is not limited to one system, it is spread over different sites, i.e, on multiple computers or over a networ
Distributed databases basically provide us the advantages of distributed computing to the database management domain. Basically, we can define a Distributed dat
