Package | Description |
---|---|
org.shared.parallel |
A framework for specifying and executing parallel dataflow engines.
|
Modifier and Type | Class and Description |
---|---|
class |
LimitedMemoryPolicy<V extends Traversable<V,E>,E extends Edge<V>>
An implementation of
TraversalPolicy that attempts to conserve memory usage during parallel execution. |
interface |
Traversable<V extends Traversable<V,E>,E extends Edge<V>>
Defines a graph node as part of some total ordering on graph nodes.
|
interface |
TraversalPolicy<V extends Traversable<V,E>,E extends Edge<V>>
Defines a total ordering and depth assignment to a collection of
Traversable s via
setOrder(int) and setDepth(int) . |
Modifier and Type | Class and Description |
---|---|
protected class |
Engine.EngineNode<I,O>
A computation node that is part of some topology of nodes.
|
Modifier and Type | Method and Description |
---|---|
protected LimitedMemoryPolicy.PolicyNode |
LimitedMemoryPolicy.longestPath(Traversable<V,E> curr,
Map<Traversable<V,E>,LimitedMemoryPolicy.PolicyNode> visitedMap)
Sorts a
LimitedMemoryPolicy.PolicyNode 's children in decreasing order of maximum distance from the source. |
Modifier and Type | Method and Description |
---|---|
protected LimitedMemoryPolicy.PolicyNode |
LimitedMemoryPolicy.longestPath(Traversable<V,E> curr,
Map<Traversable<V,E>,LimitedMemoryPolicy.PolicyNode> visitedMap)
Sorts a
LimitedMemoryPolicy.PolicyNode 's children in decreasing order of maximum distance from the source. |
Constructor and Description |
---|
LimitedMemoryPolicy.PolicyNode(Traversable<V,E> handle)
Default constructor.
|