%0 Journal Article
	%A MohammadReza EffatParvar and  Akbar Bemana and  Mehdi EffatParvar
	%D 2008
	%J International Journal of Computer and Systems Engineering
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 21, 2008
	%T IMLFQ Scheduling Algorithm with Combinational Fault Tolerant Method
	%U https://publications.waset.org/pdf/5330
	%V 21
	%X 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. This
weakness has been improved in IMLFQ scheduling algorithm.
Number of the queues and quantum of each queue affect the response
time directly. In this paper, we review the IMLFQ algorithm 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.
In this approach we use combinational software redundancy to
prevent the any probable faults. The experimental results show that
using the IMLFQ algorithm results in better response time in
comparison with other scheduling algorithms also by using fault
tolerant mechanism we improve IMLFQ performance.
	%P 3202 - 3206