Fully Distributed Active and Passive Task Management for Grid Computing

Bui, Alain; Flauzac, Olivier; Rabat, Cyril

doi:10.1109/ispdc.2007.22

Cited by 1 publication

(5 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These solutions are fully distributed and are resilient to node failures. We present some experimental results and we observe a better efficiency than the active method presented in [4]. These new methods produce more messages but they reduce significantly the number of replicated tasks: it reduces the useless load of grid nodes.…”

Section: Resultsmentioning

confidence: 79%

“…In the following, we focus on the improvement of the active method. Indeed, we show in [4], that this method has a better efficiency than the passive method.…”

Section: Introductionmentioning

confidence: 76%

“…We plain to automatize these parameters to take into account others grid parameters as the bandwidth of the network or the actual load of the system. Another solution is to exploit the hybrid method proposed in [4] coupled with the diffusion methods. When the ratio between the number of nodes and the number of tasks is low, we may reduce the replicated tasks.…”

Section: Discussionmentioning

confidence: 99%

“…We propose three solutions based on the active method described in [4]. A token circulates at random in the network and updates the local tasks states sets of nodes.…”

Section: Diffusion Based Task Managementmentioning

confidence: 99%

“…To avoid the maintenance of a virtual structure, we proposed fully distributed methods based on a random walk. In [4] we propose a task man-agement: the tasks parameters are sent to nodes and the tasks states are updated thanks to the circulation of a token. We proposed two tasks assignment methods called passive and active.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Fully Distributed and Fault Tolerant Task Management Based on Diffusions

Bui

Flauzac

Rabat

2009

2009 17th Euromicro International Conference on Parallel, Distributed and Network-Based Processing

Self Cite

View full text Add to dashboard Cite

The task management is a critical component for the computational grids. The aim is to assign tasks on nodes according to a global scheduling policy and a view of local resources of nodes. A peer-topeer approach for the task management involves a better scalability for the grid and a higher fault tolerance. But some mechanisms have to be proposed to avoid the computation of replicated tasks that can reduce the efficiency and increase the load of nodes. In the same way, these mechanisms have to limit the number of exchanged messages to avoid the overload of the network.In [4], we have proposed two methods for the task management called active and passive. These methods are based on a random walk: they are fully distributed and fault tolerant. Each node owns a local tasks states set updated thanks to a random walk and each node is in charge of the local assignment. Here, we propose three methods to improve the efficiency of the active method. These new methods are based on a circulating word. The nodes local tasks states sets are updated thanks to periodical diffusions along trees built from the circulating word. Particularly, we show that these methods increase the efficiency of the active method: they produce less replicated tasks. These three methods are also fully distributed and fault tolerant. On the other way, the circulating word can be exploited for other applications like the resources management or the nodes synchronization.

show abstract

Section: Resultsmentioning

confidence: 79%

“…In the following, we focus on the improvement of the active method. Indeed, we show in [4], that this method has a better efficiency than the passive method.…”

Section: Introductionmentioning

confidence: 76%

Section: Discussionmentioning

confidence: 99%

“…We propose three solutions based on the active method described in [4]. A token circulates at random in the network and updates the local tasks states sets of nodes.…”

Section: Diffusion Based Task Managementmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations