Abstract : Failure is an ordinary characteristic of large-scale distributed environments. Resubmission is a general strategy employed to cope with failures in grids. Here, we analytically and experimentally study resubmission in the case of random brokering (jobs are dispatched to a computing elements with a probability proportional to its computing power). We compare two cases when jobs are resubmitted to the broker or to the computing element. Results show that resubmit to the broker is a better strategy. Our approach is different from most existing race-based one as it is a bottom-up one: we start from a simple model of a grid and derive its characteristics.
Type de document :
Communication dans un congrès
Seventh International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks - heteroPar'09, Aug 2009, Delft, Netherlands. 2009
https://hal.inria.fr/inria-00430918
Contributeur : Emmanuel Jeannot
<>
Soumis le : mardi 10 novembre 2009 - 11:58:06
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48
Vandy Berten, Emmanuel Jeannot. Modeling Resubmission in Unreliable Grids: the Bottom-Up Approach. Seventh International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks - heteroPar'09, Aug 2009, Delft, Netherlands. 2009. 〈inria-00430918〉
