Impact of over-decomposition on coordinated checkpoint/rollback protocol

in Euro-Par 2011: Parallel Processing Workshops (2011, August)

Fault tolerance and availability awareness in computational grids

in Fundamentals of Grid Computing: Theory, Algorithms and Technologies (2009)

Optimized Coordinated Checkpoint/Rollback Protocol using a Dataflow Graph Model

Presentation (2009, January 22)

Fault-tolerance protocols play an important role in today long runtime scienti\ufb01c parallel applications. The probability of a failure may be important due to the number of unreliable components ... [more ▼]

Fault-tolerance protocols play an important role in today long runtime scienti\ufb01c parallel applications. The probability of a failure may be important due to the number of unreliable components involved during an execution. We present our approach and preliminary results about a new checkpoint/rollback protocol based on a coordinated scheme. The application is described using a dataflow graph, which is an abstract representation of the execution. Thanks to this representation, the fault recovery in our protocol only requires a partial restart of other processes. Simulations on a domain decomposition application show that the amount of computations required to restart and the number of involved processes are reduced compared to the classical global rollback protocol. [less ▲]

IV Grid Plugtests: composing dedicated tools to run an application efficiently on Grid'5000

Presentation (2008, February 12)

Exploiting efficiently the resources of whole Grid'5000 with the same application requires to solve several issues: 1) resources reservation; 2) application's processes deployment; 3) application's tasks ... [more ▼]

Exploiting efficiently the resources of whole Grid'5000 with the same application requires to solve several issues: 1) resources reservation; 2) application's processes deployment; 3) application's tasks scheduling. For the IV Grid Plugtests, we used a dedicated tool for each issue to solve. The N-Queens contest rules imposed ProActive for the resources reservations (issue 1). Issue 2 was solved using TakTuk which allows to deploy a large set of remote nodes. Deployed nodes take part in the deployment using an adaptive algorithm that makes it very efficient. For the 3rd issue, we wrote our application with Athapascan API whose model is based on the concepts of tasks and shared data. The application is described as a data-flow graph using the Shared and Fork keywords. This high level abstraction of hardware gives us an efficient execution with the Kaapi runtime engine using a work-stealing scheduling algorithm to balance the workload between all the distributed processes. [less ▲]

Kaapi: A Thread Scheduling Runtime System for Data Flow Computations on Cluster of Multi-Processors

in PASCO '07 Proceedings of the 2007 international workshop on Parallel symbolic computation (2007, July)