A new genetic-based algorithm for reliable distributed resources

In this paper, a new scheduling algorithm has been introduced based on dynamic genetic algorithm, which is more efficient in comparison with the previous similar algorithms and has more reliability. SQEFG is a new proposed algorithm, with new parameters and metrics defined, delays and response time to jobs have been decreased and the user satisfaction level has been increased. Analysis of proposed algorithm and several simulations´ results show better makeSpan in the overall processing time and more efficiency improvement in distributed systems. Hence the quality of service increases at different levels of distributed processors and the acknowledgments delay time of the processes decrease significantly. Considering the majority of parameters in the Grid environment, a new scheduling algorithm for independent jobs based on genetic algorithm has been presented which has increased the performance in the grid environments. For fault tolerance control in grid environments with high failure rates, inspection point method that has an enhanced performance comparing other techniques and methods such as repeat request, and repeat and migration is being used which considering low risk and risky environments parameters and metrics, reduces the round trip scheduling time of the processing resources comparing previous algorithms, hence increasing the quality of the service in different grid environments and decreases the average processing time of work. By using this new proposed algorithm, we would be able to solve some of the challenges in processing resources management and finally improve the response time for the service output which provided by the processing resources and with this new hybrid and dynamic technique overall processing time is being reduced.