|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||||
See:
Description

| Interface Summary | |
|---|---|
| Calculator<I,O> | Defines an atomic calculation as part of a parallel dataflow graph. |
| Edge<V> | Defines an edge relationship between two nodes. |
| Handle<O> | Defines a container for storing the results of Calculators. |
| Traversable<V extends Traversable<V,E>,E extends Edge<V>> | Defines a graph node as part of some total ordering on graph nodes. |
| TraversalPolicy<V extends Traversable<V,E>,E extends Edge<V>> | Defines a total ordering and depth assignment to a collection of Traversables via
Traversable.setOrder(int) and Traversable.setDepth(int). |
| Class Summary | |
|---|---|
| Engine<T> | An execution engine class for pushing data through the guts of some parallel computation given as a directed, acyclic graph. |
| Engine.ThrowableReferenceHandler | A subclass of AtomicReference that doubles as an Thread.UncaughtExceptionHandler. |
| LimitedMemoryPolicy<V extends Traversable<V,E>,E extends Edge<V>> | An implementation of TraversalPolicy that attempts to conserve memory usage during parallel execution. |
A framework for specifying and executing parallel dataflow engines.
|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||||