Dismiss
InnovationQ will be updated on Sunday, Oct. 22, from 10am ET - noon. You may experience brief service interruptions during that time.
Browse Prior Art Database

Efficient Implementation of a Dataflow Network

IP.com Disclosure Number: IPCOM000123509D
Original Publication Date: 1998-Dec-01
Included in the Prior Art Database: 2005-Apr-04
Document File: 1 page(s) / 59K

Publishing Venue

IBM

Related People

Todd, SJ: AUTHOR

Abstract

In message processing systems having a number of nodes, the flow of a message typically requires each node receiving a message to keep a record of calls to other nodes to which it passes messages, together with essential data relating to the calls made. This can make substantial demands on the processing resources of the node, and it is desirable to ensure that these resources are effectively used. The system described here achieves this by using, for each node, that node's standard method call and subroutine stack mechanism. Each node implements a standard entry point 'AcceptPush'. Any node that wishes to output a message to a set of target nodes does this by calling the 'AcceptPush' entry point for each of the targets in turn.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 52% of the total text.

Efficient Implementation of a Dataflow Network

   In message processing systems having a number of nodes,
the flow of a message typically requires each node receiving a
message to keep a record of calls to other nodes to which it passes
messages, together with essential data relating to the calls made.
This can make substantial demands on the processing resources of the
node, and it is desirable to ensure that these resources are
effectively used.  The system described here achieves this by using,
for each node, that node's standard method call and subroutine stack
mechanism.  Each node implements a standard entry point 'AcceptPush'.
Any node that wishes to output a message to a set of target nodes
does this by calling the 'AcceptPush' entry point for each of the
targets in turn.  Each node of the dataflow is represented by an
object, the class of which depends on the function the node
implements.  In particular, this function is implemented in the
'AcceptPush' method of the class.  'AcceptPush' takes a single
parameter, a reference to the message being passed in.  'AcceptPush'
provides the 'self interpretation' of the dataflow graph.  All node
clases are subclasses of a generic DataflowNode class which class
defines a pure virtual 'AcceptPush' function.  The DataflowNode class
implements methods that keep track of the 'wiring' of the dataflow
using a collection member variable that contains reference to all the
target nodes, and further implements a 'Push' method with a message
reference parameter.  Push cal...