Improving Efficiency of Round Robin Scheduling Using Ascending Quantum And Minumim-Maxumum Burst Time | ||
| Journal of University of Anbar for Pure Science | ||
| Article 21, Volume 6, Issue 2, August 2012, Pages 85-89 PDF (333.32 K) | ||
| Document Type: Research Paper | ||
| DOI: 10.37652/juaps.2012.63364 | ||
| Author | ||
| Ali Jbaeer Dawood* | ||
| University of Anbar - College of Computer | ||
| Abstract | ||
| Round Robin (RR) is a kind of process algorithms, where the time quantum is fixed along the processes execution. In the other hand it depending on the First Come First Serve (FCFS) algorithm. Also RR performs in timesharing system by given each process static Time Quantum (TQ). In this paper, The TQ studied to improve the efficiency of RR and performs the degrades with respect to Context Switching (CS), Average Wait Time (AWT) and Average Turned Around Time (ATAT) that an overhead on the system. Thus, the new approach was proposed to calculate the TQ, known as Ascending Quantum and Minumim-Maxumum Round Robin (AQMMRR). The processes were ascending with shortest remaining burst time and calculate the TQ from multiply the summation of minimum and maximum BT by (80) percentage. The experimental result shows that AQMMRR performs better than RR and comparing with other two related works. | ||
| Keywords | ||
| component; Time Quantum; Context Switching; Average Wait Time; Average Turned Around Time | ||
| References | ||
|
[1] Silberchatz, Galvin and Gagne, (2003) , "operating systems concepts",(6th edn, John Wiley and Sons).
[2] S. K. Panda, S. K. Bhoi, (January 2012), "An Effective Round Robin Algorithm using Min-Max Dispersion Measure". International Journal on Computer Science and Engineering (IJCSE) ISSN : 0975-3397 Vol. 4 No. 01.
[3] J. Nieh, C. Vaill and H. Zhong, (June 2001), “Virtual-Time Round-Robin: An O(1) Proportional Share Scheduler”, Proceedings of the USENIX Annual Technical Conference, Boston, Massachusetts, USA, pp. 25-30.
[4] S. M. Mostafa, S. Z. Rida and S. H. Hamad, (October 2010), “Finding Time Quantum of Round Robin CPU Scheduling Algorithm in General Computing Systems using Integer Programming”, IJRRAS 5 (1), pp.64-71.
[5] Rami J. Matarneh, (2009), “Self-Adjustment Time Quantum in Round Robin Algorithm Depending on Burst Time of the Now Running Processes”, American Journal of Applied Sciences, Vol 6, No. 10.
[6] Tarek Helmy, Abdelkader Dekdouk, (2007), “Burst Round Robin as a Proportional-Share Scheduling Algorithm”, In Proceedings of The fourth IEEE-GCC Conference on Towards Techno-Industrial Innovations, pp. 424-428, Bahrain.
[7] H. S. Behera, R. Mohanty, D. Nayak, (August 2010), “A New Proposed Dynamic Quantum with Re-Adjusted Round Robin Scheduling Algorithm and Its Performance Analysis”, International Journal of Computer Applications (0975 –8887), Volume 5– No.5.
[8] Rakesh Mohanty, H. S. Behera, Khusbu Patwari, Monisha Dash, (2010), “Design and Performance Evaluation of a New Proposed Shortest Remaining Burst Round Robin (SRBRR) Scheduling Algorithm”, In Proceedings of International Symposium on Computer Engineering & Technology (ISCET), Vol 17.
[9] R. K. Yadav, A. K. Mishra, N. Prakash and H. Sharma, (2010), “An Improved Round Robin Scheduling Algorithm for CPU scheduling”, (IJCSE) International Journal on Computer Science and Engineering Vol. 02, No. 04, 1064-1066.
[10] Yaashuwanth .C IEEE Member, Dr.R. Ramesh, (March 2010), “Design of Real Time scheduler simulator and Development of Modified Round Robin architecture”, International Journal of Computer Science and Network Security, VOL.10 No.3.
| ||
|
Statistics Article View: 204 PDF Download: 178 |
||