A Fault-Tolerant Protocol for Resource Allocation in a Grid Dedicated to Genomic Applications

Hurfin, Michel; Narzul, Jean-Pierre Le; Pley, Julien; Parvédy, Philippe Raïpin

doi:10.1007/978-3-540-24669-5_148

Cited by 5 publications

(4 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These primitives allow respectively to create a new task, wait for the outcomes of some tasks previously launched and stop the execution of the specified elementary tasks. We have shown that this small set of primitives is well suited to design various genomic applications [2].…”

Section: A Fault-tolerant Grid System Based On Agreement Servicementioning

confidence: 99%

Design and Performance Evaluation of a Resource Allocation System Based on Agreement Services

Hurfin

Narzul²

2008

2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

Self Cite

View full text Add to dashboard Cite

Whatever the circumstances, a complete transparency and a quick response time are expected by the users of a Grid even when failures occur. To fulfill these two requirements, adaptive control mechanisms have to be proposed, on one hand to cope efficiently with the dynamic changes of the computing capacity of the Grid (even if these changes are unpredictable) and, on the other hand to distribute the tasks among the resources in an efficient way (dynamic load balancing). In a hierarchical Grid, both issues can be addressed using a common set of agreement services built on top of a consensus building block. The major aim of this paper is to investigate the benefits and the limits of this approach through some performance evaluations.

show abstract

Section: A Fault-tolerant Grid System Based On Agreement Servicementioning

confidence: 99%

Design and Performance Evaluation of a Resource Allocation System Based on Agreement Services

Hurfin

Narzul²

2008

2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

Self Cite

View full text Add to dashboard Cite

show abstract

“…For instance, this is the case when the protocol is executed over an open system whose communication is supported by wide-area channels. This is a common scenario for many applications, including the emerging grid middleware infra-structure (see for example the scheduler service of the PARADIS system [10]). In this scenario, if the coordinator of the first round is correct but runs slow (because either its processor or its communication channels -or both -are overloaded), the performance of the protocol may suffer [17].…”

Section: Raul Ceretta Nunesmentioning

confidence: 99%

Efficient and robust adaptive consensus services based on oracles

Sampaio¹,

Brasileiro²,

Nunes³

et al. 2005

J. Braz. Comp. Soc.

View full text Add to dashboard Cite

show abstract

“…As earlier mentioned, a possible consensus application is a distributed scheduler for grid environments, as the one proposed for the PARADIS system [10]. In this system a distributed scheduler is built with the support of local scheduler modules at each site of the grid.…”

Section: A Case Studymentioning

confidence: 99%