- All Implemented Interfaces:
- AggregatorUsage, GiraphConfigurationSettable<org.apache.hadoop.io.LongWritable,BrachaTouegDeadlockVertexValue,org.apache.hadoop.io.LongWritable>, ImmutableClassesGiraphConfigurable<org.apache.hadoop.io.LongWritable,BrachaTouegDeadlockVertexValue,org.apache.hadoop.io.LongWritable>, TypesHolder<org.apache.hadoop.io.LongWritable,BrachaTouegDeadlockVertexValue,org.apache.hadoop.io.LongWritable,BrachaTouegDeadlockMessage,BrachaTouegDeadlockMessage>, Computation<org.apache.hadoop.io.LongWritable,BrachaTouegDeadlockVertexValue,org.apache.hadoop.io.LongWritable,BrachaTouegDeadlockMessage,BrachaTouegDeadlockMessage>, WorkerAggregatorUsage, WorkerBroadcastUsage, WorkerGlobalCommUsage, WorkerIndexUsage<org.apache.hadoop.io.LongWritable>, WorkerReduceUsage
public class BrachaTouegDeadlockComputation
extends BasicComputation<org.apache.hadoop.io.LongWritable,BrachaTouegDeadlockVertexValue,org.apache.hadoop.io.LongWritable,BrachaTouegDeadlockMessage>
This code demonstrates the Bracha Toueg deadlock detection algorithm.
The Bracha Toueg algorithm is a distributed, asynchronous, centralized
algorithm for deadlock detection. The algorithm is executed on a snapshot of
a undirected graph which depicts the corresponding wait-for-graph.
Consequently the algorithm works on directed graphs but assumes
the possibility to communicate in both ways on all the edges.
This is an adaptation of the standard algorithm for Giraph/Pregel system.
Since the value of the vertex is dumped during checkpointing, the algorithm
keeps all the state of the vertex in the value.