Package | Description |
---|---|
designflow |
package contains classes to perform a design flow for a multi-stage mapping and scheduling.
|
experiments.sharedMemory.twoDimension |
package contains a 2D design space exploration experiments.
|
exploration.parameters.oneDimension |
package contains exploration parameters for all one-dimensional
exploration.
|
exploration.parameters.threeDimension |
package contains exploration parameters for all three-dimensional
exploration.
|
exploration.parameters.twoDimension |
package contains exploration parameters for all two-dimensional
exploration.
|
graphanalysis |
package contains algorithms to perform different
analysis on the Application graph.
|
graphanalysis.properties |
package contains methods to analyze different
properties of SDF, HSDF and Split-join graphs.
|
graphanalysis.scheduling |
package contains miscellaneous scheduling algorithms
and some support functions for scheduling algorithms.
|
graphanalysis.throughput |
package contains algorithms to calculate throughput
of SDF graph.
|
input |
package contains classes to parse the input to the tool.
|
output |
package contains tools to generate output like application graph XML,
Gantt charts or Dot graphs in order to visualize the data.
|
platform.tilera.scheduleXML |
package contains classes to generate schedule XML.
|
solver.distributedMemory.mapping |
package contains solver for mapping problem (partition + allocation + communication cost).
|
solver.distributedMemory.partitioning |
package contains solver for partitioning problem.
|
solver.distributedMemory.scheduling |
package contains solver for scheduling problem for a distributed memory architecture.
|
solver.sharedMemory.combinedSolver |
package contains solver for scheduling problem for a shared memory architecture.
|
solver.sharedMemory.combinedSolver.nonpipelined |
package contains solver for scheduling problem for a shared memory architecture for non-pipelined scheduling.
|
solver.sharedMemory.combinedSolver.pipelined |
package contains solver for scheduling problem for a
shared memory architecture for pipelined scheduling.
|
spdfcore |
package contains components to build an application graph.
|
spdfcore.stanalys |
package contains classes to build the
solutions for balance equations of a graph and perform safety,
liveness analysis, consistency check etc.
|
tests |
package contains a group of tests in order to check different parts of this tool.
|
underDevelopment |
package contains code that is unused, not working or under development.
|
Class and Description |
---|
Actor
Models an instance of an actor (a 'filter') - a node of SPDF graph.
|
Channel
FIFO channel: an edge in the SPDF or SDF graph.
|
Graph
A Graph is a collection of actors which are connected by channels.
|
Class and Description |
---|
Graph
A Graph is a collection of actors which are connected by channels.
|
Class and Description |
---|
Graph
A Graph is a collection of actors which are connected by channels.
|
Class and Description |
---|
Graph
A Graph is a collection of actors which are connected by channels.
|
Class and Description |
---|
Graph
A Graph is a collection of actors which are connected by channels.
|
Class and Description |
---|
Actor
Models an instance of an actor (a 'filter') - a node of SPDF graph.
|
Channel
FIFO channel: an edge in the SPDF or SDF graph.
|
Graph
A Graph is a collection of actors which are connected by channels.
|
Class and Description |
---|
Actor
Models an instance of an actor (a 'filter') - a node of SPDF graph.
|
Channel
FIFO channel: an edge in the SPDF or SDF graph.
|
Graph
A Graph is a collection of actors which are connected by channels.
|
Port.DIR
One of the two possible port directions w.r.to the actor:
IN or OUT
|
Class and Description |
---|
Actor
Models an instance of an actor (a 'filter') - a node of SPDF graph.
|
Channel
FIFO channel: an edge in the SPDF or SDF graph.
|
Graph
A Graph is a collection of actors which are connected by channels.
|
Port
Port of an actor type ("filter" MIND object)
We reserve the term 'port' for class of links
sharing the same name, rate and function within the given actor type.
|
Class and Description |
---|
Actor
Models an instance of an actor (a 'filter') - a node of SPDF graph.
|
Channel
FIFO channel: an edge in the SPDF or SDF graph.
|
Graph
A Graph is a collection of actors which are connected by channels.
|
Class and Description |
---|
Graph
A Graph is a collection of actors which are connected by channels.
|
Class and Description |
---|
Graph
A Graph is a collection of actors which are connected by channels.
|
Class and Description |
---|
Graph
A Graph is a collection of actors which are connected by channels.
|
Class and Description |
---|
Channel
FIFO channel: an edge in the SPDF or SDF graph.
|
Graph
A Graph is a collection of actors which are connected by channels.
|
Class and Description |
---|
Graph
A Graph is a collection of actors which are connected by channels.
|
Class and Description |
---|
Actor
Models an instance of an actor (a 'filter') - a node of SPDF graph.
|
Channel
FIFO channel: an edge in the SPDF or SDF graph.
|
Channel.Link
A link between a channel and an actor what is usually called a port.
|
Graph
A Graph is a collection of actors which are connected by channels.
|
Class and Description |
---|
Actor
Models an instance of an actor (a 'filter') - a node of SPDF graph.
|
Graph
A Graph is a collection of actors which are connected by channels.
|
Class and Description |
---|
Actor
Models an instance of an actor (a 'filter') - a node of SPDF graph.
|
Graph
A Graph is a collection of actors which are connected by channels.
|
Class and Description |
---|
Actor
Models an instance of an actor (a 'filter') - a node of SPDF graph.
|
Graph
A Graph is a collection of actors which are connected by channels.
|
Class and Description |
---|
Actor
Models an instance of an actor (a 'filter') - a node of SPDF graph.
|
Actor.ActorType
If an actor is dataflow actor or inserted communication actor.
|
Channel
FIFO channel: an edge in the SPDF or SDF graph.
|
Channel.Link
A link between a channel and an actor what is usually called a port.
|
Graph
A Graph is a collection of actors which are connected by channels.
|
Id
Identifies a named entity: actor or port.
|
Id.PROP |
Modifier
Modifier - actor type that sets the parameter.
|
Port
Port of an actor type ("filter" MIND object)
We reserve the term 'port' for class of links
sharing the same name, rate and function within the given actor type.
|
Port.DIR
One of the two possible port directions w.r.to the actor:
IN or OUT
|
PortRef
Port reference is used to bind channel,
port and actor together.
|
Class and Description |
---|
Actor
Models an instance of an actor (a 'filter') - a node of SPDF graph.
|
Channel
FIFO channel: an edge in the SPDF or SDF graph.
|
Graph
A Graph is a collection of actors which are connected by channels.
|
Port
Port of an actor type ("filter" MIND object)
We reserve the term 'port' for class of links
sharing the same name, rate and function within the given actor type.
|
Class and Description |
---|
Graph
A Graph is a collection of actors which are connected by channels.
|
Class and Description |
---|
Actor
Models an instance of an actor (a 'filter') - a node of SPDF graph.
|
Channel
FIFO channel: an edge in the SPDF or SDF graph.
|
Graph
A Graph is a collection of actors which are connected by channels.
|
Port
Port of an actor type ("filter" MIND object)
We reserve the term 'port' for class of links
sharing the same name, rate and function within the given actor type.
|