Diet: New Developments and Recent Results

Amar, Abdelkader; Bolze, Raphaël; Bouteiller, Aurélien; Chis, Andréea; Caniou, Yves; Caron, Eddy; Chouhan, Pushpinder Kaur; Mahec, Gaël Le; Dail, Holly; Depardon, Benjamin; Desprez, Frédéric; Su, Alan

doi:10.1007/978-3-540-72337-0_15

Cited by 5 publications

(2 citation statements)

References 28 publications

(23 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In DIET, which is a GridRPC-based middleware, a special agent called MADAG was implemented to handle workflow submissions [24]. However, the task graph was not automatically discovered and had to be explicitly specified in an XML file.…”

Section: Related Workmentioning

confidence: 99%

SmartGridRPC: The new RPC model for high performance Grid computing

Brady

Dongarra

Guidolin

et al. 2010

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYThe paper presents the SmartGridRPC model, an extension of the GridRPC model, which aims to achieve higher performance. The traditional GridRPC provides a programming model and API for mapping individual tasks of an application in a distributed Grid environment, which is based on the client-server model characterized by the star network topology. SmartGridRPC provides a programming model and API for mapping a group of tasks of an application in a distributed Grid environment, which is based on the fully connected network topology. The SmartGridRPC programming model and API and its performance advantages over the GridRPC model are outlined in this paper. In addition, experimental results using a real-world application are also presented.

show abstract

Section: Related Workmentioning

confidence: 99%

SmartGridRPC: The new RPC model for high performance Grid computing

Brady

Dongarra

Guidolin

et al. 2010

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…An overload or a failure of this node can involve a grid failure or a low global efficiency. To improve the scalability, the global knowledge can be divided or shared in several servers or in a hierarchy of servers as in Globus [11] or in DIET [1].…”

Section: Introductionmentioning

confidence: 99%

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

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