[
https://issues.apache.org/jira/browse/GIRAPH-692?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13738352#comment-13738352
]
Armando Miraglia commented on GIRAPH-692:
-----------------------------------------
I have realized that I can correct the algorith to better behave when the
initiator has not outgoing edges.
Cheers.
> Add Bracha Toueg Deadlock Detection in the examples
> ---------------------------------------------------
>
> Key: GIRAPH-692
> URL: https://issues.apache.org/jira/browse/GIRAPH-692
> Project: Giraph
> Issue Type: Improvement
> Components: examples
> Affects Versions: 1.1.0
> Reporter: Armando Miraglia
> Priority: Minor
>
> Since I started working with Giraph I decided to implement a deadlock
> detection algorithm. For this reason I am implementing the Bracha-Toueg
> Deadlock Detection algorithm[1]
> The algorithm is a distributed asynchronous deadlock detection algorithm
> which is applied on a wait-for graph which is generated by taking a snapshot
> of the graph to be analysed.
> I am testing the first implementation which is available here:
> https://github.com/armax00/giraph/tree/trunk/giraph-examples/src/main/java/org/apache/giraph/examples
> The graphs I am using for testing are available here:
> https://github.com/armax00/giraph/tree/trunk/data/inputs
> I will provide a patch as soon as I am done with it.
> In the next version I will introduce the possibility to express N-out-of-M
> relationships among the edges.
> [1] http://link.springer.com/article/10.1007%2FBF01782773
--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators
For more information on JIRA, see: http://www.atlassian.com/software/jira
