elaine 0.0.3

data/spec/distributed_page_rank_vertex.rb

@@ -0,0 +1,23 @@
+
+require 'elaine/distributed'
+class DistributedPageRankVertex < Elaine::Distributed::Vertex
+  def compute
+    # puts "Working on supserstep: #{superstep}"
+    if superstep >= 1
+      # sum = messages.inject(0) {|total,msg| total += msg; total }
+      # sum = messages.reduce(0, :+)
+      sum = messages.reduce(0) do |total, msg|
+        raise "Got an out-of-step message! current superstep: #{superstep}, message from superstep: #{msg[:superstep]}" if msg[:superstep] != (superstep - 1)
+        total += msg[:value]
+
+      end
+      @value = (0.15 / 3) + 0.85 * sum
+    end
+
+    if superstep < 30
+      deliver_to_all_neighbors({value: @value / neighbors.size, superstep: superstep})
+    else
+      halt
+    end
+  end
+end

data/spec/distributed_triad_census_vertex.rb

@@ -0,0 +1,41 @@
+
+require 'elaine/distributed'
+class DistributedTriadCensusVertex < Elaine::Distributed::Vertex
+  def compute
+    # puts "Working on supserstep: #{superstep}"
+    if superstep == 1
+      deliver_to_all_neighbors({source: id; neighborhood: @outedges})
+    elsif superstep == 2
+      # sum = messages.inject(0) {|total,msg| total += msg; total }
+      # sum = messages.reduce(0, :+)
+      @value = {type2: 0, type3: 0 }
+
+      u = id.to_s.plit("_")[1].to_i 
+      messages.each(0) do |msg|
+        # raise "Got an out-of-step message! current superstep: #{superstep}, message from superstep: #{msg[:superstep]}" if msg[:superstep] != (superstep - 1)  
+        v = msg[:source].to_s.split("_")[1].to_i
+        if u < v
+          
+          msg[:neighborhood].each do |node_w|
+            w = node_w.to_s.split("_")[1].to_i
+            if v < w
+              num_edges = 2
+              if @outedges.include? node_w
+                num_edges += 1
+              end
+
+              @value[:type2] += 1 if num_edges == 2
+              @value[:type3] += 1 if num_edges == 3 
+
+            end
+          end
+        end
+      end
+    
+    else
+      vote_to_stop
+    end
+
+    
+  end
+end

data/spec/helper.rb

@@ -0,0 +1,10 @@
+require 'elaine'
+
+include Elaine
+
+class AddVertex < Vertex
+  def compute
+    @value += 1
+    halt if @value >= 5
+  end
+end

data/spec/test_add_vertex.rb

@@ -0,0 +1,7 @@
+require 'elaine/distributed'
+class DistributedAddVertex < Elaine::Distributed::Vertex
+  def compute
+    @value += 1
+    halt if @value >= 5
+  end
+end

data/spec/test_coordinator_node.rb

@@ -0,0 +1,12 @@
+require 'elaine'
+require 'elaine/distributed'
+require 'dcell'
+# require 'test_add_vertex'
+
+load File.expand_path("../test_add_vertex.rb", __FILE__)
+load File.expand_path("../distributed_page_rank_vertex.rb", __FILE__)
+
+DCell.start id: "test.elaine.coordinator", addr: "tcp://127.0.0.1:8090"
+
+Elaine::Distributed::Coordinator.supervise_as :coordinator
+sleep

data/spec/test_worker_node1.rb

@@ -0,0 +1,12 @@
+require 'elaine'
+require 'elaine/distributed'
+require 'dcell'
+
+load File.expand_path("../test_add_vertex.rb", __FILE__)
+load File.expand_path("../distributed_page_rank_vertex.rb", __FILE__)
+
+DCell.start id: "test.elaine.worker1", addr: "tcp://127.0.0.1:8091"
+
+Elaine::Distributed::Worker.supervise_as :worker, coordinator_node: "test.elaine.coordinator"
+Elaine::Distributed::PostOffice.supervise_as :postoffice
+sleep

data/spec/test_worker_node2.rb

@@ -0,0 +1,12 @@
+require 'elaine'
+require 'elaine/distributed'
+require 'dcell'
+
+load File.expand_path("../test_add_vertex.rb", __FILE__)
+load File.expand_path("../distributed_page_rank_vertex.rb", __FILE__)
+
+DCell.start id: "test.elaine.worker2", addr: "tcp://127.0.0.1:8092"
+
+Elaine::Distributed::Worker.supervise_as :worker, coordinator_node: "test.elaine.coordinator"
+Elaine::Distributed::PostOffice.supervise_as :postoffice
+sleep

data/spec/vertex_spec.rb

@@ -0,0 +1,56 @@
+require 'helper'
+
+describe Vertex do
+  it 'should create a vertex with id, value, and edges' do
+    lambda { Vertex.new(:a, 10, :b) }.should_not raise_error
+    lambda { Vertex.new(:a, 10, :b, :c) }.should_not raise_error
+  end
+
+  let(:v) { Vertex.new(:a, 10, :b, :c) }
+
+  it 'should report new vertex as active' do
+    v.active?.should be_true
+
+    v.halt
+    v.active?.should be_false
+  end
+
+  it 'should contain a modifiable value' do
+    v.value = 20
+    v.value.should == 20
+  end
+
+  it 'should keep track of the current superstep' do
+    v.superstep.should == 0
+    v.step
+    v.superstep.should == 1
+  end
+
+  it 'should allow iterating over out-edges' do
+    v.edges.size.should == 2
+    v.edges.each {|e| [:b, :c].should include e }
+  end
+
+  it 'should allow arbitrary type for edge' do
+    lambda do
+      Vertex.new(:a, 10, {id: 1, weight:10}, {id: 2, weight:20})
+    end.should_not raise_error
+  end
+
+  it 'should allow a user defined compute' do
+    class V < Vertex
+      def compute; @value = 20; end
+    end
+
+    v = V.new(:a, 10)
+    v.compute
+    v.value.should == 20
+  end
+
+  it 'should have an inbox for incoming messages' do
+    v.messages.size.should == 0
+    v.messages = [:a, :b]
+    v.messages.size.should == 2
+  end
+
+end

data/spec/worker_spec.rb

@@ -0,0 +1,61 @@
+require 'helper'
+
+describe Worker do
+
+  let(:graph) do
+    [
+      AddVertex.new(:igvita,     1,  :wikipedia),
+      AddVertex.new(:wikipedia,  2,  :google),
+      AddVertex.new(:google,     1,  :wikipedia)
+    ]
+  end
+
+  let(:worker) do
+    Worker.new(graph)
+  end
+
+  it 'should accept non-zero number of nodes' do
+    lambda { Worker.new([]) }.should raise_error
+  end
+
+  it 'should partition graphs with variable worker sizes' do
+    graph = [
+      Vertex.new(:igvita,     1,  :wikipedia),
+      Vertex.new(:wikipedia,  2,  :google),
+      Vertex.new(:google,     1,  :wikipedia)
+    ]
+
+    c = Coordinator.new(graph)
+    c.workers.size.should == 1
+
+    c = Coordinator.new(graph, partitions: 2)
+    c.workers.size.should == 2
+  end
+
+  it 'should execute an async superstep' do
+    # TODO: simulate async message delivery to worker by returning
+    # a thread per message
+    worker.superstep.should be_an_instance_of Thread
+  end
+
+  it 'should perform single iteration on the graph' do
+    # TODO: reuse a threadpool within worker for each partition
+    worker.superstep.join
+    worker.vertices.first.value.should == 2
+  end
+
+  it 'should return the number of active vertices for next superstep' do
+    worker.superstep.join
+    worker.active.should > 0
+  end
+
+  it 'should deliver messages to vertices at beginning of each superstep' do
+    PostOffice.instance.deliver(:igvita, 'hello')
+    worker.superstep.join
+
+    ig = worker.vertices.find {|v| v.id == :igvita }
+    ig.messages.size.should == 1
+    ig.messages.first.should == 'hello'
+  end
+
+end

metadata

@@ -0,0 +1,173 @@
+--- !ruby/object:Gem::Specification
+name: elaine
+version: !ruby/object:Gem::Version
+  version: 0.0.3
+platform: ruby
+authors:
+- Jeremy Blackburn
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2013-11-23 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: pry
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: celluloid-io
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: dcell
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: thor
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: activesupport
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+description: Distribtuted implementation of Google's Pregel framework for large-scale
+  graph processing. Forked from http://github.com/igrigorik/pregel
+email:
+- jeremy.blackburn@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- .gitignore
+- .ruby-version
+- Gemfile
+- README.md
+- Rakefile
+- autotest/discover.rb
+- elaine.gemspec
+- examples/.gitignore
+- examples/erdos-renyi-N_1000-E_0.2.egonets
+- lib/elaine.rb
+- lib/elaine/coordinator.rb
+- lib/elaine/distributed.rb
+- lib/elaine/distributed/coordinator.rb
+- lib/elaine/distributed/post_office.rb
+- lib/elaine/distributed/vertex.rb
+- lib/elaine/distributed/worker.rb
+- lib/elaine/version.rb
+- lib/elaine/vertex.rb
+- lib/elaine/worker.rb
+- spec/coordinator_spec.rb
+- spec/distributed_coordinator_spec.rb
+- spec/distributed_helper.rb
+- spec/distributed_page_rank_vertex.rb
+- spec/distributed_triad_census_vertex.rb
+- spec/helper.rb
+- spec/test_add_vertex.rb
+- spec/test_coordinator_node.rb
+- spec/test_worker_node1.rb
+- spec/test_worker_node2.rb
+- spec/vertex_spec.rb
+- spec/worker_spec.rb
+homepage: http://bitbucket.org/worst/elaine
+licenses: []
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: elaine
+rubygems_version: 2.0.6
+signing_key: 
+specification_version: 4
+summary: Distribtuted implementation of Google's Pregel framework for large-scale
+  graph processing. Forked from http://github.com/igrigorik/pregel
+test_files:
+- spec/coordinator_spec.rb
+- spec/distributed_coordinator_spec.rb
+- spec/distributed_helper.rb
+- spec/distributed_page_rank_vertex.rb
+- spec/distributed_triad_census_vertex.rb
+- spec/helper.rb
+- spec/test_add_vertex.rb
+- spec/test_coordinator_node.rb
+- spec/test_worker_node1.rb
+- spec/test_worker_node2.rb
+- spec/vertex_spec.rb
+- spec/worker_spec.rb
+has_rdoc: