An Intelligent MLFQ Scheduling Algorithm (IMLFQ) with Fault Tolerant Mechanism

Scheduling algorithms are used in operating systems to optimize the usage of processors. One of the most efficient algorithms for scheduling is multi-layer feedback queue (MLFQ) algorithm which uses several queues with different quanta. The most important weakness of this method is the inability to define the optimized the number of the queues and quantum of each queue. These factors affect the response time directly. Also this algorithm does not show any considerable improvement in response time of the processes in comparison with the other scheduling algorithms. In this paper, a new algorithm is presented for solving these problems and minimizing the response time. In this algorithm recurrent neural network has been utilized to find both the number of queues and the optimized quantum of each queue. Also in order to prevent any probable faults in processes' response time computation, a new fault tolerant approach has been presented. The experimental results show that using the IMLFQ algorithm results in better response and waiting time in comparison with other scheduling algorithms

[1]  G. J. Henry,et al.  The UNIX system: The fair share scheduler , 1984, AT&T Bell Laboratories Technical Journal.

[2]  Ben Shneiderman,et al.  Response time and display rate in human performance with computers , 1984, CSUR.

[3]  C. Murray Woodside.  Controllability of computer performance tradeoffs obtained using controlled-share queue schedulers , 1986, IEEE Transactions on Software Engineering.

[4]  Jan L. Guynes.  Impact of system response time on state anxiety , 1988, CACM.

[5]  Judy Kay,et al.  A fair share scheduler , 1988, CACM.

[6]  Jeffrey L. Elman,et al.  Finding Structure in Time , 1990, Cogn. Sci..

[7]  Tarun Khanna,et al.  Foundations of neural networks , 1990 .

[8]  D. K. Subramanian,et al.  Fairness in processor scheduling in time sharing systems , 1991, OPSR.

[9]  Nikola Kasabov,et al.  Foundations Of Neural Networks, Fuzzy Systems, And Knowledge Engineering [Books in Brief] , 1996, IEEE Transactions on Neural Networks.

[10]  Rami G. Melhem,et al.  Fault-Tolerance Through Scheduling of Aperiodic Tasks in Hard Real-Time Multiprocessor Systems , 1997, IEEE Trans. Parallel Distributed Syst..

[11]  C. Siva Ram Murthy,et al.  A Fault-Tolerant Dynamic Scheduling Algorithm for Multiprocessor Real-Time Systems and Its Analysis , 1998, IEEE Trans. Parallel Distributed Syst..

[12]  Chuanyi Ji,et al.  Fast training of recurrent networks based on the EM algorithm , 1998, IEEE Trans. Neural Networks.

[13]  Shuji Hashimoto,et al.  Automated trend diagnosis using neural networks , 2000, Smc 2000 conference proceedings. 2000 ieee international conference on systems, man and cybernetics. 'cybernetics evolving to systems, humans, organizations, and their complex interactions' (cat. no.0.

[14]  Jürgen Schmidhuber,et al.  LSTM recurrent networks learn simple context-free and context-sensitive languages , 2001, IEEE Trans. Neural Networks.

[15]  Andreas Zeller,et al.  Simplifying and Isolating Failure-Inducing Input , 2002, IEEE Trans. Software Eng..

[16]  Myra B. Cohen,et al.  A variable strength interaction testing of components , 2003, Proceedings 27th Annual International Computer Software and Applications Conference. COMPAC 2003.

[17]  Douglas C. Schmidt,et al.  Skoll: distributed continuous quality assurance , 2004, Proceedings. 26th International Conference on Software Engineering.

[18]  C. Molter,et al.  Introduction of a Hebbian unsupervised learning algorithm to boost the encoding capacity of Hopfield networks , 2005, Proceedings. 2005 IEEE International Joint Conference on Neural Networks, 2005..