Task scheduling scheme by checkpoint sharing and task duplication in P2P-based desktop grids
来源期刊:中南大学学报(英文版)2014年第10期
论文作者:Joon-Min Gil Young-Sik Jeong
文章页码:3864 - 3872
Key words:P2P-based desktop grids; checkpoint sharing; task duplication; embedded Markov chain
Abstract: A scheduling scheme is proposed to reduce execution time by means of both checkpoint sharing and task duplication under a peer-to-peer (P2P) architecture. In the scheme, the checkpoint executed by each peer (i.e., a resource) is used as an intermediate result and executed in other peers via its duplication and transmission. As the checkpoint is close to a final result, the reduction of execution time for each task becomes higher, leading to reducing turnaround time. To evaluate the performance of our scheduling scheme in terms of transmission cost and execution time, an analytical model with an embedded Markov chain is presented. We also conduct simulations with a failure rate of tasks and compare the performance of our scheduling scheme with that of the existing scheme based on client-server architecture. Performance results show that our scheduling scheme is superior to the existing scheme with respect to the reduction of execution time and turnaround time.
Joon-Min Gil, Young-Sik Jeong
(1. School of IT Engineering, Catholic University of Daegu, 13-13, Hayang-ro,
Hayang-eup, Gyeongsan-si, Gyeongbuk 712-701, Korea;
2. Department of Multimedia Engineering, Dongguk University, 30 Pildong-rol-gil,
Jung-gu, Seoul 100-715, Korea)
Abstract:A scheduling scheme is proposed to reduce execution time by means of both checkpoint sharing and task duplication under a peer-to-peer (P2P) architecture. In the scheme, the checkpoint executed by each peer (i.e., a resource) is used as an intermediate result and executed in other peers via its duplication and transmission. As the checkpoint is close to a final result, the reduction of execution time for each task becomes higher, leading to reducing turnaround time. To evaluate the performance of our scheduling scheme in terms of transmission cost and execution time, an analytical model with an embedded Markov chain is presented. We also conduct simulations with a failure rate of tasks and compare the performance of our scheduling scheme with that of the existing scheme based on client-server architecture. Performance results show that our scheduling scheme is superior to the existing scheme with respect to the reduction of execution time and turnaround time.
Key words:P2P-based desktop grids; checkpoint sharing; task duplication; embedded Markov chain