Distributing the execution of a distributed algorithm over a network

Derbel, Bilel; Mosbah, Mohamed

doi:10.1109/iv.2003.1218029

Cited by 6 publications

(1 citation statement)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…ViSiDiA * (Visualization and Simulation of Distributed Algorithms) is a tool aiming at simulating and visualizing the execution of distributed algorithms (Bauderon et al, 2001;Derbel and Mosbah, 2003;Bauderon and Mosbah, 2003). ViSiDiA is used as an educational and research utility, and has been developped and validated by various students and researchers.…”

Section: The Visidia Plaftormmentioning

confidence: 99%

Fully-Distributed Debugging and Visualization of Distributed Systems in Anonymous Networks

Aguerre¹,

Morsellino²,

Mosbah³

2012

Proceedings of the International Conference on Computer Graphics Theory and Applications

View full text Add to dashboard Cite

Abstract:The debugging of distributed algorithms is a major challenge which greatly benefits from the help of an interactive and informative human-computer interface. In this paper we present ViSiDiA, a platform for the visualization, simulation and debugging of distributed algorithms. Our approach respects real-life constraints such as process anonymity and privacy, network synchronicity. We propose a new fully-distributed method for the debugging and monitoring of distributed systems, based on the computation of global states and global predicates from local information in anonymous and asynchronous networks. We show how the debug information can be visualized concurrently with the algorithm execution.

show abstract

Section: The Visidia Plaftormmentioning

confidence: 99%

Fully-Distributed Debugging and Visualization of Distributed Systems in Anonymous Networks

Aguerre¹,

Morsellino²,

Mosbah³

2012

Proceedings of the International Conference on Computer Graphics Theory and Applications

View full text Add to dashboard Cite

show abstract

Distributed Graph Traversals by Relabelling Systems with Applications

Derbel

Mosbah

2006

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

Graph traversals are in the basis of many distributed algorithms. In this paper, we use graph relabelling systems to encode two basic graph traversals which are the broadcast and the convergecast. This encoding allows us to derive formal, modular and simple encoding for many distributed graph algorithms. We illustrate this method by investigating the distributed computation of a breadthfirst spanning tree and the distributed computation of a minimum spanning tree. Our formalism allows to focus on the correctness of a distributed algorithm rather than on the implementation and the communication details.

show abstract

Distributed Computation of a Spanning Tree in a Dynamic Graph by Mobile Agents

Abbas

Mosbah

Zemmari

2006 IEEE International Conference on Engineering of Intelligent Systems

View full text Add to dashboard Cite

International audienceWe describe a distributed algorithm for computing spanning trees in dynamic networks by using mobile agents. Each agent uses a random walk to move in the network and to construct a spanning subtree for the nodes visited for the first time. Spanning subtrees are merged when agents enter in an already discovered area of the network. In this case, we clone the agent having higher color to capture and to annex the adjacent subtree. We discuss in this paper this operation of agent cloning and show that it is useful to construct an efficient distributed algorithm for computing a spanning tree. The correction and the termination detection are also investigated. We give an implementation and a few experimental results which show the practical efficiency of the metho

show abstract

Distributing the execution of a distributed algorithm over a network

Cited by 6 publications

References 14 publications

Fully-Distributed Debugging and Visualization of Distributed Systems in Anonymous Networks

Fully-Distributed Debugging and Visualization of Distributed Systems in Anonymous Networks

Distributed Graph Traversals by Relabelling Systems with Applications

Distributed Computation of a Spanning Tree in a Dynamic Graph by Mobile Agents

Contact Info

Product

Resources

About