p e u _ b c l o i d c e _ b f o o r l _ e m a u n l t h i a l s e R v u e n l n _ a q b u l e e u P e r _ o p c r e o s g s r ( a ) m _ { i n _ / J / a v T a O # D i O x z A z u 1 t Y o U J I g c P e Y 6 n a P e k n r q 7

Multi Level CPU Scheduling Shubham Bajpai Department of Computer Science, University for Kanpur, India
Abstract: The problem of scheduling which computer process run at what time on the central processing unit (CPU) or the processor is explored. We are very much aware the basic CPU scheduling algorithms (namely first come first serve, priority scheduling and shortest job first). Apart from these some algorithms are also available for the same.One of them scheduling is Multilevel queue scheduling. That I had disscussed in my paper. Intoduction: The assignment of physical processors to processes allows processors to accomplish work. The problem of determining when processors should be assigned and to which processes is called processor scheduling or CPU scheduling.When more than one process is runable, the operating system must decide which one first. The part of the operating system concerned with this decision is called the scheduler, and algorithm it uses is called the scheduling algorithm. Goals of Scheduling (objectives) Many objectives must be considered in the design of a scheduling discipline. In particular, a scheduler should consider fairness, efficiency, response time, turnaround time, throughput, etc., Some of these goals depends on the system one is using for example batch system, interactive system or real-time system, etc. but there are also some goals that are desirable in all systems. All the algorithms are designed for providing some specific features and designed to recommend some predefined facts finally they work efficiently in some circumtances For example
FCFS (First Come First Serve ) :-Applied in batch systems (non-preemptive).Each task runs, once started, runs to completion this algorithm is considered more efficient for the processing the process who have almost same burn time . Periority Based scheduling.When the process can be distinguish using there importance but in some condition it give starvation problem SJF (shortest job first): Process are preriorities by their burst time (Practically this is not possible) Same as above scheduling one scheduling is also there that is Multilevel queue scheduling.This is used for

situations in which processes are easily divided into different groups. For example, a common division is made between foreground (interactive) processes and background (batch) processes. These two types of processes have different response-time requirements and so may have different scheduling needs. it is very useful for shared memory problem. Discussion: 1 Multilevel Queue Scheduling Another class of scheduling algorithms has been created for situations in which processes are easily classified into different groups. For example, a common division is made between foreground (interactive) processes and background (batch) processes. These two types of processes have different response-time requirements, and so might have different scheduling needs. In addition foreground processes may have priority (externally defined) over background processes. A multilevel queue-scheduling algorithm partitions the ready queue into several separate queues (Figure). The processes are permanently assigned to one queue, generally based on some

property of the process, such as memory size, process priority or process type. Each queue has its own scheduling algorithm. For example, separate queues might be used for foreground and background processes. The foreground queue might be scheduled by an RR algorithm, while the background queue is scheduled by an FCFS algorithm. In addition, there must be scheduling between the queues, which is commonly implemented as a fixed-priority preemptive scheduling. For example, the foreground queue may have absolute priority over the background queue.

Let us look at an example of a multilevel queue scheduling algorithm with five queues: 1. 2. 3. 4. 5. System processes Interactive processes Interactive editing processes Batch processes Student processes

Each queue has absolute priority over lower-priority queues. No process in the batch queue, for example, could run unless the queues for system processes, interactive processes, and interactive editing processes were all empty. If an interactive editing process entered the ready queue while a batch process was running, the batch process would be preempted. Another possibility is to time slice between the queues. Each queue gets a certain portion of the CPU time, which it can then schedule among the various processes in its queue. For instance, in the foreground-background queue example, the foreground queue can be given 80 percent of the CPU time for RR scheduling among its processes, whereas the background queue receives 20 percent of the CPU to give to its processes in a FCFS manner.

2.Example of MultiLevel Queue Scheduling (Two Queue) Here we have partioned the Ready queue into two seprate queue 1.Q1--------> ForGround (Interactive) 2. Q2-------->Background(Bach) each queue has its own scheduling: Forground-Process having queue Q1 have scheduling-algorithm Round Robin(timeslice based Algorithm) Background Scheduling having queue Q2 have scheduling-algorithm First come First serve(Batch based Algorithm) so basically there are multi level scheduling algorithm works 1. Queue Level sheduling :-all queue are seprated by there their process category but they call some scheduling for their arrangement means they maintain some scheduling for among them too.Scheduling must be done between the queues. 2. Process level scheduling-algorithm :- This is second level of scheduling where we maintain some scheduling within the Process that are in the same queue. 3.Implimentation of Multilevel Queue-scheduling:- There are many technique to impliment this algorithm and various Operation sytem use different approach. But in this section we will discuss simple and common approach.For implimentaion of queue with the following attribute class Process{ String ProcessId ; Int Arrival_time; int burst_time; }/*create as many instaces of this variable as much queue you are required*/ Queue<Process> q1= new queue<Process>(); Queue<Process> q2= new queue<Process>(); //for foreground Process //for Background Process

//add the Process into the corresponding queueby idetifying their feature public boolean hasRunnableProcess() { // TODO Auto-generated method stub return false; } public boolean hasForegroundProcess() { //add in queue Q1 // TODO Auto-generated method stub return false; } public boolean hasBackgroundProcess() { //add in Queue Q2 // TODO Auto-generated method stub return false; } //Make the scheduling function for each level /One for queue and another for process. public void addProcessTraceSchduling(Process p) { //Process scheduling

// TODO Auto-generated method stub } public void addqueueTracesscheduling(Collection<Process> list) { // queue-scheduling // TODO Auto-generated method stub } At the above function we can write code for scheduling that we are using for the respective level.this was a outline view that is common for all implimentation level. 4. Advantage of Multi Level Queue-scheduling 1.This scheduling is a combination of more than one scheduling so increse the CPU utilization 2.It give high throughput 3.It categorized the Process (in form of queue) and the the basis of queue process category we can decide the scheduling-algorithm 4.each Queue have differet scheduling that give higher efficiency 5.Time Slice each queue get the certain amount of CPU time which it can schedule amongst its process i.e 80% to foreground in RR and 20% to background in FCFS 5.Drawback Of Mulitilevel queue-scheduling 1.Process can not migrate within the queue so it can give starvation problem 2.some time it use fixed priority scheduling among the queue(IE serve all from foreground then the background ,Possibility the of starvation 6.Performance of Multi Level Queue-scheduling :-As we all are concern for the best estimation result of all parameter that decide the scheduling quality. No scheduling is best but some give better response for the Predefined parameter of CPU-scheduling-algorithm so the following table display the estimation of multilevel queue-scheduling Scheduling algorithm First In First Out Shortest Job First Priority based scheduling Round-robin scheduling Multilevel Queue scheduling CPU Utilization Low Medium Medium High High Throughput Low High Low Medium High Turnaround time High Medium High Medium Medium Response time Low Medium High High Medium

Conclusion:-Multilevel queue-scheduling is efficient for some prespective its performance is also good but for some feedback windows version use it enhanced form like multilevel feedback queuescheduling.Where the Process migeration is Possible and all the feature of multilevel queue-scheduling are availabe in the feedback scheduling-algorithm.In the above document we have a brief description of its implementaion and Process.Apart from this we have also describe its drawback point and advantages as well.