A NEW IMPROVED ROUND ROBIN (NIRR) CPU SCHEDULING ALGORITHM

dc.contributor.authorABDULRAZAQ, ABDULRAHIM
dc.date.accessioned2015-03-12T09:15:22Z
dc.date.available2015-03-12T09:15:22Z
dc.date.issued2014-09
dc.description.abstractThe Round Robin CPU scheduling algorithm is a fair scheduling algorithm that gives equal time quantum to all processes. The choice of the time quantum is critical as it affects the algorithm’s performance. This thesis proposes a new algorithm that further improved on the Improved Round Robin (IRR) CPU scheduling algorithm by Manish and AbdulKadir. This proposed algorithm was implemented and benchmarked against First-Come-First-Serve (FCFS), Shortest-Job-First (SJF), Round Robin (RR), Improved Round Robin (IRR) and Longest Job First with Combinational Burst Time (LJF+CBT) using three different statistical distributions (namely Normal, Uniform and Exponential distributions) to generate the burst time of the processes. It was observed that the proposed algorithm (i.e. A New Improved Round Robin (NIRR)) compared with the other Round Robin scheduling algorithms, produces best Average Waiting Time (AWT), Average Turnaround Time (ATAT) and Number of Context Switches (NCS) in all categories of the statistical distributions used. Based on these results, the proposed algorithm outperformed other scheduling algorithms for systems that adopt RR CPU schedulingen_US
dc.identifier.urihttp://hdl.handle.net/123456789/6157
dc.language.isoenen_US
dc.subjectNEWen_US
dc.subjectMPROVEDen_US
dc.subjectROUNDen_US
dc.subjectROBIN (NIRRen_US
dc.subjectCPUen_US
dc.subjectSCHEDULINGen_US
dc.subjectALGORITHM.en_US
dc.titleA NEW IMPROVED ROUND ROBIN (NIRR) CPU SCHEDULING ALGORITHMen_US
dc.typeThesisen_US
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
A NEW IMPROVED ROUND ROBIN (NIRR) CPU SCHEDULING ALGORITHM.pdf
Size:
2.44 MB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.58 KB
Format:
Item-specific license agreed upon to submission
Description:
Collections