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
page_util_flow(n)					      Parser generator tools						 page_util_flow(n)

__________________________________________________________________________________________________________________________________________________

NAME
page_util_flow - page dataflow/treewalker utility SYNOPSIS
package require page::util::flow ?0.1? package require snit ::page::util::flow start flowvar nodevar script flow visit node flow visitl nodelist flow visita node... _________________________________________________________________ DESCRIPTION
This package provides a single utility command for easy dataflow based manipulation of arbitrary data structures, especially abstract syn- tax trees. API
::page::util::flow start flowvar nodevar script This command contains the core logic to drive the walking of an arbitrary data structure which can partitioned into separate parts. Examples of such structures are trees and graphs. The command makes no assumptions at all about the API of the structure to be walked, except that that its parts, here called nodes, are identified by strings. These strings are taken as is, from the arguments, and the body, and handed back to the body, without modification. Access to the actual data structure, and all decisions regarding which nodes to visit in what order are delegated to the body of the loop, i.e. the script. The body is invoked first for the nodes in the start-set specified via start), and from then on for the nodes the body has requested to be visited. The command stops when the set of nodes to visit becomes empty. Note that a node can be visited more than once. The body has complete control about this. The body is invoked in the context of the caller. The variable named by nodevar will be set to the current node, and the variable named by flowvar will be set to the command of the flow object through which the body can request the nodes to visit next. The API provided by this object is described in the next section, FLOW API. Note that the command makes no promises regarding the order in which nodes are visited, excpt that the nodes requested to be visited by the current iteration will be visited afterward, in some order. FLOW API
This section describes the API provided by the flow object made accessible to the body script of ::page::util::flow. flow visit node Invoking this method requests that the node n is visited after the current iteration. flow visitl nodelist Invoking this method requests that all the nodes found in the list nodelist are visited after the current iteration. flow visita node... This is the variadic arguments form of the method visitl, see above. BUGS, IDEAS, FEEDBACK This document, will undoubtedly contain bugs and other problems. Please report such in the category page of the Tcllib SF Trackers [http://sourceforge.net/tracker/?group_id=12883]. Please also report any ideas for enhancements you may have. KEYWORDS
dataflow, graph walking, page, parser generator, text processing, tree walking CATEGORY
Page Parser Generator COPYRIGHT
Copyright (c) 2007 Andreas Kupries <andreas_kupries@users.sourceforge.net> page 1.0 page_util_flow(n)
All times are GMT -4. The time now is 06:15 PM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy