ESTIMATION OF QUANTUM TIME LENGTH FOR ROUND-ROBIN SCHEDULING ALGORITHM USING NEURAL NETWORKS

Omar AlHeyasat, Randa Herzallah

Abstract

The quantum time length is usually taken as a fixed value in all applications that use Round Robin (RR) scheduling algorithm. The determination of the optimal length of the quantum that results in a small average turn around time is very complicated because of the unknown nature of the tasks in the ready queue. The round robin algorithm becomes very similar to the first in first served algorithm if the quantum length is large. On the other hand, high context switch results for small values of quantum length which might cause central processing unit (CPU) thrashing. In this paper we propose a new RR scheduling algorithm based on using neural network models for predicting the optimal quantum length that yields minimum average turn around time. The quantum length is taken to be a function of the service time of the various jobs available in the ready queue. This in contrast to the traditional methods of using fixed quantum length is shown to give better results and to minimize the average turnaround time for almost any collection of jobs in the ready queue.

References

  1. Amotz, B., Vladimir, D., and Boaz, P. (2004). Efficient algorithm for periodic scheduling. Computer Networks, 45:155-173.
  2. Andrews, M. and Zhang, L. (2005). Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data. Journal of the ACM, 52(5):809-834.
  3. Ben, G., Richard, J., Lipton, Andrea, L., and F, F. (2005). Estimating the maximum.Journal of Algorithms, 54:105-114.
  4. Chakrabarti, S., Demmel, J., and Yelick, K. (1997). Models and scheduling algorithms for mixed data and task parallel programs. Journal of Parallel and Distributed Computing, 47:168-184.
  5. Cooling, J. and Tweedale, P. (1997). Task scheduler coprocessor for hard real-time systems. Microprocessors and Microsystems, 20:553-566.
  6. Janche, S., Ke-hsiung, C., and Vernon, R. (1994). Efficient algorithm for simulating service diciplines. Simulation Practice and Theory, 1:223-244.
  7. Philip, J. and Rasch (1970). A queuing theory study of round-robin scheduling of time-shared computer systems. Journal of Association for Computing Machinary, 17(1):131-145.
  8. Rahul, G. and Xiaoqiang, C. (1999). Rrr: recursive round robin scheduler. Computer Networks, 31:1951-1966.
  9. Ramabhadran, S. and Pasquale, J. (2006). The stratified round robin scheduler: Design, analysis and imple mentation. IEEE/ACM Transactions on Networking, 14(6):1362-1373.
  10. Ramos, R. J., Rego, V., and Sang, J. (2006). An efficient burst-arrival and batch-departure algorithm for roundrobin servicestar. Simulation Modelling Practice and Theory, 14(1):1-24.
  11. Salil, S., Kanhere, and Sethu, H. (2004). Investigated socket-based rr scheduling scheme for tightly coupled clusters providing single-name images. Computer Communications, 27:667-678.
  12. Seungmin, B., Hwakyung, R., and Sungchun, K. (2004). Investigated socket-based rr scheduling scheme for tightly coupled clusters providing single-name images. Journal of Systems Architecture, 50:299-308.
  13. Silberschatz, A., Galvinand, P. B., and Gagne, G. (2000). Operating System Concepts. John Wiley and Sons, Inc., New York. London.
  14. Srinivasan, A. and Anderson, J. (2005). Fair scheduling of dynamic task systems on multiprocessors. Journal of Systems and Software, 77:67-80.
  15. Tsiligaridis, J. and Acharya, R. (2005). Three new approaches for adjustment and improvement of the rr scheduler in a dynamic resource environment. Computer Communications, 28:929-946.
Download


Paper Citation


in Harvard Style

AlHeyasat O. and Herzallah R. (2010). ESTIMATION OF QUANTUM TIME LENGTH FOR ROUND-ROBIN SCHEDULING ALGORITHM USING NEURAL NETWORKS . In Proceedings of the International Conference on Fuzzy Computation and 2nd International Conference on Neural Computation - Volume 1: ICNC, (IJCCI 2010) ISBN 978-989-8425-32-4, pages 253-257. DOI: 10.5220/0003058002530257


in Bibtex Style

@conference{icnc10,
author={Omar AlHeyasat and Randa Herzallah},
title={ESTIMATION OF QUANTUM TIME LENGTH FOR ROUND-ROBIN SCHEDULING ALGORITHM USING NEURAL NETWORKS },
booktitle={Proceedings of the International Conference on Fuzzy Computation and 2nd International Conference on Neural Computation - Volume 1: ICNC, (IJCCI 2010)},
year={2010},
pages={253-257},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003058002530257},
isbn={978-989-8425-32-4},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Fuzzy Computation and 2nd International Conference on Neural Computation - Volume 1: ICNC, (IJCCI 2010)
TI - ESTIMATION OF QUANTUM TIME LENGTH FOR ROUND-ROBIN SCHEDULING ALGORITHM USING NEURAL NETWORKS
SN - 978-989-8425-32-4
AU - AlHeyasat O.
AU - Herzallah R.
PY - 2010
SP - 253
EP - 257
DO - 10.5220/0003058002530257