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

Look Disk Scheduling

Look Disk Scheduling

Look disk scheduling is another type of disk scheduling algorithm. Look scheduling is an enhanced version of SCAN disk scheduling. Look disk scheduling is the same as SCAN disk scheduling, but in this scheduling, instead of going till the last track, we go till the last request and then change the direction.

Advantages of Look Disk Scheduling

The advantages of look disk scheduling are:

  1. In Look disk scheduling, there is no starvation.
  2. Look disk scheduling offers low variance in waiting time and response time.
  3. Look disk scheduling offers better performance as compared to the SCAN disk scheduling.
  4. In look disk scheduling, there is no requirement of disk head to move till the end to the disk when we do not have any request to be serviced.

 Disadvantages of Look Disk Scheduling

The disadvantages of Look disk scheduling are:

  1. In look disk scheduling, there is more overhead to find the end request.
  2. Look disk scheduling is not used in case of more load.

Example of Look Disk Scheduling

Consider a disk contains 200 tracks (0-100). The request queue includes track number 82, 170, 43, 140, 24, 16, 190, respectively. The current position of the read/write head is 50. The direction is towards the larger value. Calculate the total number of cylinders moved by head using look disk scheduling.

Solution:

As mentioned in the following example, disk contains 200 tracks, so we take a track line between 0 to 199.

The current position of the read/write head is 50, So we start at 50, then we move the read/write head. (the disk head is moved towards the larger value as mentioned in the given example). When all the requests are addressed, then we calculate the total number of cylinders moved by the head.

Look Disk Scheduling

                                                               Figure: Look Disk Scheduling

 Total number of cylinders moved by the head = (190-50) + (190-16)

                                                                             = 314

C-Look Disk Scheduling

C-look means circular-look. It takes the advantages of both the disk scheduling C-SCAN, and Look disk scheduling. In C-look scheduling, the disk arm moves and service each request till the head reaches its highest request, and after that, the disk arm jumps to the lowest cylinder without servicing any request, and the disk arm moves further and service those requests which are remaining.

Advantages of C-Look Disk Scheduling

The advantages of C-look disk scheduling are:

  1. There is no starvation in C-look disk scheduling.
  2. The performance of the C-Look scheduling is better than Look disk scheduling.
  3. C-look disk scheduling offers low variance in waiting time and response time.

Disadvantages of C-Look Disk Scheduling

The disadvantages of C-Look disk scheduling are:

  1. In C-Look disk scheduling there may be more overhead to determine the end request.
  2. There is more overhead in calculations.

Example of C-Look Disk Scheduling

Consider a disk containing 200 tracks (0-100). The request queue contains the track number 93, 176, 42, 148, 27, 14,183 respectively. The current position of the R/W head is 55. The direction is towards the larger value. Calculate the total number of cylinders moved by head using look disk scheduling.

Solution:

As mentioned in the following example, disk contains 200 tracks, so we take a track line between 0 to 199.

The current position of the read/write head is 55, So we start at 55, then we move the read/write head (the disk head is moved towards the larger value as mentioned in the given example). When all the requests are addressed, then we calculate the total number of cylinders moved by the head.

Look Disk Scheduling

                                                                   Figure: C-Look Disk Scheduling  

Total number of cylinders moved by the head = (180-55) + (180-14) + (42-14)

                                                                    = 125 + 166 + 28

                                                                             = 319