Using data flow graph to certificate parallel applications


Abstract in English

In this research, We introduce two probabilistic mechanisms to certificate parallel applications on distribute architecture supposing that there are no oracles on which we depend on certification, in addition to introducing cost model of two mechanisms and compare them. In this research, we are interested in parallel applications, which are represented by data-flow graph that is built dynamically during the execution and which are executed in a wide distributed heterogeneous and dynamic environment and these applications use the principle of work stealing to distribute the tasks among the processors.

References used

DABROWSKI Ch, 2009- Reliability in grid computing systems, National Institute of Standards and Technology, 100 Bureau Drive, Stop 8970 Gaithersburg, MD 20899-8970, U.S.A, Vol.21.8, Pages 927-959
GAUTIER T, JAFAR S, KRINGS AW, & ROCH J-L, 2005- Theft-Induced Checkpointing for Reconfigurable Dataflow Applications, IEEE, vol 16, 6pp.-6
GHAZAL R, & JAFAR S, 2016- A checkpoint/ recovery Model based on work stealing for grid application, Albaath Magazin, vol 38, pp 71-86

Download