On the Scheduling of Checkpoints in Desktop Grids
On the Scheduling of Checkpoints in Desktop Grids
复制标题
桌面网格中检查点的调度
DOI：
10.1109/ccgrid.2011.63
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
D. Trystram
中科院分区：
文献类型：
--
作者：
M. Bouguerra;Derrick Kondo;D. Trystram
频繁的资源故障是快速完成批处理作业的主要挑战。检查指向和迁移是加速作业完成、避免死锁的一种方法。我们研究了桌面网格环境下顺序作业的检查点调度问题，桌面网格由自愿提供的分布式资源组成。我们设计了一个检查点调度算法，当故障服从任何一般的概率分布时，该算法对于离散时间是被证明是最优的。我们使用基于真实世界系统的带参数的模拟表明，该最优策略在检查点成本和批量完成时间方面显著地扩展并优于其他策略。
Frequent resources failures are a major challenge for the rapid completion of batch jobs. Check pointing and migration is one approach to accelerate job completion avoiding deadlock. We study the problem of scheduling checkpoints of sequential jobs in the context of Desktop Grids, consisting of volunteered distributed resources. We craft a checkpoint scheduling algorithm that is provably optimal for discrete time when failures obey any general probability distribution. We show using simulations with parameters based on real-world systems that this optimal strategy scales and outperforms other strategies significantly in terms of check pointing costs and batch completion times.