GraphChi-Java 0.25

SPONSORED LINKS

    Specification

  • Version: 0.25
  • File size: 1.2 KB
  • File name: graphchi
  • Last update:
  • Platform: Mac OS X
  • License: Apache
  • Price:FREE
  • Company: Aapo Kyrola (View more)

GraphChi-Java 0.25 Download Publisher Review:




Whats new in version 0.25:
• Contains new random walk algorithm "drunkardmob". See apps/randomwalks/PersonalizedPagerank for an example.
• Several bug fixes as well.


Publisher review:
GraphChi-Java is a the Java version of the powerful graph computation engine which can process very large graphs from the disk.

GraphChi is a free and open-source project that allows you to process computation on very large graphs by using a novel Parallel Sliding Windows -algorithm.

The graph will be split into P shards, each containing roughly the same number of edges in sorted order.

In other words, GraphChi is able to run very large graph computations on just a single machine, by using a novel algorithm for processing the graph from disk (SSD or hard drive).

The applications for GraphChi are written in the vertex-centric model, proposed by GraphLab and Google's Pregel.

Furthermore, GraphChi runs vertex-centric programs asynchronously (i.e changes written to edges are immediately visible to subsequent computation), and in parallel.

In addition, GraphChi supports streaming graph updates and removal of edges from the graph. Section 'Performance' contains some examples of applications implemented for GraphChi and their running times on GraphChi.
Requirements:
  • Java


Operating system:
Mac OS X

Latest news

222

222

22

Posted on: 18 Jul 2023 22:27 by A. Brown

111

111

111

Posted on: 18 Jul 2023 22:24 by A. Brown

The permanently active Push system offered by the new Google Chrome 42

The permanently active Push system offered by the new Google Chrome 42

Hacked By !Sc-sT

Posted on: 17 Mar 2015 07:57 by A. Brown

SPREAD THE WORD

User Rating


Rating: 2.2 out of 5
Based on 13 ratings. 13 user reviews.

  • Currently 2.15 out of 5
  • 1
  • 2
  • 3
  • 4
  • 5