Research on fault tolerant scheduling algorithms of web cluster based on probability
Liu An-feng, Zhigang Chen, Long Guo-ping · Wuhan University Journal of Natural Sciences · 2005
Aiming at the soft real-time fault tolerant demand of critical web applications at present, such as E-commerce, a new fault tolerant scheduling algorithm based on probability is proposed. To achieve fault tolerant scheduling, the primary/slave backup technology is applied on the basis of task's self similar accessing characteristics, when the primary task completed successfully, the resources allocated for the slave task are reclaimed, thus advancing system's efficiency. Experimental results demonstrate on the premise of satisfying system's certain fault tolerant probability, task's schedulabilistic probability is improved, especially, the higher task's self similar degree is, the more obviously the utilization of system resources is enhanced.