References
[1]. Ahad M.A, (2012). “Modifying Round Robin Algorithm
for Process Scheduling using Dynamic Time Quantum
Precision”. Special Issue of International Journal of
Computer Applications, pp. 5-10.
[2]. Barman. D, (2013). “Dynamic Time Quantum in Round
Robin Algorithm Depending on Burst and Arrival Time of
the Processes”. International Journal of Innovative Technology and Exploring Engineering, Vol.2, No.4,
pp.60-64.
[3]. Behera H.S. et.al, (2011). “Design and Performance
Evaluation of Multi Cyclic Round Robin Algorithm using
Dynamic Time Quantum”. Journal of Global Research in
Computer Science, Vol.2, No. 2, pp. 48-53.
[4]. Datta K., Jana M., and Mazumdar A, (2015). “An
Effective Dynamic Quantum Round Robin CPU
Scheduling Algorithm”. International Journal of Computer
Applications, Vol.130, No.6, pp.1-5.
[5]. Jaiswal R.R., Geetha K., and Mohan R, (2013). “An
Intelligent Adaptive Round Robin (IARR) Scheduling
Algorithm for Performance Improvement in Real Time
Systems”. Proceedings of International Conference on
Advances in Mechanical Engineering.
[6]. Helmy T. and Dekdouk A, (2007). “Burst Round Robin:
As A Proportional-Share Scheduling Algorithm”. in
th Proceedings of the 4 IEEE-GCC Conference on Towards
Techno-Industrial Innovations, pp.424-428.
[7]. Khankasikam K, (2013). “An Adaptive Round Robin
Scheduling Algorithm: A Dynamic Time Quantum
Approach”. International Journal of Advancements in
Computing Technology, Vol.5, No.1, pp.595-603.
[8]. Kundargi N. and Emmi M.S, (2014). “Job Scheduling
Algorithm using Finest Time Quantum for Real Systems”.
International Journal of Latest Trends in Engineering and
Technology, Vol.4, No.1, pp.120-123.
[9]. Matanech, R.J, (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, pp.1831-1837.
[10]. Mishra M.K. and Rashid F, (2014). “An Improved
Round Robin CPU Scheduling Algorithm with Varying Time
Quantum”. International Journal of Computer Science,
Engineering and Applications (IJCSEA), Vol.4, No.4.
[11]. Negi S, (2013). “An Improved Round Robin Approach
using Dynamic Time Quantum for Improving Average
Waiting Time”. International Journal of Computer
Applications, Vol.69, No.14, pp.12-16.
[12]. Noon, A, Kalakech, A. and Kadry, S. (2011). “A New Round Robin based Scheduling Algorithm for Operating
Systems: Dynamic Quantum using the Mean Average”.
IJCSI International Journal of Computer Science, Vol.8,
No.3, pp.224-229.
[13]. Rao, G.S.N., Srinivasu, N. and Rao, G.R.K. (2015).
“Dynamic Time Slice Calculation for Round Robin Process
Scheduling Using NOC”. International Journal of Electrical and Computer Engineering, Vol.5, No.6, pp.1480-1485.
[14]. Vijaya Lakshmi, G. (2015). “Determining a Finest
Time Quantum to Improve the Performance of Round
Robin Scheduling Algorithm”. International Journal of
Innovative Research in Computer and Communication
Engineering, Vol.3, No.7, pp.6913-6918.
