DMTCP: Transparent checkpointing for cluster computations and the desktop
23 May 2009-pp 1-12
TL;DR: DMTCP as mentioned in this paper is a transparent user-level checkpointing package for distributed applications, which is used for the runCMS experiment of the Large Hadron Collider at CERN, and it can be incorporated and distributed as a checkpoint-restart module within some larger package.
Abstract: DMTCP (Distributed MultiThreaded CheckPointing) is a transparent user-level checkpointing package for distributed applications. Checkpointing and restart is demonstrated for a wide range of over 20 well known applications, including MATLAB, Python, TightVNC, MPICH2, OpenMPI, and runCMS. RunCMS runs as a 680 MB image in memory that includes 540 dynamic libraries, and is used for the CMS experiment of the Large Hadron Collider at CERN. DMTCP transparently checkpoints general cluster computations consisting of many nodes, processes, and threads; as well as typical desktop applications. On 128 distributed cores (32 nodes), checkpoint and restart times are typically 2 seconds, with negligible run-time overhead. Typical checkpoint times are reduced to 0.2 seconds when using forked checkpointing. Experimental results show that checkpoint time remains nearly constant as the number of nodes increases on a medium-size cluster. DMTCP automatically accounts for fork, exec, ssh, mutexes/ semaphores, TCP/IP sockets, UNIX domain sockets, pipes, ptys (pseudo-terminals), terminal modes, ownership of controlling terminals, signal handlers, open file descriptors, shared open file descriptors, I/O (including the readline library), shared memory (via mmap), parent-child process relationships, pid virtualization, and other operating system artifacts. By emphasizing an unprivileged, user-space approach, compatibility is maintained across Linux kernels from 2.6.9 through the current 2.6.28. Since DMTCP is unprivileged and does not require special kernel modules or kernel patches, DMTCP can be incorporated and distributed as a checkpoint-restart module within some larger package.
Citations
More filters
TL;DR: In this paper , a new and detailed calculation of the neutron flux for energies above 50 MeV is presented, which has been done by using state-of-the-art Monte Carlo astroparticle techniques and including real atmospheric profiles at each one of the next 23 exascale supercomputing facilities.
Abstract: The age of exascale computing has arrived and the risks associated with neutron and other atmospheric radiation are becoming more critical as the computing power increases, hence, the expected Mean Time Between Failures will be reduced because of this radiation. In this work, a new and detailed calculation of the neutron flux for energies above 50 MeV is presented. This has been done by using state-of-the-art Monte Carlo astroparticle techniques and including real atmospheric profiles at each one of the next 23 exascale supercomputing facilities. Atmospheric impact in the flux and seasonal variations were observed and characterised, and the barometric coefficient for high-energy neutrons at each site was obtained. With these coefficients, potential risks of errors associated with the increase in the flux of energetic neutrons, such as the occurrence of single event upsets or transients, and the corresponding failure-in-time rates, can be anticipated just by using the atmospheric pressure before the assignation of resources to critical tasks at each exascale facility. For more clarity, examples about how the rate of failures is affected by the cosmic rays are included, so administrators will better anticipate which more or less restrictive actions could take for overcoming errors.
2 citations
TL;DR: Tools for optimizing the performance of parallel programs on multi-architectural distributed computing systems and an adaptive approach to the delta optimization of restore points are proposed for effective fault-tolerant simulation on distributed computing system.
Abstract: Tools for optimizing the performance of parallel programs on multi-architectural distributed computing systems are considered. A method for optimizing the embedding of parallel MPI-program into computing clusters with a hierarchical communication network structure is described. An adaptive approach to the delta optimization of restore points is proposed for effective fault-tolerant simulation on distributed computing systems.
2 citations
01 Jan 2011
TL;DR: In this article, a nivel de libreria de comunicaciones and otra a Nivel of protocolo de red, especificamente a NODE 1, are presented.
Abstract: Resumen. El aumento en tamano de los clusteres de computadores trae consigo un incremento en la tasa de fallos. En este trabajo se presentan dos propuestas de integracion de la arquitectura RADIC, una a nivel de libreria de comunicaciones y otra a nivel de protocolo de red, especificamente a nivel de sockets . Dado que MPI es un estandar que frente a fallos propone realizar una parada ( fail-stop) , RADIC se encarga de enmascarar los fallos para que la aplicacion termine, para ello utiliza un controlador distribuido que protege el computo utilizando estrategias de rollback-recovery . Resultados iniciales demuestran RADIC puede integrarse en diferentes capas del sistema para que actue de forma transparente, que la arquitectura propuesta escala correctamente con la aplicacion y que los overheads dependen de la configuracion del sistema y del comportamiento de la aplicacion. Ademas incluyendo nodos spare para recuperar procesos fallados evita la sobrecarga en nodos de computo y mantiene las prestaciones similares a las iniciales.
2 citations
01 Jan 2018
TL;DR: In this paper, the authors determine the factores that afectan el consumo energético de nodos de cómputo of un cluster homogéneo, al ejecutar operaciones de checkpoint and restart, sobre apliç caciones SPMD (Single Program Múltiple Data).
Abstract: R esum en El método de tolerancia a fallos mas usado actualmente en Cómputo de Altas Prestaciones es el de rollback-recovery mediante el uso de checkpoints. Éste, como cualquier otro método de tolerancia a fallos, agrega un consumo energético adicional al propio de la ejecución de la aplicación. El objetivo de este trabajo es determinar los factores que afectan el consumo energético de los nodos de cómputo de un cluster homogéneo, al ejecutar operaciones de checkpoint y restart, sobre apli caciones SPMD (Single Program Múltiple Data). Nos hemos enfocado en el estudio energético de nodos de cómputo, contemplando diferentes configuraciones de parámetros de hardware y software. Se estudió el efec to de los estados de rendimiento (estados P) y potencia (estados C) de los procesadores, el tamaño del problema de la aplicación, la configura ción del software de checkpoint utilizado (DM TCP), y del sistema de archivos distribuido (NFS). El análisis de los resultados permitió identi ficar oportunidades que permiten disminuir el consumo energético de las operaciones de checkpoint y restart.
2 citations
TL;DR: In this paper , a power-efficient version of local rollback is proposed to reduce power consumption for noncritical, blocked processes in MPI codes, using DVFS and clock modulation.
Abstract: In fault tolerance for parallel and distributed systems, message logging protocols have played a prominent role in the last three decades. Such protocols enable local rollback to provide recovery from fail-stop errors. Global rollback techniques can be straightforward to implement but at times lead to slower recovery than local rollback. Local rollback is more complicated but can offer faster recovery times. In this work, we study the power and energy efficiency implications of global and local rollback. We propose a power-efficient version of local rollback to reduce power consumption for non-critical, blocked processes, using Dynamic Voltage and Frequency Scaling (DVFS) and clock modulation (CM). Our results for 3 different MPI codes on 2 parallel systems show that power-efficient local rollback reduces CPU energy waste up to 50% during the recovery phase, compared to existing global and local rollback techniques, without introducing significant overheads. Furthermore, we show that savings manifest for all blocked processes, which grow linearly with the process count. We estimate that for settings with high recovery overheads the total energy waste of parallel codes is reduced with the proposed local rollback.
2 citations
References
More filters
01 May 2007
TL;DR: The IPython project as mentioned in this paper provides an enhanced interactive environment that includes, among other features, support for data visualization and facilities for distributed and parallel computation for interactive work and a comprehensive library on top of which more sophisticated systems can be built.
Abstract: Python offers basic facilities for interactive work and a comprehensive library on top of which more sophisticated systems can be built. The IPython project provides on enhanced interactive environment that includes, among other features, support for data visualization and facilities for distributed and parallel computation
3,355 citations
TL;DR: An algorithm by which a process in a distributed system determines a global state of the system during a computation, which helps to solve an important class of problems: stable property detection.
Abstract: This paper presents an algorithm by which a process in a distributed system determines a global state of the system during a computation. Many problems in distributed systems can be cast in terms of the problem of detecting global states. For instance, the global state detection algorithm helps to solve an important class of problems: stable property detection. A stable property is one that persists: once a stable property becomes true it remains true thereafter. Examples of stable properties are “computation has terminated,” “ the system is deadlocked” and “all tokens in a token ring have disappeared.” The stable property detection problem is that of devising algorithms to detect a given stable property. Global state detection can also be used for checkpointing.
2,738 citations
01 Jan 1996
TL;DR: The MPI Message Passing Interface (MPI) as discussed by the authors is a standard library for message passing that was defined by the MPI Forum, a broadly based group of parallel computer vendors, library writers, and applications specialists.
Abstract: MPI (Message Passing Interface) is a specification for a standard library for message passing that was defined by the MPI Forum, a broadly based group of parallel computer vendors, library writers, and applications specialists. Multiple implementations of MPI have been developed. In this paper, we describe MPICH, unique among existing implementations in its design goal of combining portability with high performance. We document its portability and performance and describe the architecture by which these features are simultaneously achieved. We also discuss the set of tools that accompany the free distribution of MPICH, which constitute the beginnings of a portable parallel programming environment. A project of this scope inevitably imparts lessons about parallel computing, the specification being followed, the current hardware and software environment for parallel computing, and project management; we describe those we have learned. Finally, we discuss future developments for MPICH, including those necessary to accommodate extensions to the MPI Standard now being contemplated by the MPI Forum.
2,065 citations
Proceedings Article•
16 Jan 1995TL;DR: In this paper, the authors describe a portable checkpointing tool for Unix that implements all applicable performance optimizations which are reported in the literature and also supports the incorporation of user directives into the creation of checkpoints.
Abstract: Checkpointing is a simple technique for rollback recovery: the state of an executing program is periodically saved to a disk file from which it can be recovered after a failure. While recent research has developed a collection of powerful techniques for minimizing the overhead of writing checkpoint files, checkpointing remains unavailable to most application developers. In this paper we describe libckpt, a portable checkpointing tool for Unix that implements all applicable performance optimizations which are reported in the literature. While libckpt can be used in a mode which is almost totally transparent to the programmer, it also supports the incorporation of user directives into the creation of checkpoints. This user-directed checkpointing is an innovation which is unique to our work.
670 citations
Proceedings Article•
10 Apr 2005TL;DR: This is the first system that can migrate unmodified applications on unmodified mainstream Intel x86-based operating system, including Microsoft Windows, Linux, Novell NetWare and others, to provide fast, transparent application migration.
Abstract: This paper describes the design and implementation of a system that uses virtual machine technology [1] to provide fast, transparent application migration. This is the first system that can migrate unmodified applications on unmodified mainstream Intel x86-based operating system, including Microsoft Windows, Linux, Novell NetWare and others. Neither the application nor any clients communicating with the application can tell that the application has been migrated. Experimental measurements show that for a variety of workloads, application downtime caused by migration is less than a second.
588 citations