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.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.
|
underDevelopment |
package contains code that is unused, not working or under development.
|
Modifier and Type | Method and Description |
---|---|
int |
DesignFlowSolution.Partition.groupAllocated(Actor actor)
Get the group to which an actor is allocated.
|
Modifier and Type | Field and Description |
---|---|
private java.util.HashMap<Actor,GraphFindCycles.Color> |
GraphFindCycles.color
Color assigned to the actor.
|
private java.util.List<java.util.List<Actor>> |
GraphFindCycles.cycles
List of cycles in the graph.
|
private java.util.HashMap<Actor,java.lang.String> |
BellmanFord.distances
Distances of different actors from the source
|
private java.util.HashMap<Actor,Actor> |
GraphFindCycles.pi |
private java.util.HashMap<Actor,Actor> |
GraphFindCycles.pi |
private java.util.HashMap<Actor,Actor> |
BellmanFord.predecessors
Predecessor of an actor.
|
private java.util.HashMap<Actor,Actor> |
BellmanFord.predecessors
Predecessor of an actor.
|
private java.util.List<java.util.List<Actor>> |
Kosaraju.stronglyConnectedComponents
List of strongly connected components
|
Modifier and Type | Method and Description |
---|---|
private java.util.List<Actor> |
DepthFirstSearch.clonePath(java.util.List<Actor> path)
Clone a path
|
java.util.Stack<Actor> |
DepthFirstSearch.dfsVisitOrder(Graph g,
boolean transpose)
Given a graph, returns a queue containing the nodes of that graph in
the order in which a DFS of that graph finishes expanding the nodes.
|
java.util.List<java.util.List<Actor>> |
GraphFindCycles.findCycles(Graph inputGraph)
Find cycles in the graph.
|
private java.util.HashSet<Actor> |
DepthFirstSearch.getAdjacentActors(Actor actr,
boolean transpose)
The function returns a list with actors directly reachable from
actor a (in case transpose if false).
|
private java.util.List<Actor> |
GraphFindCycles.getAdjacentList(Actor a,
java.util.List<Actor> fromNodes)
Get adjacent actors to an actor
|
java.util.List<Actor> |
BreadthFirstSearch.getBfsActorList()
Gets a list of actors which if we sequentially access then we are
essentially accessing them in breadth first fashion.
|
java.util.List<java.util.List<Actor>> |
DepthFirstSearch.getDfsPaths(Actor srcActr,
Actor dstActr)
Get depth first search path.
|
private java.util.Stack<Actor> |
BellmanFord.getPath(Actor srcActr,
Actor dstActr)
Get the path between two actors.
|
java.util.List<java.util.List<Actor>> |
Kosaraju.getStronglyConnectedComponents()
Get list of strongly connected components
|
java.util.Stack<Actor> |
BellmanFord.searchPath(Actor srcActr,
Actor dstActr,
boolean longestPath)
Search for a shortest or longest path between two actors.
|
Modifier and Type | Method and Description |
---|---|
void |
DepthFirstSearch.dfsVisit(Actor actr,
Actor dstActor,
java.util.List<Actor> currentPath,
java.util.List<java.util.List<Actor>> paths)
DFS visit a node.
|
private java.util.HashSet<Actor> |
DepthFirstSearch.getAdjacentActors(Actor actr,
boolean transpose)
The function returns a list with actors directly reachable from
actor a (in case transpose if false).
|
private java.util.List<Actor> |
GraphFindCycles.getAdjacentList(Actor a,
java.util.List<Actor> fromNodes)
Get adjacent actors to an actor
|
java.util.List<java.util.List<Actor>> |
DepthFirstSearch.getDfsPaths(Actor srcActr,
Actor dstActr)
Get depth first search path.
|
private java.util.Stack<Actor> |
BellmanFord.getPath(Actor srcActr,
Actor dstActr)
Get the path between two actors.
|
private boolean |
BellmanFord.hasPath(Actor srcActr,
Actor dstActr)
Check if path exists between two actors
|
private void |
BellmanFord.initializeGraph(Actor srcActor,
boolean longestPath)
Initialize the edge quantities and distances between actors.
|
private void |
Kosaraju.markReachableNodes(Actor node,
Graph g,
java.util.Map<Actor,java.lang.Integer> result,
int label)
Recursively marks all nodes reachable from the given node by a DFS with
the current label.
|
void |
BellmanFord.printSolutions(Actor srcActr)
Print final solutions.
|
private void |
DepthFirstSearch.recExplore(Actor node,
Graph g,
java.util.Stack<Actor> result,
java.util.Set<Actor> visited,
boolean transpose)
Recursively explores the given node with a DFS, adding it to the output
list once the exploration is complete.
|
java.util.Stack<Actor> |
BellmanFord.searchPath(Actor srcActr,
Actor dstActr,
boolean longestPath)
Search for a shortest or longest path between two actors.
|
private void |
GraphFindCycles.simpleCycleVisit(Actor a,
java.util.List<Actor> component) |
Modifier and Type | Method and Description |
---|---|
private java.util.List<Actor> |
DepthFirstSearch.clonePath(java.util.List<Actor> path)
Clone a path
|
void |
DepthFirstSearch.dfsVisit(Actor actr,
Actor dstActor,
java.util.List<Actor> currentPath,
java.util.List<java.util.List<Actor>> paths)
DFS visit a node.
|
void |
DepthFirstSearch.dfsVisit(Actor actr,
Actor dstActor,
java.util.List<Actor> currentPath,
java.util.List<java.util.List<Actor>> paths)
DFS visit a node.
|
private java.util.List<Actor> |
GraphFindCycles.getAdjacentList(Actor a,
java.util.List<Actor> fromNodes)
Get adjacent actors to an actor
|
private void |
Kosaraju.markReachableNodes(Actor node,
Graph g,
java.util.Map<Actor,java.lang.Integer> result,
int label)
Recursively marks all nodes reachable from the given node by a DFS with
the current label.
|
private void |
DepthFirstSearch.recExplore(Actor node,
Graph g,
java.util.Stack<Actor> result,
java.util.Set<Actor> visited,
boolean transpose)
Recursively explores the given node with a DFS, adding it to the output
list once the exploration is complete.
|
private void |
DepthFirstSearch.recExplore(Actor node,
Graph g,
java.util.Stack<Actor> result,
java.util.Set<Actor> visited,
boolean transpose)
Recursively explores the given node with a DFS, adding it to the output
list once the exploration is complete.
|
private void |
GraphFindCycles.simpleCycleVisit(Actor a,
java.util.List<Actor> component) |
Modifier and Type | Method and Description |
---|---|
Actor |
SplitJoinGraphAnalysis.getEndActor()
Get an actor with no successors.
|
Actor |
GraphAnalysisSdfAndHsdf.getHsdfToSdfActor(Actor hsdfActor)
Get HSDF to corresponding SDF actor
|
Actor |
GraphAnalysisSdfAndHsdf.getSdfToHsdfActor(Actor actr,
int instanceId)
Get an HSDF actor from SDF actor and instance id
|
Actor |
SplitJoinGraphAnalysis.getStartActor()
Get an actor with no predecessors
|
Modifier and Type | Method and Description |
---|---|
java.util.List<Actor> |
GraphAnalysisSdfAndHsdf.findHsdfEndActors()
Find HSDF actors with no successors
|
java.util.List<Actor> |
GraphAnalysisSdfAndHsdf.findHsdfStartActors()
Find HSDF actors with no predecessors
|
java.util.List<Actor> |
GraphAnalysisSdfAndHsdf.findSdfEndActors()
Find SDF actors with no successors
|
java.util.List<Actor> |
GraphAnalysisSdfAndHsdf.findSdfStartActors()
Find SDF actors with no predecessors
|
java.util.HashSet<Actor> |
GraphAnalysis.getImmediatelyConnectedActors(Actor actor)
Get actors which are immediately connected, both at input and output ports.
|
java.util.HashSet<Actor> |
GraphAnalysis.getImmediatelyConnectedActors(Actor actor,
Port.DIR direction)
Get actors which are immediately connected.
|
java.util.List<java.util.List<Actor>> |
GraphAnalysisSdfAndHsdf.getPath(Actor srcActr,
Actor dstActr)
Get multiple paths between two actors
|
java.util.List<Actor> |
GraphAnalysisSdfAndHsdf.getSdfToAllHsdfActors(Actor actr)
Get HSDF actors corresponding to an SDF actor
|
Modifier and Type | Method and Description |
---|---|
boolean |
GraphAnalysis.areActorsImmediatelyConnected(Actor actr1,
Actor actr2)
Check if two actors are connected with a channel.
|
Channel |
GraphAnalysis.getChannelConnectingActors(Actor actr1,
Actor actr2,
Port.DIR direction)
Get channel connecting two actors in a given direction
|
Actor |
GraphAnalysisSdfAndHsdf.getHsdfToSdfActor(Actor hsdfActor)
Get HSDF to corresponding SDF actor
|
java.util.HashSet<Actor> |
GraphAnalysis.getImmediatelyConnectedActors(Actor actor)
Get actors which are immediately connected, both at input and output ports.
|
java.util.HashSet<Actor> |
GraphAnalysis.getImmediatelyConnectedActors(Actor actor,
Port.DIR direction)
Get actors which are immediately connected.
|
java.util.List<Channel> |
GraphAnalysis.getIncomingChannels(Actor actr)
Get list of all the channels connected at all input ports of an actor
|
int |
GraphAnalysis.getInstanceId(Actor hsdfActr)
Get Instance Id of an HSDF actor
|
int |
GraphAnalysisSdfAndHsdf.getMaxDistanceFromSrc(Actor actr)
Get maximum distance of an actor from source (or start actor) of the graph
|
java.util.List<java.util.List<Actor>> |
GraphAnalysisSdfAndHsdf.getPath(Actor srcActr,
Actor dstActr)
Get multiple paths between two actors
|
java.util.List<Actor> |
GraphAnalysisSdfAndHsdf.getSdfToAllHsdfActors(Actor actr)
Get HSDF actors corresponding to an SDF actor
|
Actor |
GraphAnalysisSdfAndHsdf.getSdfToHsdfActor(Actor actr,
int instanceId)
Get an HSDF actor from SDF actor and instance id
|
java.util.TreeSet<Channel> |
GraphAnalysisSdfAndHsdf.getSdfToHsdfChannels(Actor srcSdfActor,
Actor dstSdfActor)
Get all HSDF channels corresponding to SDF channel.
|
boolean |
GraphAnalysisSdfAndHsdf.isConnected(Actor srcActor,
Actor dstActor,
Port.DIR direction)
Check if two actors are connected
|
Modifier and Type | Field and Description |
---|---|
private Actor |
Apgan.collapsedLeftActor
Internal variables of the algorithm
|
private Actor |
Apgan.collapsedRightActor
Internal variables of the algorithm
|
private Actor |
Apgan.currentOmegaActor
Internal variables of the algorithm
|
Modifier and Type | Field and Description |
---|---|
(package private) java.util.List<Actor> |
ListScheduling.allocatedActorList
Tasks already allocated
|
(package private) java.util.List<Actor> |
ListScheduling.nonAllocatedActorList
Non allocated Tasks
|
private java.util.Map<Actor,java.util.HashSet<Actor>> |
ListScheduling.predecessors
List of predecessors of an actor
|
private java.util.Map<Actor,java.util.HashSet<Actor>> |
ListScheduling.predecessors
List of predecessors of an actor
|
private java.util.Map<Actor,java.lang.Integer> |
ListScheduling.randomStrategyOrder
assigns random unique index for each actor
|
(package private) java.util.HashMap<Actor,java.util.List<Actor>> |
Apgan.reachability
Reachability matrix
|
(package private) java.util.HashMap<Actor,java.util.List<Actor>> |
Apgan.reachability
Reachability matrix
|
(package private) java.util.List<Actor> |
ListScheduling.readyList
Ready list for scheduling
|
private java.util.Map<Actor,java.lang.Integer[]> |
ListScheduling.schedule
Schedule produced
|
Modifier and Type | Method and Description |
---|---|
private Actor |
ListScheduling.selectReadyActor()
This function selects actor from the ready list.
|
Modifier and Type | Method and Description |
---|---|
private int |
ListScheduling.compareByStrategy(ListScheduling.Strategy strategy,
Actor actor1,
Actor actor2)
This functions supports the comparator to select an actor
between multiple ready actors.
|
private void |
Apgan.createNewLink(Graph graph,
java.lang.String rate,
Actor oppositeActor,
Port oppositePort,
int multPortRate,
Actor newActor)
Create a new link between two actors.
|
private int |
ListScheduling.getMinStartTime(Actor readyActor)
Depending on when the predecessors end, calculate the start time for the actor.
|
Modifier and Type | Field and Description |
---|---|
(package private) Actor |
Throughput.TransitionSystem.outputActor |
Modifier and Type | Field and Description |
---|---|
private java.util.HashMap<Actor,java.util.List<java.lang.Integer>> |
Throughput.TransitionSystem.State.actClk |
Modifier and Type | Method and Description |
---|---|
private boolean |
Throughput.TransitionSystem.actorReadyToEnd(Actor actr) |
private boolean |
Throughput.TransitionSystem.actorReadyToFire(Actor actr) |
private void |
Throughput.TransitionSystem.endActorFiring(Actor actr) |
private void |
Throughput.TransitionSystem.startActorFiring(Actor actr) |
Modifier and Type | Field and Description |
---|---|
private java.util.HashSet<Actor> |
ClusterMutExclPipelined.multiClusterActors |
Modifier and Type | Method and Description |
---|---|
Actor |
ClusterMutExclNonPipelined.OptimizeSchedule.getOutgoingPreviousDmaActor(Actor hsdfActr,
Graph hsdfGraph) |
private Actor |
ClusterMutExclPipelined.getpartitionAwareGraphActor(Actor actr) |
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) |
Actor |
ClusterMutExclNonPipelined.OptimizeSchedule.getOutgoingPreviousDmaActor(Actor hsdfActr,
Graph hsdfGraph) |
private Actor |
ClusterMutExclPipelined.getpartitionAwareGraphActor(Actor actr) |
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) |
private java.util.List<Channel.Link> |
ClusterMutExclNonPipelined.getSortedPortList(Actor actr)
We sort the ports of an actor by their names.
|
private java.util.List<Channel.Link> |
ClusterMutExclPipelined.getSortedPortList(Actor actr) |
private boolean |
ClusterMutExclNonPipelined.hasActorDmaOutput(Actor actr)
Check if the actor has DMA at its output or not.
|
private boolean |
ClusterMutExclPipelined.hasActorDmaOutput(Actor actr) |
Modifier and Type | Method and Description |
---|---|
private void |
ClusterMutExclPipelined.assertCommunicationMutualExclusion(java.util.List<Actor> actrList) |
private void |
ClusterMutExclPipelined.assertDataFlowMutualExclusion(java.util.List<Actor> actrList) |
private void |
ClusterMutExclPipelined.assertNonOverlapPeriodConstraintCommunication(java.util.List<Actor> actrList) |
private void |
ClusterMutExclPipelined.assertNonOverlapPeriodConstraintDataflow(java.util.List<Actor> actrList) |
Modifier and Type | Field and Description |
---|---|
protected java.util.List<Actor> |
MutualExclusionSolver.lastActorList
list of actors which finish in the end.
|
protected java.util.Map<Actor,java.util.HashSet<Actor>> |
MutualExclusionSolver.overlappingActorList
List of overlapping actors
|
protected java.util.Map<Actor,java.util.HashSet<Actor>> |
MutualExclusionSolver.overlappingActorList
List of overlapping actors
|
protected java.util.Map<Actor,java.util.List<java.util.HashSet<Actor>>> |
MutualExclusionSolver.overlappingActorWithGraphSymList |
protected java.util.Map<Actor,java.util.List<java.util.HashSet<Actor>>> |
MutualExclusionSolver.overlappingActorWithGraphSymList |
protected java.util.List<Actor> |
MutualExclusionSolver.startActorList
list of actors which can start at time zero.
|
Modifier and Type | Method and Description |
---|---|
java.util.List<Actor> |
MutualExclusionSolver.getLastActors()
Get list of actors without any successors.
|
private java.util.List<Actor> |
MutualExclusionSolver.getPredecessors(Actor actr)
Get all the predecessors which do not have any initial tokens
on the channels connecting to it.
|
java.util.List<Actor> |
MutualExclusionSolver.getStartActors()
Get list of actors without any predecessors.
|
private java.util.List<Actor> |
MutualExclusionSolver.getSuccessors(Actor actr)
Get all the successors which do not have any initial tokens
on the channels connecting to it.
|
Modifier and Type | Method and Description |
---|---|
private java.util.List<Actor> |
MutualExclusionSolver.getPredecessors(Actor actr)
Get all the predecessors which do not have any initial tokens
on the channels connecting to it.
|
private java.util.List<Actor> |
MutualExclusionSolver.getSuccessors(Actor actr)
Get all the successors which do not have any initial tokens
on the channels connecting to it.
|
Modifier and Type | Field and Description |
---|---|
protected java.util.List<Actor> |
MatrixSolver.lastActorList
List of actors without successors.
|
private java.util.Map<Actor,java.util.HashSet<Actor>> |
MatrixSolver.predecessors |
private java.util.Map<Actor,java.util.HashSet<Actor>> |
MatrixSolver.predecessors |
protected java.util.List<Actor> |
MatrixSolver.startActorList
List of actors without predecessors.
|
Modifier and Type | Field and Description |
---|---|
protected java.util.List<Actor> |
UnfoldingScheduling.lastActorList
List of actors without successors.
|
protected java.util.List<Actor> |
UnfoldingScheduling.startActorList
List of actors without predecessors.
|
Modifier and Type | Field and Description |
---|---|
private Actor |
Channel.Link.actor |
Modifier and Type | Field and Description |
---|---|
private java.util.HashMap<java.lang.String,java.util.HashSet<Actor>> |
Graph.actorInstances |
private java.util.HashMap<java.lang.String,Actor> |
Graph.actors
Actors of the graph mapped by names
|
Modifier and Type | Method and Description |
---|---|
Actor |
Channel.Link.getActor() |
Actor |
Graph.getActor(java.lang.String actorName)
get actor with given name.
|
Actor |
Channel.getOpposite(Actor actor)
Get the link at the opposite side of the channel
|
Modifier and Type | Method and Description |
---|---|
java.util.List<Actor> |
Graph.getActorList()
Get a list of all the actors in the graph.
|
java.util.Iterator<Actor> |
Graph.getActors()
Get an iterator to all the actors in the graph
|
java.util.Iterator<Actor> |
Graph.getActors(java.lang.String func)
Get actors corresponding to a specific function
|
Modifier and Type | Method and Description |
---|---|
void |
Graph.add(Actor actor)
Add an actor to the graph
|
java.util.HashSet<Channel> |
Graph.getChannel(Actor srcActor,
Actor dstActor)
Get all the channels connecting two actors
|
Actor |
Channel.getOpposite(Actor actor)
Get the link at the opposite side of the channel
|
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.
|
void |
Graph.insertNewChannelBetweenActors(Actor srcActor,
Actor dstActor,
int tokenSize,
int initialTokens,
int srcRate,
int dstRate)
Insert a new channel between two actors.
|
void |
Graph.remove(Actor actor)
Removes actor and all channels that are bound to it.
|
void |
PortRef.setActor(Actor actor)
Set actor to which this port belongs to.
|
Constructor and Description |
---|
Actor(Actor otherActor)
Create a copy of other actor.
|
Modifier and Type | Field and Description |
---|---|
(package private) Actor |
LivenessAcyclic.Data.cycleActor |
Modifier and Type | Field and Description |
---|---|
(package private) java.util.Iterator<Actor> |
LivenessAcyclic.Data.examinedActors |
(package private) java.util.HashSet<Actor> |
LivenessAcyclic.Data.finished |
(package private) java.util.HashMap<Actor,Fraction> |
Solutions.Data.fracSolutions |
private java.util.HashMap<Actor,java.util.HashSet<java.lang.String>> |
ParamComm.modifiedParameters
lookup from modifier actor to parameters
|
private java.util.HashMap<Actor,Actor> |
ParamComm.modifierOfPeriodActor
lookup from period actor to the corresponding modifier
|
private java.util.HashMap<Actor,Actor> |
ParamComm.modifierOfPeriodActor
lookup from period actor to the corresponding modifier
|
private java.util.HashMap<java.lang.String,java.util.HashSet<Actor>> |
ParamComm.periodActors
lookup from modified parameter to period actors
(eventually, there should be only one period actor per modified parameter)
|
(package private) java.util.HashMap<Actor,Channel> |
Solutions.Data.predecessors |
private java.util.HashMap<Actor,Expression> |
Solutions.solutions
Actor and its mapped solution expression
|
private java.util.HashMap<Actor,java.util.HashSet<java.lang.String>> |
ParamComm.usedParameters
lookup from user to parameters
|
private java.util.HashMap<java.lang.String,java.util.HashSet<Actor>> |
ParamComm.users
lookup from parameter to its users
|
(package private) java.util.HashSet<Actor> |
LivenessAcyclic.Data.visited |
Modifier and Type | Method and Description |
---|---|
private Actor |
Solutions.getArbitraryActor(Graph graph)
pick up the first actor we can get
|
Actor |
ParamComm.getPeriodActor(java.lang.String parameter)
get period actor for the parameter.
|
(package private) Actor |
LivenessAcyclic.Data.nextNonvisitedActor() |
Modifier and Type | Method and Description |
---|---|
java.util.HashSet<Actor> |
ParamComm.getUserSet(java.lang.String parameter)
get the user actors for the parameter.
|
(package private) java.util.HashMap<Actor,Expression> |
Solutions.scaleFractions(Solutions.Data data)
Scale the fractional solutions from the results of the solver
to be non-fractional, using the least common multiple of
the denominators.
|
Modifier and Type | Method and Description |
---|---|
private void |
ParamComm.addUser(java.util.HashSet<java.lang.String> parameterSet,
Actor actor)
register an actor as user of the given set of parameters
|
boolean |
Solutions.contains(Actor actr)
Check if the solutions contain an actor
|
java.util.HashSet<java.lang.String> |
ParamComm.getModifiedParameterSet(Actor actor)
get the parameters modified by the given actor
|
Expression |
Solutions.getSolution(Actor actor)
Gets an expression to solution of an actor
|
java.util.HashSet<java.lang.String> |
ParamComm.getUsedParameterSet(Actor actor)
get the set of parameters used by the actor
by convention, a parameter modified by an actor can be also a parameter used,
we do not exclude the parameters modified from the set of parameter used.
|
boolean |
ParamComm.isPeriodActor(Actor actor)
Checks wether given actor is a period actor
|
private static java.util.LinkedList<Channel> |
InconsistencyProof.pathToStart(Actor actor,
Solutions.Data data) |
InconsistencyProof |
Solutions.solve(Graph graph,
GraphExpressions expressions,
Actor startActor)
Solve balance equations.
|
private void |
Solutions.solveRecursively(Actor actor,
Solutions.Data data)
one step of recursion, from solution for current actor
find solutions of its neighbors, and call this function
for each neighbor
|
(package private) java.util.LinkedList<Channel> |
LivenessAcyclic.visitSuccessors(Actor actor,
LivenessAcyclic.Data data)
visit non-visited successors of the given actor
|
Modifier and Type | Field and Description |
---|---|
private java.util.HashMap<Actor,java.util.HashSet<Actor>> |
QuasiStaticScheduling.actorMap |
private java.util.HashMap<Actor,java.util.HashSet<Actor>> |
QuasiStaticScheduling.actorMap |
private java.util.HashMap<Actor,QuasiStaticScheduling.Level> |
QuasiStaticScheduling.levelMap |
Modifier and Type | Method and Description |
---|---|
private Actor |
QuasiStaticScheduling.getStartActor(Graph graph) |
Modifier and Type | Method and Description |
---|---|
private java.util.Stack<Actor> |
QuasiStaticScheduling.searchLongestPath(Actor actr,
Actor terminateActor) |
private java.util.Queue<Actor> |
QuasiStaticScheduling.topologicalSort(Graph graph) |
Modifier and Type | Method and Description |
---|---|
private void |
QuasiStaticScheduling.createNewLink(Graph graph,
Actor oppositeActor,
Port oppositePort,
Actor newActor,
Channel oldChannel) |
private void |
QuasiStaticScheduling.getActorSchedule(Actor actr) |
private Channel |
QuasiStaticScheduling.getChannel(Actor srcActor,
Actor dstActor) |
private java.util.Stack<Actor> |
QuasiStaticScheduling.searchLongestPath(Actor actr,
Actor terminateActor) |
Modifier and Type | Method and Description |
---|---|
private java.util.HashSet<java.lang.String> |
QuasiStaticScheduling.collectParamters(java.util.Stack<Actor> path) |