Rocha–Thatte cycle detection algorithm

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Rocha–Thatte algorithm[1] is a distributed algorithm in graph theory for detecting cycles on large-scale directed graphs based on the bulk synchronous message passing abstraction. This algorithm for detecting cycles by message passing is suitable to be implemented in distributed graph processing systems, and it is also suitable for implementations in systems for disk-based computations, such as the GraphChi,[2] where the computation is mainly based on secondary memory. Disk-based computations are necessary when we have a single computer for processing large-scale graphs, and the computation exceeds the primary memory capacity.

Overview[edit]

The Rocha–Thatte algorithm is a general algorithm for detecting cycles in a directed graph by message passing among its vertices, based on the bulk synchronous message passing abstraction. This is a vertex-centric approach in which the vertices of the graph work together for detecting cycles. The bulk synchronous parallel model consists of a sequence of iterations, in each of which a vertex can receive messages sent by other vertices in the previous iteration, and send messages to other vertices.

In each pass, each active vertex of sends a set of sequences of vertices to its out-neighbours as described next. In the first pass, each vertex sends the message to all its out-neighbours. In subsequent iterations, each active vertex appends to each sequence it received in the previous iteration. It then sends all the updated sequences to its out-neighbours. If has not received any message in the previous iteration, then deactivates itself. The algorithm terminates when all the vertices have been deactivated.

For a sequence received by vertex , the appended sequence is not forwarded in two cases: (i) if , then has detected a cycle, which is reported; (ii) if for some , then has detected a sequence that contains the cycle ; in this case, the sequence is discarded, since the cycle must have been detected in an earlier iteration; to be precise, this cycle must have been detected in iteration . Every cycle is detected by all to in the same iteration; it is reported by the vertex .

The figure below presents an example of the execution of the algorithm. In iteration , all the three vertices detect the cycle . The algorithm ensures that the cycle is reported only once by emitting the detected cycle only from the vertex with the least identifier value in the ordered sequence, which is the vertex 2 in the example.[1]

An example of the execution of the algorithm for detecting cycles by message passing.

The total number of iterations of the algorithm is the number of vertices in the longest path in the graph, plus a few more steps for deactivating the final vertices. During the analysis of the total number of iterations, we ignore the few extra iterations needed for deactivating the final vertices and detecting the end of the computation, since it is iterations. In practice, the actual number of these final few iterations depends on the framework being used to implement the algorithm.[1]

Experimental Performance[edit]

Simulations[3] show that the Rocha-Thatte algorithm has a smaller communication overhead than a distributed version of depth-first search, regarding both the number of messages and the total number of bits sent. Specifically, the distributed version of DFS may require up to one order of magnitude more messages exchanged than the Rocha-Thatte algorithm.

References[edit]

  1. ^ a b c Rocha, Rodrigo Caetano; Thatte, Bhalchandra (2015), Distributed cycle detection in large-scale sparse graphs (PDF), Simpósio Brasileiro de Pesquisa Operacional (SBPO) 
  2. ^ Kyrola; Blelloch; Guestrin (2012), GraphChi: Large-scale graph computation on just a PC 
  3. ^ Oliva, Gabriele; Setola, Roberto; Glielmo, Luigi; Hadjicostis, Christoforos (2016), Distributed Cycle Detection and Removal, IEEE Transactions on Control of Network Systems