Mailing-List: contact dev-help@giraph.apache.org; run by ezmlm
Precedence: bulk
Reply-To: dev@giraph.apache.org
MIME-Version: 1.0
Date: Thu, 7 May 2015 18:35:50 +0200
Message-ID: 
 <CADyhzG2TmphCMZRFZce0xdcQ4OkCvOYWn9KvsVzUJnZfr0yHsw@mail.gmail.com>
Subject: [Request for review] Giraph implementation of algorithms in
 Graphalytics benchmark
From: =?UTF-8?Q?Mihai_Capot=C4=83?= <mihai@mihaic.ro>
To: dev@giraph.apache.org
Cc: Tim <tim.m.hegeman@gmail.com>, Claudio Martella <claudio.martella@vu.nl>
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: quoted-printable

Dear Giraph developers,

We are creating a new graph-processing benchmark at the Delft
University of Technology, called Graphalytics [1]. We plan to
distribute several algorithm implementations specific to Giraph
together with our benchmark [2], such as a breadth-first search
implementation [3].

We would be very interested in hearing from you about our Giraph code.
Our code is open source (Apache License, version 2.0) and we will
gladly accept patches or GitHub pull requests.

Regards,
Mihai Capot=C4=83, on behalf of the Graphalytics team

[1] http://graphalytics.ewi.tudelft.nl
[2] https://github.com/tudelft-atlarge/graphalytics-platforms-giraph
[3] https://github.com/tudelft-atlarge/graphalytics-platforms-giraph/blob/m=
aster/src/main/java/nl/tudelft/graphalytics/giraph/bfs/BreadthFirstSearchCo=
mputation.java