graph_cluster_utils.alg.mem.didic
Class AlgMemPartDiDiC

java.lang.Object
  extended by graph_cluster_utils.alg.mem.AlgMem
      extended by graph_cluster_utils.alg.mem.didic.AlgMemPartDiDiC
All Implemented Interfaces:
Alg

public class AlgMemPartDiDiC
extends AlgMem

Inherits from AlgMem. Basic implementation of the DiDiC clustering/partitioning algorithm, computed on an in-memory graph. The unique aspect of this implementation is that is flushes changes to a partitioned Neo4j instance using PGraphDatabaseService rather than using the traditional GraphDatabaseService interface. SYNCHRONY: This implementation ensures a low level on synchrony. Nodes compute on the same time step at all times. Nodes compute on the same diffusion system (cluster/partition) and same FOS/T iteration most of the time, and very rarely on the same FOS/B iteration.

Since:
2010-04-01
Author:
Alex Averbuch

Constructor Summary
AlgMemPartDiDiC(java.lang.String databaseDir, Supervisor supervisor, graph_gen_utils.memory_graph.MemGraph memGraph)
           
 
Method Summary
 void start(Conf config)
          Run the clustering/partitioning algorithm
 
Methods inherited from class java.lang.Object
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Constructor Detail

AlgMemPartDiDiC

public AlgMemPartDiDiC(java.lang.String databaseDir,
                       Supervisor supervisor,
                       graph_gen_utils.memory_graph.MemGraph memGraph)
Method Detail

start

public void start(Conf config)
Description copied from interface: Alg
Run the clustering/partitioning algorithm

Parameters:
config - an implementation of Conf containing algorithm specific configuration parameters