Running resilient MPI applications on a Dynamic Group of Recommended Processes

Abstract

High-performance computing systems run applications that can take several hours to execute and have to deal with the occurrence of a potentially large number of faults. Most of the existing fault-tolerant strategies for these systems assume crash faults that are permanent events are easily detected. This is not the case in several real systems, in particular in shared clusters, in which even the load variation may cause performance problems that are virtually equivalent to faults. In this work, we present a new model to deal with this problem in which processes execute tests among themselves in order to determine whether the processors (or cores) on which they are running are recommended or non-recommended. Processes classified as recommended form a Dynamic Group of Recommended Processes (DGRP) that runs the application. The DGRP is formed only by processes that have not been tested as non-recommended by all DGRP processes. A process not in the DGRP that is continuously tested as recommended can rejoin the DGRP after a round of consensus executed by DGRP processes. Experimental results are presented obtained from a MPI-based implementation in which the HyperQuickSort parallel sorting algorithm reconfigures itself at runtime to tolerate up to N − 1 faults (in a system with N processes) while sorting up to 1 billion integers.

Utilizando o vCube para Detecção de Falhas em Sistemas Assíncronos

“…Portanto, o diagnóstico assume implicitamente o modelo síncrono . Embora um modelo anterior de diagnóstico em nível de sistema tenha assumido testes que não são perfeitos [Camargo and Duarte 2018], apenas no trabalho recente de ] os algoritmos de diagnóstico são especificados como detectores de falhas.…”