摘要
Aiming at the soft real-lime fault tolerant demand of critical webapplications at present, such as E-commerce, a new fault tolerant scheduling algorithm based onprobability is proposed. To achieve fault tolerant scheduling, the primary/slave backuptechnology isapplied on the basis of task's self similar accessing characteristics, when the primary taskcompleted successfully, the resources allocated for the slave task are reclaimed, thus advancingsystem's efficiency. Experimental results demonstrate on the premise of satisfying system's certainfault tolerant probability, task's schcdulabi-listic probability is improved, especially, the highertask's self similar degree is, the more obviously the utilization of system resources is enhanced.
Aiming at the soft real-lime fault tolerant demand of critical webapplications at present, such as E-commerce, a new fault tolerant scheduling algorithm based onprobability is proposed. To achieve fault tolerant scheduling, the primary/slave backuptechnology isapplied on the basis of task's self similar accessing characteristics, when the primary taskcompleted successfully, the resources allocated for the slave task are reclaimed, thus advancingsystem's efficiency. Experimental results demonstrate on the premise of satisfying system's certainfault tolerant probability, task's schcdulabi-listic probability is improved, especially, the highertask's self similar degree is, the more obviously the utilization of system resources is enhanced.
基金
SupportedbytheNationalNaturalScienceFoundationofChina(10375024)andtheNaturalScienceFundsofHunanProvinceofChina(03JJY4054)
