Multi-Level Queue with Priority and Time Sharing for Real Time Scheduling
Iqra Sattar, Muhammad Bilal Shahid, Nida Yasir · 2014
Multilevel queue scheduling and Real time scheduling is common in CPU scheduling techniques. In this paper different techniques for scheduling these algorithms has been collected and discussed. Primarily an introduction to multilevel queue and real time scheduling are discussed. In multi-level queue scheduling, the starvation problem has been solved efficiently but this technique is not suitable for real time processes. To overcome this problem, an idea of new algorithm i.e., MLQPTS (Multilevel Queue with Priority & Time Sharing Scheduling) have been proposed. In this algorithm, all the processes are listed in a queue and this queue is built depending upon the priority of each process. This priority is calculated by considering the factors such as waiting time, processing time, deadline time, etc of each process. A queue executes for a specific time called Queue Execution Time. Each process gets its time share in execution depending upon the priority-level. After each execution interval, priority of each process is re-calculated and a new queue is built which accommodates the new incoming process as well. In this way, our proposed algorithm has the properties of MLQS and it can also accommodate real time processes. The objective of the study is to have better understanding of Multi-Level Queue and Real time scheduling and to see what challenges they have to face and how these challenges are resolved by using different techniques.