Operating System Tutorial

Operating System Tutorial Types of Operating System Evolution of Operating System Functions of Operating System Operating System Properties Operating System Services Components of Operating System Needs of the Operating System

Operating Systems

Linux Operating System Unix Operating System Ubuntu Operating System Chrome Operating Systems Fedora Operating System MAC Operating System MS Windows Operating System Solaris Operating System Cooperative Operating System CorelDRAW Operating System CentOS FreeBSD Operating Systems Batch Operating System MS-DOS Operating System Commercial Mobile Operating Systems

Differences

Difference Between Multi-programming and Multitasking Difference between C-LOOK and C-SCAN Difference between Rotational Latency and Disk Assess Time Trap vs Interrupt Difference between C-SCAN and SSTF Difference between SCAN and FCFS Difference between Seek Time and Disk Access Time Difference between SSTF and LOOK Difference between Process and Program in the Operating System Difference between Protection and Security in Operating System

How To

How to implement Monitors using Semaphores How to Install a Different Operating System on a PC

Questions

What is Kernel and Types of Kernel What is DOS Operating System What is Thread and Types of Thread What is Process Scheduler and Process Queue What is Context Switching What is CPU Scheduling What is Producer-Consumer Problem What is Semaphore in Operating System Monitors in Operating System What is Deadlock What is Paging and Segmentation What is Demand Paging What is Virtual Memory What is a Long term Scheduler What is Page Replacement in Operating System What is BSR Mode What is Convoy Effect What is Job Sequencing in Operating System Why is it critical for the Scheduler to distinguish between I/O-bound and CPU-bound programs Why is there a Need for an Operating System

Misc

Process Management Process State Scheduling Algorithm FCFS (First-come-First-Serve) Scheduling SJF (Shortest Job First) Scheduling Round-Robin CPU Scheduling Priority Based Scheduling HRRN (Highest Response Ratio Next) Scheduling Process Synchronization Lock Variable Mechanism TSL Mechanism Turn Variable Mechanism Interested Variable Mechanism Deadlock Avoidance Strategies for Handling Deadlock Deadlock Prevention Deadlock Detection and Recovery Resource Allocation Graph Banker’s Algorithm in Operating System Fixed Partitioning and Dynamic Partitioning Partitioning Algorithms Disk Scheduling Algorithms FCFS and SSTF Disk Scheduling Algorithm SCAN and C-SCAN Disk Scheduling Algorithm Look and C-Look Disk Scheduling Algorithm File in Operating System File Access Methods in Operating System File Allocation Method Directory Structure in Operating System N-Step-SCAN Disk Scheduling Feedback Queue in Operating System Contiguous Memory Allocation in Operating System Real-time Operating System Starvation in Operating System Thrashing in Operating System 5 Goals of Operating System Advantages of Operating System Advantages of UNIX Operating System Bit Vector in Operating System Booting Process in Operating System Can a Computer Run Without the Operating System Dining Philosophers Problem in Operating System Free Space Management in Operating System Inter Process Communication in Operating System Swapping in Operating System Memory Management in Operating System Multiprogramming Operating System Multitasking Operating Systems Multi-user Operating Systems Non-Contiguous Memory Allocation in Operating System Page Table in Operating System Process Scheduling in Operating System Segmentation in Operating System Simple Structure in Operating System Single-User Operating System Two Phase Locking Protocol Advantages and Disadvantages of Operating System Arithmetic operations in binary number system Assemblers in the operating system Bakery Algorithm in Operating System Benefits of Ubuntu Operating System CPU Scheduling Criteria in Operating System Critical Section in Operating System Device Management in Operating System Linux Scheduler in Operating System Long Term Scheduler in Operating System Mutex in Operating System Operating System Failure Peterson's Solution in Operating System Privileged and Non-Privileged Instructions in Operating System Swapping in Operating System Types of Operating System Zombie and Orphan Process in Operating System 62-bit operating system Advantages and Disadvantages of Batch Operating System Boot Block and Bad Block in Operating System Contiguous and Non - Contiguous Memory Allocation in Operating System Control and Distribution Systems in Operations Management Control Program in Operating System Convergent Technologies in Operating System Convoy Effect in Operating System Copy Operating Systems to SSD Core Components of Operating System Core of UNIX Operating System Correct Value to return to the Operating System Corrupted Operating System Cos is Smart Card Operating System Cosmos Operating Systems Examples Generation of Operating System Hardware Solution in Operating System Process Control Block in Operating System Function of Kernel in Operating System Operating System Layers History of Debian Operating Systems Branches and Architecture of Debian Operating Systems Features and Packages of Debian Operating Systems Installation of Operating System on a New PC Organizational Structure and Development in Debian Operating Systems User Interface in Operating System Types Of Memory in OS Operating System in Nokia Multilevel Paging in OS Memory Mapping Techniques in OS Memory Layout of a Process in Operating System Hardware Protection in Operating System Functions of File Management in Operating System Core of Linux Operating System Cache Replacement Policy in Operating System Cache Line and Cache Size in Operating System What is Memory Mapping? Difference Between Network Operating System And Distributed Operating System What is the difference between a Hard link and a Soft Link? Principles of Preemptive Scheduling Process Scheduling Algorithms What is NOS? What is the Interrupt I/O Process? What is Time Sharing OS What is process termination? What is Time-Sharing Operating System What is Batch File File system manipulation What is Message-passing Technique in OS Logical Clock in Distributed System

Turn Variable or Strict Alternative Approach

Turn Variable or Strict Alternative Approach

Turn Variable Approach is used for process synchronization mechanism, which offers synchronization between two processes.

Turn variable is implemented on user mode, and it is a software mechanism. We can only use Turn variable or strict alteration approach on two processes, and it is a busy waiting solution.

We can understand the concept of Turn Variable with the help of the following example. Suppose we have two processes Pa and Pb, which share a variable named Turn Variable.

 The below section gives the pseudocode of the program for two processes are:

Strict Alternative Approach

Strict Alternative Approach

The problem which arises in the lock variable mechanism is that if the value of the lock variable is 1, then in this condition, the process enters into the critical section. At the same time, more than one process can see the value of lock variable 1. That's why mutual exclusion is not given in the lock variable mechanism.

We can solve this problem with the help of turn variable approach. The approach is that if the turn variable value is equivalent to the process PID then the process can enter into the critical section.

The value of the turn variable is either ‘a’ or ‘b’. If the turn variable value is not 'a', then the value of the turn variable will be ‘b’ and vice versa.

In the entry section, there is a condition that ‘Pa’Process cannot enter in the critical section till the value of the process is 'b', or we can say that until the value of the process ‘Pb’ is'a'. It cannot be entered into the critical section.

Now we have two processes, ‘Pa’ and ‘Pb’, and both the processes, which are ‘Pa’, and ‘Pb’ need to execute in the critical section.

Strict Alternative Approach

The process ‘Pa’ gets the opportunity to enter into the critical section because the value of the turn variable is equal to ‘a’.

Strict Alternative Approach

The value of Process ‘Pa’ will be 'a' till the process ‘Pa’ completes its execution in the critical section. When the process ‘Pa’ completes its execution in the critical section, then we assign the value ‘b’ to the turn variable.

Now the value of turn variable is 'b'. So, the process ‘Pb’ will enter into the critical section. The turn variable value will be ‘b’ till the process ‘Pb’ completes its execution in the critical section.

Strict Alternative Approach

Analysis of Turn Variable or Strict Alteration Approach

Now based, on four requirements, we analyze turn variable or strict alteration approach:

  1. Mutual Exclusion: - In every case, the Turn Variable approach offers Mutual exclusion. The turn variable or strict alteration approach is only applicable to two processes. In this, if the turn variable is equivalent to the Process ID, then the process enters into the critical section. Otherwise, no process will enter into the critical section.
  2. Progress: - In Progress, if a process ‘Pa’ doesn't want to enter in the critical section at its turn, there may be a chance that another process, which is ‘Pb’ gets blocked for a long time. That's why the approach of turn variable does not guarantee Progress.
  3. Portability: - Turn Variable or strict variable approach is implemented on the user mode, and it is a software mechanism. In turn variable, the operating system does not give any special instructions.
Strict Alternative Approach