IMPROVED ROUND ROBIN WITH HIGHEST RESPONSE RATIO NEXT (IRRHRRN) CPU SCHEDULING ALGORITHM
IMPROVED ROUND ROBIN WITH HIGHEST RESPONSE RATIO NEXT (IRRHRRN) CPU SCHEDULING ALGORITHM
dc.contributor.author | BABA’ABU, MUHAMMAD ABUBAKAR | |
dc.date.accessioned | 2017-09-21T14:52:46Z | |
dc.date.available | 2017-09-21T14:52:46Z | |
dc.date.issued | 2016-11 | |
dc.description | A THESIS SUBMITTED TO THE SCHOOL OF POSTGRADUATE STUDIES, AHMADU BELLO UNIVERSITY, ZARIA IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE AWARD OF A MASTER DEGREE IN COMPUTER SCIENCE DEPARTMENT OF MATHEMATICS, FACULTY OF SCIENCE AHMADU BELLO UNIVERSITY | en_US |
dc.description.abstract | Round Robin CPU scheduling algorithm is the most suitable scheduling algorithm used in timesharing operating systems, but its performance is sensitive to time quantum selection, which is the same as the First-Come-First-Serve (FCFS) Scheduling or Processor sharing algorithm if the time quantum is large or extremely too small. This thesis proposed an algorithm known as Improved Round Robin with Highest Response Ratio Next (IRRHRRN) CPU Scheduling Algorithmwhich made improvements on the Improved Round Robin scheduling algorithms by adopting the principle of Highest Response Ratio Next (HRRN) in static Round Robin implementation. The proposed algorithm (IRRHRRN) together with Round Robin (RR),FCFS, Improved Round Robin (IRR) and An Additional Improvement in Round Robin (AAIRR) CPU scheduling algorithms were implemented in Java and their results were compared based on Average Waiting Time (AWT), Average Turnaround Time (ATAT), Average Response Time (ART) and Number of Context Switches (NCS) for different categories of processes that were generated randomly (i.e. using uniform distribution for burst time and Poisson for arrival time). It was observed that this algorithmis the best scheduling algorithm in terms of minimizing AWT, ATAT and ART based on the results obtained.It is therefore recommendedthat this algorithm is implemented in systems which adopt the Round Robin scheduling whose time quantum are provided statically (user inputs the time quantum before the execution of the processes); so as to improve the performance of the systems. | en_US |
dc.identifier.uri | http://hdl.handle.net/123456789/9177 | |
dc.language.iso | en | en_US |
dc.subject | ROUND ROBIN, | en_US |
dc.subject | HIGHEST RESPONSE RATIO NEXT (IRRHRRN) | en_US |
dc.subject | CPU SCHEDULING ALGORITHM, | en_US |
dc.title | IMPROVED ROUND ROBIN WITH HIGHEST RESPONSE RATIO NEXT (IRRHRRN) CPU SCHEDULING ALGORITHM | en_US |
dc.type | Thesis | en_US |
Files
Original bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- IMPROVED ROUND ROBIN WITH HIGHEST RESPONSE RATIO NEXT (IRRHRRN) CPU SCHEDULING ALGORITHM.pdf
- Size:
- 1.14 MB
- Format:
- Adobe Portable Document Format
- Description:
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.62 KB
- Format:
- Item-specific license agreed upon to submission
- Description: