| Research on Fault Tolerant Scheduling Algorithms of Web Cluster Based on Probability |
| |
| 引用本文： | LIUAn-feng CHENZhi-gang LONGGuo-Ping. Research on Fault Tolerant Scheduling Algorithms of Web Cluster Based on Probability[J]. 武汉大学学报:自然科学英文版, 2005, 10(1): 70-74. DOI: 10.1007/BF02828620 |
| |
| 作者姓名： | LIUAn-feng CHENZhi-gang LONGGuo-Ping |
| |
| 作者单位： | CollegeofInformationScienceandEngineering,CentralSouthUniversity,Changsha410083,Hunan,China |
| |
| 基金项目： | SupportedbytheNationalNaturalScienceFoundationofChina(10375024)andtheNaturalScienceFundsofHunanProvinceofChina(03JJY4054) |
| |
| 摘 要： | 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. ““““““““Ib 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.
|
| 关 键 词： | 容错调度算法 Web 软件实时系统 概率分析 自相似性 计算机网络 |
| 收稿时间： | 2004-05-10 |
Research on fault tolerant scheduling algorithms of web cluster based on probability |
| |
| Liu An-feng,Chen Zhi-gang,Long Guo-ping. Research on fault tolerant scheduling algorithms of web cluster based on probability[J]. Wuhan University Journal of Natural Sciences, 2005, 10(1): 70-74. DOI: 10.1007/BF02828620 |
| |
| Authors: | Liu An-feng Chen Zhi-gang Long Guo-ping |
| |
| Affiliation: | (1) College of Information Science and Engineering, Central South University, 410083, Hunan Changsha, China |
| |
| Abstract: | 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. Foundation item: Supported by the National Natural Science Foundation of China (10375024) and the Natural Science Funds of Hunan Province of China (03JJY4054) Biography: LIU An-Feng(1971-), male, Ph.D. candidate, research direction: network computing, web QoS. |
| |
| Keywords: | soft real-time system fault tolerant scheduling probabilistic analysis self similar schedulabilistic probability |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ |
|
