抽象的

Pecking Order Continuous Rescue Fault Tolerance Scheduling In Grid Computing

Kala.K, Stephie Rachel.I, Balasubramanian. C

Grid computing is an emerging technology in the next-generation of parallel and distributed computing methodology that aggregates diverse heterogeneous resources for solving various kinds of large-scale applications in science and engineering. Generally grid scheduling approaches will improve resources utilization in grids. In Existing System, the reliability of task for an application is measured effectively on Grid virtual nodes. The main work in grid area is to deal with the fault prediction and fault tolerance; it will be more complex due to the dynamic nature of the grid computing. The proposed mechanism improves the scheduling of tasks to various grid resources. Moreover, the hierarchical fault scheduling in computational grid is to deduct the resource failure in hierarchical manner. This hierarchical scheduling mechanism only occurs at the level of Global server and Local server; whereas fault tolerance is take place at the global scheduler and fault prediction occur at the local scheduler. Thus, lucratively improve the task reliability and availability of an application in grid by implementing the Fault Prediction and Fault Tolerance (FP and FT) Algorithms.

免责声明: 此摘要通过人工智能工具翻译,尚未经过审核或验证

索引于

学术钥匙
研究圣经
引用因子
宇宙IF
参考搜索
哈姆达大学
世界科学期刊目录
学者指导
国际创新期刊影响因子(IIJIF)
国际组织研究所 (I2OR)
宇宙

查看更多