DEVELOPMENT OF AN OPTIMIZED PRIORITY BASED CPU SCHEDULING ALGORITHM TO MINIMIZE STARVATION OF PROCESSES USING AN EFFICIENCY FACTOR

DEVELOPMENT OF AN OPTIMIZED PRIORITY BASED CPU SCHEDULING ALGORITHM TO MINIMIZE STARVATION OF PROCESSES USING AN EFFICIENCY FACTOR

  • The Complete Research Material is averagely 112 pages long and it is in Ms Word Format, it has 1-5 Chapters.
  • Major Attributes are Abstract, All Chapters, Figures, Appendix, References.
  • Study Level: BTech, BSc, BEng, BA, HND, ND or NCE.
  • Full Access Fee: ₦4,000

Get the complete project » Instant Download Active

ABSTRACT

The priority based CPU scheduling algorithm (i.e. Shortest Job First (SJF) or Priority Scheduling

(PS)) is a kind of scheduling algorithm that assigns the CPU to processes based on the priority of

each process. The shortcoming of both of these algorithms is starvation (i.e. starvation of

processes with longer burst times in the case of SJF and starvation of processes with lower

priorities in the case of PS). This dissertation proposes a new algorithm that introduces the

concept of EFFICIENCY FACTOR which uses three properties which are priority, burst time

and arrival time to compute one factor which is used to schedule processes in the case of the

proposed Priority algorithm instead of only one factor that priority is in the case of traditional

Priority algorithm and two properties which are burst time and arrival time to compute one factor

which is used to schedule processes in the case of proposed Shortest Job First algorithm instead

only one factor that is burst time in the case of traditional Shortest Job First algorithm. This

proposed algorithm was implemented and benchmarked against SJF, PS and the Optimum

Service Time Concept for Round Robin Algorithm (OSTRR) by Saxena and Agarwal (2012)

using three different statistical distributions (namely Normal, Uniform and Exponential

Distributions) to generate the burst times of the processes, two different statistical distributions

(namely Uniform and Exponential Distributions) to generate the priorities of the processes and

also, uses Poisson Distribution to generate the arrival times of processes. It is observed that in the

SJF category, the traditional SJF produced better Average Waiting Time (AWT), Average

Turnaround Time (ATAT), Average Response Time (ART) and Waiting Time Variance

Deviation (WTVD) compared with the proposed SJF. But they both produced the same Number

of Context Switches (NCS). The proposed SJF produced better results compared with OSTRR

with respect to AWT, ATAT, ART, NCS and WTVD. While in the PS category, the proposed

Priority produced better AWT, ATAT, ART and WTVD compared to the traditional Priority

vi


scheduling algorithm. But they both produced the same NCS. The proposed Priority algorithm

produced better results which means the proposed priority algorithm produced lesser NCS and

smaller value of WTVD when compared to OSTRR by Saxena and Agarwal (2012) and OSTRR

by Saxena and Agarwal (2012) produced minimal AWT and ATAT than the proposed Priority

algorithm although the values are almost identical in all categories of the statistical distributions

used. Based on these results, the proposed Priority algorithm should be preferred over the

traditional Priority algorithm. This is because, starvation has been minimized by reducing the

average waiting time, average turnaround time, average response time and waiting time variance

deviation in the case of the 500 processes that were considered and the burst time of processes

ranging between 1 and 100ms and a quantum time of 10ms used by OSTRR by Saxena and

Agarwal (2012).


You either get what you want or your money back. T&C Apply





Share a Comment


You can find more project topics easily, just search

Quick Project Topic Search