Sponsored Content
Special Forums UNIX and Linux Applications Virtualization and Cloud Computing Dapper Dataflow Engine 0.92 (Default branch) Post 302226031 by Linux Bot on Monday 18th of August 2008 04:20:03 AM
Old 08-18-2008
Dapper Dataflow Engine 0.92 (Default branch)

Image Dapper, or "Distributed and Parallel Program Execution Runtime", is a tool for taming the complexities of developing for large-scale cloud and grid computing, enabling the user to create distributed computations from the essentials: the code that will execute, along with a dataflow graph description. It supports rich execution semantics, carefree deployment, a robust control protocol, modification of the dataflow graph at runtime, and an intuitive user interface. License: GNU Lesser General Public License (LGPL) Changes:
On the fly generation and aliasing of dataflow graph edges are now possible. The API has been simplified, and redundant interfaces have been done away with; at the same time, dataflow graphs are now robust to tampering from malicious users. The concept of execution domain has been introduced to control what executes where. The manual is now substantially complete, and has been updated with a bevy of examples and diagrams. The SourceForge mailing lists dapper-user and dapper-announce have been created.Image

More...
 

2 More Discussions You Might Find Interesting

1. Virtualization and Cloud Computing

Dapper Distributed Dataflow Engine 0.91 (Default branch)

Dapper, or "Distributed and Parallel Program Execution Runtime", is a tool for taming the complexities of developing for large-scale cloud and grid computing, enabling the user to create distributed computations from the essentials: the code that will execute, along with a dataflow graph... (0 Replies)
Discussion started by: Linux Bot
0 Replies

2. Virtualization and Cloud Computing

Dapper Dataflow Engine 0.95 (Default branch)

http://c.fsdn.com/fm/screenshots/69890_thumb.png Dapper, or "Distributed and Parallel Program Execution Runtime", is a tool for taming the complexities of developing for large-scale cloud and grid computing, enabling the user to create distributed computations from the essentials: the code that... (0 Replies)
Discussion started by: Linux Bot
0 Replies
GC(1)							      General Commands Manual							     GC(1)

NAME
gvgen - generate graphs SYNOPSIS
gvgen [ -d? ] [ -cn ] [ -Cx,y ] [ -g[f]x,y ] [ -G[f]x,y ] [ -hn ] [ -kn ] [ -bx,y ] [ -pn ] [ -sn ] [ -Sn ] [ -tn ] [ -Tx,y ] [ -wn ] [ -ooutfile ] DESCRIPTION
gvgen generates a variety of simple, regularly-structured abstract graphs. OPTIONS
The following options are supported: -c n Generate a cycle with n vertices and edges. -C x,y Generate an x by y cylinder. This will have x*y vertices and 2*x*y - y edges. -g [f]x,y Generate an x by y grid. If f is given, the grid is folded, with an edge attaching each pair of opposing corner vertices. This will have x*y vertices and 2*x*y - y - x edges if unfolded and 2*x*y - y - x + 2 edges if folded. -G [f]x,y Generate an x by y partial grid. If f is given, the grid is folded, with an edge attaching each pair of opposing corner vertices. This will have x*y vertices. -h n Generate a hypercube of degree n. This will have 2^n vertices and n*2^(n-1) edges. -k n Generate a complete graph on n vertices with n*(n-1)/2 edges. -b x,y Generate a complete x by y bipartite graph. This will have x+y vertices and x*y edges. -p n Generate a path on n vertices. This will have n-1 edges. -s n Generate a star on n vertices. This will have n-1 edges. -S n Generate a Sierpinski graph of order n. This will have 3*(3^(n-1) - 1)/2 vertices and 3^n edges. -t n Generate a binary tree of height n. This will have 2^n-1 vertices and 2^n-2 edges. -T x,y Generate an x by y torus. This will have x*y vertices and 2*x*y edges. -w n Generate a path on n vertices. This will have n-1 edges. -o outfile If specified, the generated graph is written into the file outfile. Otherwise, the graph is written to standard out. -d Make the generated graph directed. -? Print usage information. EXIT STATUS
gvgen exits with 0 on successful completion, and exits with 1 if given an ill-formed or incorrect flag, or if the specified output file could not be opened. AUTHOR
Emden R. Gansner <erg@research.att.com> SEE ALSO
gc(1), acyclic(1), gvpr(1), gvcolor(1), ccomps(1), sccmap(1), tred(1), libgraph(3) 27 March 2008 GC(1)
All times are GMT -4. The time now is 10:41 AM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy