[ 
https://issues.apache.org/jira/browse/GIRAPH-824?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
 ]

George Valkanas updated GIRAPH-824:
-----------------------------------

    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.

  was:
In certain cases, running multiple random walks on the same graph may be 
desired. The current implementation(s) for random walks on graphs, are designed 
for a single random walk.

Implemented the more general case, where each node maintains and propagates 
data for all the random walks that run concurrently.


> Concurrent Random Walks on Graphs
> ---------------------------------
>
>                 Key: GIRAPH-824
>                 URL: https://issues.apache.org/jira/browse/GIRAPH-824
>             Project: Giraph
>          Issue Type: New Feature
>          Components: examples
>    Affects Versions: 1.1.0
>            Reporter: George Valkanas
>              Labels: examples, graph, multiple, randomwalk
>         Attachments: ConcurrentPageRankComputation.java, 
> ConcurrentRandomWalksComputation.java, 
> ConcurrentRandomWalksVertexMasterCompute.java, 
> ConcurrentRandomWalksWithRestartComputation.java, 
> ConcurrentRandomWalksWorkerContext.java
>
>
> 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.



--
This message was sent by Atlassian JIRA
(v6.1.5#6160)

Reply via email to