Return-Path: X-Original-To: apmail-flink-issues-archive@minotaur.apache.org Delivered-To: apmail-flink-issues-archive@minotaur.apache.org Received: from mail.apache.org (hermes.apache.org [140.211.11.3]) by minotaur.apache.org (Postfix) with SMTP id 4B0A2193D2 for ; Thu, 17 Mar 2016 00:55:34 +0000 (UTC) Received: (qmail 84388 invoked by uid 500); 17 Mar 2016 00:55:33 -0000 Delivered-To: apmail-flink-issues-archive@flink.apache.org Received: (qmail 84293 invoked by uid 500); 17 Mar 2016 00:55:33 -0000 Mailing-List: contact issues-help@flink.apache.org; run by ezmlm Precedence: bulk List-Help: List-Unsubscribe: List-Post: List-Id: Reply-To: dev@flink.apache.org Delivered-To: mailing list issues@flink.apache.org Received: (qmail 84269 invoked by uid 99); 17 Mar 2016 00:55:33 -0000 Received: from arcas.apache.org (HELO arcas) (140.211.11.28) by apache.org (qpsmtpd/0.29) with ESMTP; Thu, 17 Mar 2016 00:55:33 +0000 Received: from arcas.apache.org (localhost [127.0.0.1]) by arcas (Postfix) with ESMTP id 7D3D52C1F61 for ; Thu, 17 Mar 2016 00:55:33 +0000 (UTC) Date: Thu, 17 Mar 2016 00:55:33 +0000 (UTC) From: "ASF GitHub Bot (JIRA)" To: issues@flink.apache.org Message-ID: In-Reply-To: References: Subject: [jira] [Commented] (FLINK-2909) Gelly Graph Generators MIME-Version: 1.0 Content-Type: text/plain; charset=utf-8 Content-Transfer-Encoding: quoted-printable X-JIRA-FingerPrint: 30527f35849b9dde25b450d4833f0394 [ https://issues.apache.org/jira/browse/FLINK-2909?page=3Dcom.atlassian= .jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=3D1519= 8513#comment-15198513 ]=20 ASF GitHub Bot commented on FLINK-2909: --------------------------------------- GitHub user greghogan opened a pull request: https://github.com/apache/flink/pull/1807 [FLINK-2909] [Gelly] Graph generators Initial set of scale-free graph generators: - Complete graph - Cycle graph - Empty graph - Grid graph - Hypercube graph - Path graph - RMat graph - Singleton edge graph - Star graph You can merge this pull request into a Git repository by running: $ git pull https://github.com/greghogan/flink 2909_gelly_graph_generato= rs Alternatively you can review and apply these changes as the patch at: https://github.com/apache/flink/pull/1807.patch To close this pull request, make a commit to your master/trunk branch with (at least) the following in the commit message: This closes #1807 =20 ---- commit 4e6f552ae55c670c75541c133540193647ad4d4d Author: Greg Hogan Date: 2016-03-15T20:57:37Z [FLINK-3589] Allow setting Operator parallelism to default value =20 This is a temporary fix in place of [FLINK-3589]. commit 8a96fbf9193df6239586691e2196927a8c5f43b5 Author: Greg Hogan Date: 2016-03-15T20:59:02Z [FLINK-2909] [Gelly] Graph Generators =20 Initial set of scale-free graph generators: - Complete graph - Cycle graph - Empty graph - Grid graph - Hypercube graph - Path graph - RMat graph - Singleton edge graph - Star graph ---- > Gelly Graph Generators > ---------------------- > > Key: FLINK-2909 > URL: https://issues.apache.org/jira/browse/FLINK-2909 > Project: Flink > Issue Type: New Feature > Components: Gelly > Affects Versions: 1.0.0 > Reporter: Greg Hogan > Assignee: Greg Hogan > > Include a selection of graph generators in Gelly. Generated graphs will b= e useful for performing scalability, stress, and regression testing as well= as benchmarking and comparing algorithms, for both Flink users and develop= ers. Generated data is infinitely scalable yet described by a few simple pa= rameters and can often substitute for user data or sharing large files when= reporting issues. > There are at multiple categories of graphs as documented by [NetworkX|htt= ps://networkx.github.io/documentation/latest/reference/generators.html] and= elsewhere. > Graphs may be a well-defined, i.e. the [Chv=C3=A1tal graph|https://en.wik= ipedia.org/wiki/Chv%C3%A1tal_graph]. These may be sufficiently small to pop= ulate locally. > Graphs may be scalable, i.e. complete and star graphs. These should use F= link's distributed parallelism. > Graphs may be stochastic, i.e. [RMat graphs|http://snap.stanford.edu/clas= s/cs224w-readings/chakrabarti04rmat.pdf] . A key consideration is that the = graphs should source randomness from a seedable PRNG and generate the same = Graph regardless of parallelism. -- This message was sent by Atlassian JIRA (v6.3.4#6332)