earticle

논문검색

A Fault Tolerant Scheduling System Based on Checkpointing for Computational Grids

초록

영어

Job checkpointing is one of the most common utilized techniques for providing fault tolerance in computational grids. The efficiency of checkpointing depends on the choice of the checkpoint interval. Inappropriate checkpointing interval can delay job execution. In this paper, a fault-tolerant job scheduling system based on checkpointing technique is presented and evaluated. When scheduling a job, the system uses both average failure time and failure rate of grid resources combined with resources response time to generate scheduling decisions. The system uses the failure rate of the assigned resources to calculate the checkpoint interval for each job. Extensive simulation experiments are conducted to quantify the performance of the proposed system. Experiments have shown that the proposed system can considerably improve throughput, turnaround time and failure tendency.

목차

Abstract
 1. Introduction
 2. Related Work
 3. Problem Definition and Scope
 4. FTCS Scheduling
  4.1. Components of the FTCS
 5. Simulation Environment
 6. Results and Discussions
  6.1. Throughput
  6.2. Average Turnaround Time
  6.3. Failure Tendency
 7. Conclusions
 References

저자정보

  • Mohammed Amoon Computer Science and Eng. Dept., Faculty of Elec. Eng., Menofia University, Egypt King Saud University

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.