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

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

Service provided By An Operating System.

List of five service provided by an operating system. Explain how each provides convenience to users? The main purpose of operating system is to provide environment for the execution of programs. Thus an operating system provides certain services to program and the users of those programs. However , different operating system can provide different set of service. Some of the basis services provided by operating system are: 1. Program execution · Operating system provides a convenient environment where users can run their programs · The operating system performs memory allocation to programs, load them into appropriate location so that they can execute. The users need not to worry about all these tasks. 2. I/O Operation · ...

Message Delivery Protocol

Message Delivery Protocol · A protocol is a set of rules and conventions shared by communicating entities . · Message passing can be blocking or non blocking . · In blocking protocol , a sender process is blocked till the message selivered to the . in this case , sender process has guarantee that the message sent by it ie delivered before it continues its execution . A blocking protocol normally includes: 1. Blocking send : the sender process is blocked until the message is received by the receiving process or by the mailbox. 2. Blocking receive : the receiver nlocks until a message is available thus when both sender as well as receiver is blocked ,it is known as rebdevezevous . this combination allows for tight sysnchronization between process. ·...

Thread

Thread What is Thread? A thread is a flow of execution through the process code, with its own program counter that keeps track of which instruction to execute next, system registers which hold its current working variables, and a stack which contains the execution history. A thread shares with its peer threads few information like code segment, data segment and open files. When one thread alters a code segment memory item, all other threads see that. A thread is also called a lightweight process . Threads provide a way to improve application performance through parallelism. Threads represent a software approach to improving performance of operating system by reducing the overhead thread is equivalent to a classical process. Each thread belongs to exactly one process and no thread can exist outside a process. Each thread represents a separate flow of control. Threads have been successfully used in implementing network servers and web server. They also provide a suitable foundation ...

Easytolearn E-book 2

Description:here we give you pdf. about classification of operating system in which we provide all information of classification in detail.

Easytolearn

Search This Blog