Scribd
Upload
7 views3 pages

Operating Systems Notes

The document provides an overview of operating systems, detailing types such as batch, multiprogramming, multitasking, time-sharing, and real-time systems. It discusses key concepts like threads, processes, scheduling, critical sections, deadlocks, and memory management techniques. Additionally, it covers memory allocation schemes and page replacement algorithms, including FIFO and Belady's anomaly.

Uploaded by

siddhakdak9
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views3 pages

Operating Systems Notes

The document provides an overview of operating systems, detailing types such as batch, multiprogramming, multitasking, time-sharing, and real-time systems. It discusses key concepts like threads, processes, scheduling, critical sections, deadlocks, and memory management techniques. Additionally, it covers memory allocation schemes and page replacement algorithms, including FIFO and Belady's anomaly.

Uploaded by

siddhakdak9
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Operating Systems Notes

Introduction to Operating Systems

Operating Systems: It is the interface between the user and the computer hardware.

Types of Operating System (OS):

1. Batch OS - A set of similar jobs are stored in the main memory for execution...

2. Multiprogramming OS - The main memory consists of jobs waiting for CPU time...

3. Multitasking OS - Multitasking OS combines the benefits of Multiprogramming OS...

4. Time Sharing OS - Time-sharing systems require interaction with the user...

5. Real Time OS - Real-Time OS are usually built for dedicated systems...

Threads

A thread is a lightweight process and forms the basic unit of CPU utilization...

User Threads vs Kernel Threads:

1. User threads are implemented by users. Kernel threads are implemented by OS...

2. If one user-level thread performs blocking operation, the entire process is blocked...

Example: Java thread, POSIX threads.

Process and Scheduling

A process is a program under execution...

Process Scheduling: Below are different times with respect to a process:

- Arrival Time: Time at which the process arrives in the ready queue.
Operating Systems Notes

- Completion Time: Time at which process completes its execution...

Objectives of Process Scheduling Algorithm:

- Max CPU utilization

- Min turnaround time

- Fair allocation of CPU.

Critical Section Problem

Critical Section - The portion of the code in the program where shared variables are accessed...

A solution for the critical section problem must satisfy:

- Mutual Exclusion

- Progress

- Bounded Waiting

Deadlock

Deadlock: A situation where a set of processes are blocked because each process is holding a resource...

Methods for handling deadlock:

1. Deadlock prevention or avoidance.

2. Deadlock detection and recovery.

3. Ignore the problem altogether.

Memory Management
Operating Systems Notes

Memory Management techniques allow the memory to be shared among multiple processes...

Memory Allocation Schemes:

- Fixed Partition

- Variable Partition

Paging: The physical memory is divided into equal-sized frames...

Page Replacement Algorithms

First In First Out (FIFO) - This is the simplest page replacement algorithm...

Belady's anomaly: Belady's anomaly proves that it is possible to have more page faults...

You might also like