OS Swapping Processes

We have an intuitive understanding of process and process states from an earlier post now. If you want to know about process states and state transitions see link below. Process States in Operating System One of the states is the waiting state in which the process is waiting for some event or an I/O operation to … Read more

OS Process States

When a computer program runs but only a part of a program is running performing a specific task. This smallest unit of a program in execution is called a process. Technically, a process is not the smallest unit but some programs consist of threads which are smaller than a process. When there is no process … Read more

SJF Tabular Method

In the previous article, we computed the average waiting time and average turnaround time for processes that are scheduled with First Come, First Serve (FCFS) algorithm using Tabular Method. Introduction In this post, we will compute average waiting time and average turnaround time for scheduled processes with another algorithm called Shortest Job First (SJF). You … Read more

FCFS Tabular Method

The usual method of computing average time, average wait time, turnaround time and average turnaround time for processes is to make a Gantt Chart and then compute these times. In this article, we explore another way to compute the average turnaround time and average wait time for processes based on the same logic given by the … Read more

Page Table

Most OS allocate a page table for each process. A pointer to the page table is stored in the PCB of the process. When the dispatcher start a process, it must reload the user registers and define the correct hardware page table from the stored user page-table. Hardware Page Table The hardware page table can … Read more

Memory Mapping Schemes

Memory mapping is a technique to bind user-generated addresses to physical addresses in the memory. This requires static binding or dynamic binding. CPU gets instruction from memory, and then decode the instruction during the instruction-execution cycle. The instruction also contains the memory address of operands that need to be fetched. The CPU finished the instruction … Read more

Logical Directory Structures

The directory have a logical structure that defines how files are organized inside the directory. There are many organizing schemes such as single level, two level, tree structure, and acyclic-graph structure. In this article, you will learn about various logical directory structures and need for them. Single Level Directory It is the simplest directory structure … Read more

Storage Structure

Files are stored on random-access storage devices including hard disks, optical disks, and solid-state disks. The storage device can entirely be used as a file system or divided into many partitions. Each partition may or may not have a different file system. Storage devices are collected into RAID sets, that provides high availability and fault … Read more

File Access Methods

The information stored in a file must be accessed and read into memory. Though there are many ways to access a file, some system provides only one method, other systems provide many methods, out of which you must choose the right one for the application. Sequential Access Method In this method, the information in the … Read more

File Type

The operating system should support the file system. If the OS does not recognize a file type then any operation on the file will not be successful. The files are given an extension to indicate the type of file separated by a period or a dot. For example, finance.java – A java program source code … Read more

Ads Blocker Image Powered by Code Help Pro

Ads Blocker Detected!!!

We have detected that you are using extensions to block ads. Please support us by disabling these ads blocker.