Multi Level Queue Scheduling (MLQ)

Multi Level Queue Scheduling (MLQ)

· Multilevel queue scheduling classifies the processes according to their types for example, a multilevel queue scheduling algorithm makes a common.

· In this scheduling ready queue is divided into various queue that are called sub queues. A subqueue is a distinct operational queue

· The process are permanently assigned to subqueues, generally based on some property of the process such as memory size,priority or process type

· Each subqueue has its process sucheduling algorithm. For example interactive process at the foreground may use round robin scheduling while batch jobs at the background may use the FCFS method

· For example, consider a system with four different queues

1. System processes

2. Interactive processes

3. End-user processes

4. Interactive processes

· In this example, each queue has absolute priority absolute over low priority queues. No process in a batch queue could run unless the queue for system process and interactive processes were all empty.

· If an interactive process entered the ready queue while a batch process was running the batch process would be preempted. For example,solaries 2 operating system uses this form of algorithm

Example Problem :
Consider below table of four processes under Multilevel queue scheduling.Queue number denotes the queue of the process.

Priority of queue 1 is greater than queue 2. queue 1 uses Round Robin (Time Quantum = 2) and queue 2 uses FCFS.

Below is the gantt chart of the problem :

At starting both queues have process so process in queue 1 (P1, P2) runs first (because of higher priority) in the round robin fashion and completes after 7 units then process in queue 2 (P3) starts running (as there is no process in queue 1) but while it is running P4 comes in queue 1 and interrupts P3 and start running for 5 second and after its completion P3 takes the CPU and completes its execution.

Advantages:

The processes are permanently assigned to the queue, so it has advantage of low scheduling overhead.

Disadvantages:

Some processes may starve for CPU if some higher priority queues are never becoming empty.
It is inflexible in nature.

Comments

Micro kernel architecture

Micro kernel architecture What is Kernel? A kernel is an important part of an OS that manages system resources. It also acts as a bridge between the software and hardware of the computer. It is one of the first program which is loaded on start-up after the bootloader. The Kernel is also responsible for offering secure access to the machine's hardware for various programs. It also decides when and how long a certain application uses specific hardware. What is Microkernel? Microkernel is a software or code which contains the required minimum amount of functions, data, and features to implement an operating system. It provides a minimal number of mechanisms, which is good enough to run the most basic functions of an operating system. It allows other parts of the operating system to be implemented as it does not impose a lot of policies. Microkernels and their user environments are usually implemented in the C++ or C programming languages with a little bit of assembly. Ho...

Exokernel architecture

Exokernel architecture Most of us know what kernels are and how do they work to make programmers’ lives easier. But, how many of us know what exokernels are? I hope you will be able to get a brief introduction on this terminology through this blog. Let’s start with a brief introduction on kernel. What is a kernel? A kernel is the foundational layer of an operating system that functions at a basic level, communicating with hardware and managing resources, such as CPU and the memory. It works as an interface between the user application and the hardware. There are two main types of kernel 1. Micro kernel 2. Monolithic Kernel 1. Monolithic architecture 2. Layerd archtecture . 3. Virtual machine architecture 4. Exokernel architecture 5. Client server architecture 6. Micro kernel architecture Now let’s head into our main focus. What is an Exokern...

Shortest Job First Scheduling (SJF)

Shortest Job First Scheduling (SJF) · SJF ia also known as shortest-job-next(SJN) algorithm and is faster than FCFS. · In SJF, the process with the least estimated execution time is selected from the ready queue for execution. · For this, SJF algorithm associates with each process, the length of its next CPU burst. When the CPU is available, it is assigned to the process that has the smallest next CPU burst. · If tow processes have the same length of next CPU burst ,FCFS scheduling algorithm is used to break the tie. · SJF algorithm can be preemptive or non-preemptive. Non-preeptive SJF · In non-preemptive SJF, scheduling, CPU is always assigned to the ...

Monolithic Architecture

Monolithic Architecture Monolith means composed all in one piece. The Monolithic application describes a single-tiered software application in which different components combined into a single program from a single platform. Components can be: Authorization — responsible for authorizing a user Presentation — responsible for handling HTTP requests and responding with either HTML or JSON/XML (for web services APIs). Business logic — the application’s business logic. Database layer — data access objects responsible for accessing the database. Application integration — integration with other services (e.g. via messaging or REST API). Or integration with any other Data sources. Notification module — responsible for sending email notifications whenever needed. Example for Monolithic Approach Consider an example of Ecommerce application, that authorizes customer, takes an order, check products inventory, authorize payment and ships ordered products. This applicat...

Easytolearn

Search This Blog