Package | Description |
---|---|
designflow |
package contains classes to perform a design flow for a multi-stage mapping and scheduling.
|
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.
|
solver.distributedMemory.mapping |
package contains solver for mapping problem (partition + allocation + communication cost).
|
solver.distributedMemory.scheduling |
package contains solver for scheduling problem for a distributed memory architecture.
|
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.
|
underDevelopment |
package contains code that is unused, not working or under development.
|
Modifier and Type | Method and Description |
---|---|
int |
DesignFlowSolution.Schedule.getBufferSize(Channel chnnl)
Get buffer size calculated for a channel.
|
Modifier and Type | Field and Description |
---|---|
private java.util.HashMap<Channel,java.lang.String> |
BellmanFord.edgeQuantities
Weight for each channel
|
Constructor and Description |
---|
BellmanFord(Graph inputGraph,
java.util.HashMap<Channel,java.lang.String> edgQty)
Initialize Bellman-Ford algorithm object.
|
Modifier and Type | Method and Description |
---|---|
Channel |
GraphAnalysis.getChannelConnectingActors(Actor actr1,
Actor actr2,
Port.DIR direction)
Get channel connecting two actors in a given direction
|
Modifier and Type | Method and Description |
---|---|
java.util.List<Channel> |
GraphAnalysis.getIncomingChannels(Actor actr)
Get list of all the channels connected at all input ports of an actor
|
java.util.TreeSet<Channel> |
GraphAnalysisSdfAndHsdf.getSdfToHsdfChannels(Actor srcSdfActor,
Actor dstSdfActor)
Get all HSDF channels corresponding to SDF channel.
|
java.util.List<Channel> |
GraphAnalysisSdfAndHsdf.getSdfToHsdfChannels(Channel chnnl)
Get all HSDF channels corresponding to SDF channel.
|
Modifier and Type | Method and Description |
---|---|
int |
SplitJoinGraphAnalysis.getAlpha(Channel chnnl)
Get Alpha for Split Edges or 1/alpha for Join Edges.
|
SplitJoinGraphAnalysis.EdgeType |
SplitJoinGraphAnalysis.getEdgeType(Channel chnnl)
Get type of edge
|
java.util.List<Channel> |
GraphAnalysisSdfAndHsdf.getSdfToHsdfChannels(Channel chnnl)
Get all HSDF channels corresponding to SDF channel.
|
Modifier and Type | Field and Description |
---|---|
(package private) java.util.HashMap<Channel,java.lang.Integer> |
Apgan.repCount
Repetition count with respect to channels
|
Modifier and Type | Method and Description |
---|---|
Channel |
Apgan.selectEdge()
Select an edge for collapsing.
|
Modifier and Type | Method and Description |
---|---|
private Graph |
Apgan.collapseChannelInGraph(Channel slctChannel)
Collapse a selected channel in the graph.
|
private boolean |
Apgan.edgeIntroducesCycle(Channel channel)
Check if this channel introduces a cycle
|
Modifier and Type | Field and Description |
---|---|
private java.util.HashMap<Channel,java.lang.Integer> |
Throughput.TransitionSystem.State.ch |
Modifier and Type | Method and Description |
---|---|
private com.microsoft.z3.BoolExpr |
MappingCommSolver.commLink(Channel chnnl,
int distance)
Communication distance of a channel SMT variable
|
Modifier and Type | Method and Description |
---|---|
private Channel |
ClusterMutExclNonPipelined.getLastDmaPort(Actor actr)
Get the last DMA port of the actor when sorted
by name.
|
private Channel |
ClusterMutExclPipelined.getLastDmaPort(Actor actr) |
Modifier and Type | Method and Description |
---|---|
private java.util.List<Channel> |
ClusterMutExclNonPipelined.getSortedDmaPortList(Actor actr)
We sort the ports of an actor by their names.
|
private java.util.List<Channel> |
ClusterMutExclPipelined.getSortedDmaPortList(Actor actr) |
Modifier and Type | Method and Description |
---|---|
private java.util.HashMap<java.lang.Integer,java.util.List<java.lang.Integer>> |
ClusterMutExclNonPipelined.calculateActorPrecedences(Channel chnnl)
Generate a list of precedences between the producer and consumer task instances.
|
private java.util.HashMap<java.lang.Integer,java.util.List<java.lang.Integer>> |
ClusterMutExclPipelined.calculateActorPrecedences(Channel chnnl) |
Modifier and Type | Field and Description |
---|---|
private java.util.HashSet<Channel> |
Graph.channels
Channels of the graph
|
Modifier and Type | Method and Description |
---|---|
Channel |
Channel.Link.getChannel() |
Channel |
Graph.getChannel(java.lang.String channelName)
Get a channel with a given name.
|
Channel[] |
Graph.insertNewActorBetweenTwoActors(Actor srcActor,
Actor dstActor,
Channel chnnlToRemove,
Actor newActor,
java.lang.String newActorInputPortName,
java.lang.String newActorOutputPortName)
Insert a new actor between two actors
|
Channel[] |
Graph.insertNewActorBetweenTwoActors(Actor srcActor,
Actor dstActor,
Port portAtSrc,
Port portAtDst,
Actor newActor,
java.lang.String newActorInputPortName,
java.lang.String newActorOutputPortName)
Insert a new actor between a source and destination actor.
|
Modifier and Type | Method and Description |
---|---|
java.util.HashSet<Channel> |
Actor.getAllChannels()
Gets a set of all incoming and outgoing channels connected to this actor.
|
java.util.HashSet<Channel> |
Graph.getChannel(Actor srcActor,
Actor dstActor)
Get all the channels connecting two actors
|
java.util.List<Channel> |
Graph.getChannelList()
Get list of all the channels in the graph.
|
java.util.Iterator<Channel> |
Graph.getChannels()
Get an iterator to all the channels in the graph.
|
java.util.HashSet<Channel> |
Actor.getChannels(Port.DIR direction)
Get channels at the ports of this actor in a given direction.
|
Modifier and Type | Method and Description |
---|---|
void |
Graph.add(Channel channel)
Add a new channel to the graph.
|
Channel[] |
Graph.insertNewActorBetweenTwoActors(Actor srcActor,
Actor dstActor,
Channel chnnlToRemove,
Actor newActor,
java.lang.String newActorInputPortName,
java.lang.String newActorOutputPortName)
Insert a new actor between two actors
|
void |
Graph.remove(Channel channel)
Removes a channel from the graph.
|
Modifier and Type | Field and Description |
---|---|
private java.util.LinkedList<Channel> |
InconsistencyProof.cycle |
(package private) java.util.HashMap<Actor,Channel> |
Solutions.Data.predecessors |
(package private) java.util.HashSet<Channel> |
Solutions.Data.visitedChannels |
Modifier and Type | Method and Description |
---|---|
java.util.LinkedList<Channel> |
LivenessAcyclic.check(Graph graph)
check the liveness (in this version - whether the graph is acyclic)
|
java.util.LinkedList<Channel> |
InconsistencyProof.getCycle()
a undirected cycle found by findBadCycle in "IN-to-OUT" direction
of a (rather arbitrary) 'reference channel'
|
private static java.util.LinkedList<Channel> |
InconsistencyProof.pathToStart(Actor actor,
Solutions.Data data) |
(package private) java.util.LinkedList<Channel> |
LivenessAcyclic.visitSuccessors(Actor actor,
LivenessAcyclic.Data data)
visit non-visited successors of the given actor
|
Modifier and Type | Method and Description |
---|---|
private void |
InconsistencyProof.findCycle(Channel refChannel,
Solutions.Data data)
given the channel where inconsistency was detected, expose
the complete cyclic path with inconsistency by combining
this channel with the paths which were followed by the solver
when trying to derive the solution.
|
Modifier and Type | Field and Description |
---|---|
private java.util.HashMap<Channel,java.lang.String> |
QuasiStaticScheduling.edgeQuantities |
Modifier and Type | Method and Description |
---|---|
private Channel |
QuasiStaticScheduling.getChannel(Actor srcActor,
Actor dstActor) |
Modifier and Type | Method and Description |
---|---|
private void |
QuasiStaticScheduling.collapseChannelInGraph(Channel slctChannel) |
private void |
QuasiStaticScheduling.createNewLink(Graph graph,
Actor oppositeActor,
Port oppositePort,
Actor newActor,
Channel oldChannel) |