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

What is a Long term Scheduler?

What is a scheduler?

A scheduler is a component of an operating system that determines the order in which processes are executed on the system's resources, such as the CPU, memory, and I/O devices. The scheduler's primary role is to manage and allocate system resources efficiently to ensure that the system is responsive, efficient, and runs smoothly.

There are different types of schedulers in an operating system, including the long-term scheduler, the short-term scheduler, and the medium-term scheduler. Each of these schedulers performs a specific function to ensure that the system runs efficiently and smoothly.

Long term scheduler

A long-term scheduler, also known as a job scheduler or admission scheduler, is a component of an operating system that selects which processes should be admitted into the system for execution from the pool of submitted processes.

The long-term scheduler is responsible for managing the overall system resources and decides which processes are allowed to enter the system based on the available resources, such as memory, CPU, and I/O devices. It determines which processes are important for the system and should be executed, and which ones can be deferred to a later time.

The long-term scheduler helps maintaining a balanced load on the system by controlling the number of processes admitted into the system at a given time. It aims to maximize system throughput and resource utilization while keeping the system responsive and avoiding resource exhaustion.

The long-term scheduler is typically invoked whenever a new process is submitted to the system or when a running process terminates. It evaluates the submitted processes, selects the ones that should be admitted into the system, and assigns them to the appropriate resources, such as memory, CPU, and I/O devices, for execution.

Function of a long term scheduler

The long-term scheduler performs the following functions:

  • It determines which processes should be admitted into the system based on the available resources, such as memory, CPU, and I/O devices.
  • It balances the load on the system by controlling the number of processes admitted into the system at a given time.
  • It maximizes system throughput and resource utilization while keeping the system responsive and avoiding resource exhaustion.
  • It assigns the admitted processes to the appropriate resources, such as memory, CPU, and I/O devices, for execution.
  • It keeps track of the status of the admitted processes and decides when they should be moved from a blocked state to a ready state for execution.
  • It determines when a process should be terminated, either because it has completed its task or because it is no longer needed.

In summary, the long-term scheduler is responsible for ensuring that the system runs efficiently by controlling the number of processes admitted into the system, optimizing resource utilization, and keeping track of the status of the admitted processes.

Why do we use Long term scheduler?

We use a long-term scheduler in an operating system for several reasons:

Resource Management: The long-term scheduler is responsible for managing the system resources by deciding which processes should be admitted into the system for execution. It ensures that the available resources are optimally utilized by selecting only those processes that the system can handle.

Load Balancing: The long-term scheduler helps balance the load on the system by controlling the number of processes admitted into the system at any given time. By keeping the number of processes in check, it ensures that the system runs smoothly and does not become overloaded.

System Throughput: The long-term scheduler maximizes the system throughput by selecting processes that can make the best use of the available resources. By prioritizing the processes that need to be executed first, it ensures that the system is working on the most important tasks.

Prioritization: The long-term scheduler helps prioritize processes by deciding which ones should be admitted into the system first. By selecting the most important processes, it ensures that critical tasks are completed in a timely manner.

Fairness: The long-term scheduler ensures fairness by giving each process an equal chance to be admitted into the system. It does not favour any particular process or user, which helps to ensure that the system is working for the benefit of everyone.

Limitation of long term scheduler

The long-term scheduler, like any component of an operating system, has certain limitations. Some of the limitations of the long-term scheduler include:

  • Limited Control: The long-term scheduler has limited control over the system resources, as it only determines which processes are admitted into the system for execution. It does not have control over the actual allocation of resources or the scheduling of processes on those resources.
  • Slow Response Time: The long-term scheduler has a slow response time because it decides which processes to admit into the system. It takes time to select processes based on resource availability, which can lead to slow system response times.
  • Inefficient Resource Utilization: The long-term scheduler can lead to inefficient resource utilization if it admits too many processes into the system. This can result in resource starvation, where some processes do not get enough resources to execute efficiently.
  • Limited Process Prioritization: The long-term scheduler has limited process prioritization capabilities, as it only determines which processes should be admitted into the system. It does not prioritize processes based on their importance or urgency, which can lead to delays in critical processes.
  • System Overhead: The long-term scheduler can create system overhead by constantly admitting and terminating processes. This can slow down the system and reduce its overall performance.