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

Simple item page
dc.contributor.authorMUSTAPHA, MUHAMMAD AHMAD
dc.date.accessioned2018-08-28T10:21:43Z
dc.date.available2018-08-28T10:21:43Z
dc.date.issued2016-02
dc.descriptionA THESIS SUBMITTED TO THE SCHOOL OF POSTGRADUATE STUDIES, AHMADU BELLO UNIVERSITY, ZARIA IN PARTIAL FULFILLMENT FOR THE AWARD OF MASTER DEGREE IN COMPUTER SCIENCE DEPARTMENT OF MATHEMATICS, FACULTY OF SCIENCE AHMADU BELLO UNIVERSITY, ZARIA, NIGERIAen_US
dc.description.abstractThe 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 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).en_US
dc.identifier.urihttp://hdl.handle.net/123456789/10137
dc.language.isoenen_US
dc.subjectDEVELOPMENT,en_US
dc.subjectOPTIMIZED PRIORITY,en_US
dc.subjectCPU SCHEDULING ALGORITHM,en_US
dc.subjectMINIMIZE STARVATION,en_US
dc.subjectPROCESSES,en_US
dc.subjectEFFICIENCY FACTORen_US
dc.titleDEVELOPMENT OF AN OPTIMIZED PRIORITY BASED CPU SCHEDULING ALGORITHM TO MINIMIZE STARVATION OF PROCESSES USING AN EFFICIENCY FACTORen_US
dc.typeThesisen_US
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
DEVELOPMENT OF AN OPTIMIZED PRIORITY BASED CPU SCHEDULING ALGORITHM TO MINIMIZE STARVATION OF PROCESSES USING AN EFFICIENCY FACTOR.pdf
Size:
2.26 MB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.62 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
SCIENCE