DESIGN AND IMPLEMENTATION OF A MODIFIED MEDIAN ROUND ROBIN ALGORITHM (DIMMRRA)

Simple item page
dc.contributor.authorMORA, HAFSATU
dc.date.accessioned2017-04-06T08:30:17Z
dc.date.available2017-04-06T08:30:17Z
dc.date.issued2016-04
dc.descriptionA DISSERTATION SUBMITTED TO THE SCHOOL OF POSTGRADUATE STUDIES, AHMADU BELLO UNIVERSITY, ZARIA IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE AWARD OF MASTER OF SCIENCE (MSC) DEGREE IN COMPUTER SCIENCE DEPARTMENT OF MATHEMATICS, FACULTY OF SCIENCE, AHMADU BELLO UNIVERSITY, ZARIA. NIGERIAen_US
dc.description.abstractCentral Processing Unit (CPU) scheduling involves a careful examination of pending processes to determine the most efficient way to service the requests. Several scheduling algorithms have been designed to arrange accesses to computer resources efficiently. Round robin scheduling algorithm (RRSA) is an attractive algorithm but suffers from the problem of time quantum determination. In the classical round robin algorithm, quantum time is fixed throughout the scheduling process. This static nature made it very difficult to optimize the algorithm. The only solution to this problem is to provide a quantum time that changes dynamically during execution. Major challenges of dynamic round robin schedulers reported in the literature are: they do not include Average Response Time as a criterion for comparison and they do not bother much on preempting processes with negligible completion time after executing for a given time quantum leading to an increase in the number of context switches. This research proposed an algorithm, the Modified Median Round Robin (MMRRA), with a dynamic time quantum aimed at reducing the overhead of the RRSA. The proposed algorithm was implemented and evaluated against the following five algorithms in the literature: Improved Round Robin (IRR), Improved Mean Round Robin with Shortest Job First (IMRRSJF), Dynamic Round Robin with Controlled Preemption (DRRCP), Half Life Variable Quantum Time RR (HLVQTRR) and CLASSICAL RR. Which in turns, proved to perform better in terms of AWT, ATAT and NCS. But, in terms of ART, HLVQTRR has the best result but still the result for MMRRA was not bad.en_US
dc.identifier.urihttps://kubanni.abu.edu.ng/handle/123456789/8875
dc.language.isoenen_US
dc.subjectDESIGN AND IMPLEMENTATION,en_US
dc.subjectMODIFIED MEDIAN,en_US
dc.subjectROUND ROBIN ALGORITHM,en_US
dc.subject(DIMMRRA)en_US
dc.titleDESIGN AND IMPLEMENTATION OF A MODIFIED MEDIAN ROUND ROBIN ALGORITHM (DIMMRRA)en_US
dc.typeThesisen_US
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
DESIGN AND IMPLEMENTATION OF A MODIFIED MEDIAN ROUND ROBIN ALGORITHM.pdf
Size:
1.32 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