IMPROVED DYNAMIC TIME SLICE ROUND ROBIN SCHEDULING ALGORITHM WITH UNKNOWN BURST TIME
IMPROVED DYNAMIC TIME SLICE ROUND ROBIN SCHEDULING ALGORITHM WITH UNKNOWN BURST TIME
dc.contributor.author | YUSUF, Nurat | |
dc.date.accessioned | 2019-01-30T08:39:25Z | |
dc.date.available | 2019-01-30T08:39:25Z | |
dc.date.issued | 2017-04 | |
dc.description | A DISSERTATION SUBMITTED TO THE SCHOOL OF POSTGRADUATE STUDIES, AHMADU BELLO UNIVERSITY, ZARIA IN PARTIAL FULFILLMENT FOR THE AWARD OF A MASTER OF SCIENCE DEGREE IN COMPUTER SCIENCE | en_US |
dc.description.abstract | ABSTRACT Round-Robin (RR) is one of the algorithms employed by process and network schedulers in computing. As the term is generally used, time slices are assigned to each process in equal portions and in circular order, handling all processes without priority. Most literature on Round Robin assumed burst time of processes using different statistical distributions. Dynamic Time Slice Round Robin with Unknown Burst Time was designed to solve the problem of burst timeand improve the performance of round robin but determination of burst time can only be achieved when processes have executed in first or second cycle. This dissertation proposed to improve the performance of the existing algorithms by introducing a technique that generates burst time using instruction count and number of operators. The proposed algorithm was implemented and benchmarked against First-Come-First-Serve (FCFS), Shortest-Job-First (SJF), Round Robin (RR), Improved Round Robin (IRR) and Dynamic Time Slice Round Robin Scheduling Algorithm with unknown Burst Time. Evaluation analysis shows that the proposed algorithm is better than the existing scheduling algorithms. The performance is improved by 20-25%. The results of the proposed algorithm outperformed other algorithms in term of Average Waiting Time, Number of Context Switch and Turnaround Time, but CPU utilization was not considered. | en_US |
dc.identifier.uri | http://hdl.handle.net/123456789/11112 | |
dc.language.iso | en | en_US |
dc.subject | IMPROVED, | en_US |
dc.subject | DYNAMIC, | en_US |
dc.subject | TIME SLICE, | en_US |
dc.subject | ROUND ROBIN SCHEDULING ALGORITHM, | en_US |
dc.subject | UNKNOWN, | en_US |
dc.subject | BURST TIME | en_US |
dc.title | IMPROVED DYNAMIC TIME SLICE ROUND ROBIN SCHEDULING ALGORITHM WITH UNKNOWN BURST TIME | en_US |
dc.type | Thesis | en_US |
Files
Original bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- IMPROVED DYNAMIC TIME SLICE ROUND ROBIN SCHEDULING ALGORITHM WITH UNKNOWN BURST TIME.pdf
- Size:
- 1.21 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: