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

Concurrent Random Walks on Graphs

    XMLWordPrintableJSON

    Details

      Description

      In certain cases, running multiple random walks on the same graph may be desired (e.g., the centerpiece algorithm). The current implementation(s) for random walks on graphs are designed for a single random walk. Therefore, running multiple random walks can be done sequentially or by spawning multiple independent random walks, which can be inefficient and harder to manage within GIRAPH.

      The idea is to extend the basic Random Walk examples so that the vertices are aware that they participate in multiple random walks at the same time.

        Attachments

        1. ConcurrentRandomWalksWorkerContext.java
          9 kB
          George Valkanas
        2. ConcurrentRandomWalksWithRestartComputation.java
          5 kB
          George Valkanas
        3. ConcurrentRandomWalksVertexMasterCompute.java
          5 kB
          George Valkanas
        4. ConcurrentRandomWalksComputation.java
          11 kB
          George Valkanas
        5. ConcurrentPageRankComputation.java
          4 kB
          George Valkanas

          Activity

            People

            • Assignee:
              Unassigned
              Reporter:
              lebiathan George Valkanas
            • Votes:
              1 Vote for this issue
              Watchers:
              3 Start watching this issue

              Dates

              • Created:
                Updated: