OATAO - Open Archive Toulouse Archive Ouverte Open Access Week

A Graph Transformation-based Approach for the Validation of Checkpointing Algorithms in Distributed Systems

Khlif, Houda and Hadj Kacem, Hatem and Pomares Hernandez, Saùl E. and Eichler, Cédric and Hadj Kacem, Ahmed and Calixto Simon, Alberto A Graph Transformation-based Approach for the Validation of Checkpointing Algorithms in Distributed Systems. (2014) In: 23rd IEEE International Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETICE 2014), 23 June 2014 - 25 June 2014 (Parme, Italy).

[img]
Preview
(Document in English)

PDF (Author's version) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
552kB

Official URL: http://dx.doi.org/10.1109/WETICE.2014.23

Abstract

Autonomic Computing Systems are oriented to pre-vente the human intervention and to enable distributed systems to manage themselves. One of their challenges is the efficient monitoring at runtime oriented to collect information from which the system can automatically repair itself in case of failure. Quasi-Synchronous Checkpointing is a well-known technique, which allows processes to recover in spite of failures. Based on this technique, several checkpointing algorithms have been developed. According to the checkpoint properties detected and ensured, they are classified into: Strictly Z-Path Free (SZPF), Z-Path Free (ZPF) and Z-Cycle Free (ZCF). In the literature, the simulation has been the method adopted for the performance evaluation of checkpointing algorithms. However, few works have been designed to validate their correctness. In this paper, we propose a validation approach based on graph transformation oriented to automatically detect the previous mentioned checkpointing properties. To achieve this, we take the vector clocks resulting from the algorithm execution, and we model it into a causal graph. Then, we design and use transformation rules oriented to verify if in such a causal graph, the algorithm is exempt from non desirable patterns, such as Z-paths or Z-cycles, according to the case.

Item Type:Conference or Workshop Item (Paper)
Additional Information:Thanks to IEEE editor. The definitive version is available at http://ieeexplore.ieee.org This papers appears in XXX. Electronic ISBN: 978-1-4799-4249-7 The original PDF of the article can be found at: Electronic ISBN: 978-1-4799-4249-7 http://ieeexplore.ieee.org/document/6927027/ Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Audience (conference):International conference proceedings
Uncontrolled Keywords:
Institution:French research institutions > Centre National de la Recherche Scientifique - CNRS (FRANCE)
Université de Toulouse > Institut National Polytechnique de Toulouse - INPT (FRANCE)
Université de Toulouse > Université Toulouse III - Paul Sabatier - UPS (FRANCE)
Université de Toulouse > Université Toulouse - Jean Jaurès - UT2J (FRANCE)
Université de Toulouse > Université Toulouse 1 Capitole - UT1 (FRANCE)
Other partners > Instituto Nacional de Astrofísica, Óptica y Electrónica - INAOE (MEXICO)
Other partners > Universidad del Papaloapan - UNPA (MEXICO)
Other partners > Université de Sfax (TUNISIA)
Laboratory name:
Statistics:download
Deposited By: IRIT IRIT
Deposited On:25 Oct 2016 13:33

Repository Staff Only: item control page