In the existing studies on fault-tolerant scheduling, the active replication schema makes use of ε + 1 replicas for each task to tolerate ε failures. However, in this paper, we show that it does not always lead to a higher reliability with more replicas. Besides, the more replicas implies more resource consumption and higher economic cost. To address this problem, with the target to satisfy the user's reliability requirement with minimum resources, this paper proposes a new fault tolerant scheduling algorithm: MaxRe. In the algorithm, we incorporate the reliability analysis into the active replication schema, and exploit a dynamic number of replicas for different tasks. Both the theoretical analysis and experiments prove that the MaxRe algorithm's schedule can certainly satisfy user's reliability requirements. And the MaxRe scheduling algorithm can achieve the corresponding reliability with at most 70% fewer resources than the FTSA algorithm.
|ホスト出版物のタイトル||Proceedings - 2010 12th IEEE International Conference on High Performance Computing and Communications, HPCC 2010|
|出版ステータス||出版済み - 2010|
|イベント||2010 12th IEEE International Conference on High Performance Computing and Communications, HPCC 2010 - Melbourne, VIC, オーストラリア|
継続期間: 9 1 2010 → 9 3 2010
|その他||2010 12th IEEE International Conference on High Performance Computing and Communications, HPCC 2010|
|Period||9/1/10 → 9/3/10|
All Science Journal Classification (ASJC) codes