Task scheduling algorithm for multicore processor system for minimizing recovery time in case of single node fault

In this paper, we propose a task scheduling algorithm for a multicore processor system which reduces the recovery time in case of a single fail-stop failure of a multicore processor. Many of the recently developed processors have multiple cores on a single die, so that one failure of a computing node results in failure of many processors. In the case of a failure of a multicore processor, all tasks which have been executed on the failed multicore processor have to be recovered at once. The proposed algorithm is based on an existing checkpointing technique, and we assume that the state is saved when nodes send results to the next node. If a series of computations that depends on former results is executed on a single die, we need to execute all parts of the series of computations again in the case of failure of the processor. The proposed scheduling algorithm tries not to concentrate tasks to processors on a die. We designed our algorithm as a parallel algorithm that achieves O(n) speed...

• Type: Conference
• Year: 2012
• Where: CCGRID
• Authors: Shohei Gotoda, Naoki Shibata and Minoru Ito
• Keywords: Conventional Task Scheduling, Fault Tolerance, Multicore Processors