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...

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...

Batch Processing Operating System

Batch processing system · Batch processing is one of the oldest method of running the programs · The computer in the past were very large in size and their I/O devices were very different from those that are used today. The job processing was not interactive as it is today. · The user did not interact directly with computer system. · The process scheduling , memory management, file management and I/Omanagement functions are quite simple in batch processing system 1. Process scheduling (i.e. allocation strategy for a processor is typically in order of their arrival i.e. first come first served(FCFS)basis. 2. Memory management is done by divi...

Time Sharing System and its Requirements

Time sharing system · Time sharing refers to the allocation of computer resources in a time dependent fashion to several program simultaneously · A time sharing system has many user terminals that are connected to same computer simultaneously. Using these terminal, different users can work on a system at the same time · Thus, it uses multi programming with a special CPU scheduling among all the last one, and then again beginning from the first one · In time sharing system, the CPU time is divided among all the users on schedule basis. · It release the CPU under any of the following three conditions: 1. When the allotted time slice expires. 2. ...

Multitasking System

Multitasking system · Technically , multitasking is same as multi programming · In a multitasking operating system, s single user can execute multiple programs at the same time · We can also say, multitasking is the system capability to work on more than one job or process at the same time. · It means that whenever a job needs to perform I/O operation, the cpu can be used for execting some other job diagram of multi tasking · There are two type of multitasking : 1. ...

Easytolearn

Search This Blog