Uploaded image for project: 'Giraph'
  1. Giraph
  2. GIRAPH-692

Add Bracha Toueg Deadlock Detection in the examples

    XMLWordPrintableJSON

    Details

    • Type: Improvement
    • Status: Resolved
    • Priority: Minor
    • Resolution: Fixed
    • Affects Version/s: 1.1.0
    • Fix Version/s: 1.1.0
    • Component/s: examples
    • Labels:
      None

      Description

      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

        Attachments

        1. GIRAPH-692.patch
          47 kB
          Armando Miraglia

          Activity

            People

            • Assignee:
              Unassigned
              Reporter:
              armax00 Armando Miraglia
            • Votes:
              0 Vote for this issue
              Watchers:
              4 Start watching this issue

              Dates

              • Created:
                Updated:
                Resolved: