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.kalray.scheduleXML |
package contains classes to generate schedule XML.
|
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.
|
Modifier and Type | Field and Description |
---|---|
private Graph |
NonPipelinedScheduling.graph
Application Graph SDF
|
private Graph |
DesignFlowSolution.graph
Application Graph SDF
|
private Graph |
PipelinedScheduling.graph
Application Graph SDF
|
private Graph |
DesignFlowSolution.hsdf
Equivalent Application Graph HSDF
|
private Graph |
NonPipelinedScheduling.hsdfGraph
Equivalent HSDF graph of application graph
|
private Graph |
PipelinedScheduling.hsdfGraph
Equivalent HSDF graph of application graph
|
private Graph |
DesignFlowSolution.partitionAwareGraph
Partition Aware Graph
Note : This graph is same sdf graph but with additional actors for communication.
|
private Graph |
DesignFlowSolution.partitionAwareHsdf
Partition Aware Graph HSDF
|
Modifier and Type | Method and Description |
---|---|
Graph |
DesignFlowSolution.getpartitionAwareGraph()
Get partition aware graph in SDF
|
Graph |
DesignFlowSolution.getPartitionAwareHsdf()
Get HSDF equivalent of partition aware graph
|
Modifier and Type | Method and Description |
---|---|
void |
DesignFlowSolution.setpartitionAwareGraph(Graph partitionAwareGraph)
Set partition aware graph in SDF
|
private void |
NonPipelinedScheduling.updateLatBuffExplParams(Graph partitionAwareGraph,
LatBuffParams explorationParams,
SchedulingConstraints schedConstraints)
I need to update the buffer exploration parameters
because, the fifo status size will be calculated into buffer.
|
Constructor and Description |
---|
DesignFlowSolution(Graph graph,
Graph hsdf,
Solutions solutions,
Platform platform)
Initialize a design flow solution
|
NonPipelinedScheduling(Graph g,
Platform p,
CommandLineArgs args)
Build a non-pipelined scheduling object
|
PipelinedScheduling(Graph g,
Platform p,
CommandLineArgs args)
Build a pipelined scheduling object
|
Modifier and Type | Method and Description |
---|---|
private static void |
PeriodProcExploration.generateScheduleXml(Graph g,
Solutions solutions,
java.util.List<java.util.Map<java.lang.String,java.lang.String>> paretoPoints,
CommandLineArgs processedArgs)
Generate a schedule XML for Tilera platform
|
Constructor and Description |
---|
CommCostParams(Graph graph,
Solutions solutions,
Platform platform)
Initialize exploration parameters object.
|
LatencyParams(Graph graph,
Solutions solutions)
Initialize exploration parameters object.
|
PeriodParams(Graph graph,
Solutions solutions)
Initialize exploration parameters object.
|
PeriodUnfoldingParams(Graph graph,
Solutions solutions)
Initialize exploration parameters object.
|
Constructor and Description |
---|
LatProcBuffParams(Graph graph,
Solutions solutions)
Initialize exploration parameters object.
|
MaxwrkloadCommClusterParams(Graph graph,
Solutions solutions,
int totalNumClusters)
Initialize exploration parameters object.
|
WrkldImbalCommClusterParams(Graph graph,
Solutions solutions,
int totalNumClusters)
Initialize exploration parameters object.
|
Constructor and Description |
---|
LatBuffParams(Graph graph,
Solutions solutions)
Initialize exploration parameters object.
|
LatProcParams(Graph graph,
Solutions solutions)
Initialize exploration parameters object.
|
PeriodProcParams(Graph graph,
Solutions solutions) |
PeriodProcUnfolding(Graph graph,
Solutions solutions)
Initialize exploration parameters object.
|
WrkLoadCommCostParams(Graph graph,
Solutions solutions)
Initialize exploration parameters object.
|
Modifier and Type | Field and Description |
---|---|
private Graph |
BreadthFirstSearch.graph
Graph to be traversed.
|
private Graph |
CalculateBounds.graph
Graph to be analysed
|
private Graph |
BellmanFord.graph
Graph under analysis
|
private Graph |
CalculateBounds.hsdf
HSDF of the same graph.
|
private Graph |
Kosaraju.inputGraph
Input Graph under analysis
|
Modifier and Type | Method and Description |
---|---|
Graph |
TransformSDFtoHSDF.convertSDFtoHSDF(Graph sdfGraph)
Convert SDF to HSDF graph with all rates equal to 1.
|
Graph |
TransformSDFtoHSDF.convertSDFtoHSDFWithUniqueChannels(Graph sdfGraph)
Convert SDF to HSDF graph with unique channels.
|
Modifier and Type | Method and Description |
---|---|
Graph |
TransformSDFtoHSDF.convertSDFtoHSDF(Graph sdfGraph)
Convert SDF to HSDF graph with all rates equal to 1.
|
Graph |
TransformSDFtoHSDF.convertSDFtoHSDFWithUniqueChannels(Graph sdfGraph)
Convert SDF to HSDF graph with unique channels.
|
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 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 |
TransformSDFtoHSDF.setPortRate(Graph g,
java.lang.String actorName,
java.lang.String portName,
java.lang.String rate)
Set the properties of the port.
|
Constructor and Description |
---|
BellmanFord(Graph inputGraph,
java.util.HashMap<Channel,java.lang.String> edgQty)
Initialize Bellman-Ford algorithm object.
|
BreadthFirstSearch(Graph inputGraph,
Solutions solutions)
Initialize a BFS object.
|
CalculateBounds(Graph graph,
Graph hsdf,
Solutions solutions)
Initialize the bounds calculation object.
|
CalculateBounds(Graph graph,
Solutions solutions)
Initialize the bounds calculation object.
|
Kosaraju(Graph inputGraph)
Initialize Kosaraju algorithm instance to find strongly connected
components.
|
Modifier and Type | Field and Description |
---|---|
protected Graph |
GraphAnalysisSdfAndHsdf.graph
SDF Graph
|
protected Graph |
GraphAnalysisSdfAndHsdf.hsdf
Equivalent HSDF graph
|
Constructor and Description |
---|
GraphAnalysisSdfAndHsdf(Graph graph,
Solutions solutions)
Initialize graph analysis object
|
GraphAnalysisSdfAndHsdf(Graph graph,
Solutions solutions,
Graph hsdf)
Initialize graph analysis object
|
SplitJoinGraphAnalysis(Graph graph,
Solutions solutions)
Initialize split-join analysis object.
|
SplitJoinGraphAnalysis(Graph graph,
Solutions solutions,
Graph hsdf)
Initialize split-join analysis object.
|
Modifier and Type | Field and Description |
---|---|
private Graph |
ListScheduling.hsdf
An equivalent HSDF graph
|
private Graph |
ListScheduling.sdf
Input SDF graph
|
Modifier and Type | Method and Description |
---|---|
private Graph |
Apgan.collapseChannelInGraph(Channel slctChannel)
Collapse a selected channel in the graph.
|
Modifier and Type | Method and Description |
---|---|
private void |
Apgan.constructReachability(Graph graph)
Construct Reachability matrix of the input graph
This algorithm comes from the book -
Essential Java for Scientists and Engineers
page no.
|
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.
|
void |
Apgan.generateScheduleApgan(Graph inputGraph)
Generate Single appearance schedule using APGAN algorithm.
|
private void |
Apgan.getRepetitionCount(Graph inputGraph)
Construction repetition count for each channel.
|
java.util.Map<java.lang.String,java.lang.Integer> |
LeftEdgeModelToSchedule.nonPipelined(Graph graph,
Graph hsdf,
java.util.Map<java.lang.String,java.lang.Integer> model) |
Constructor and Description |
---|
ListScheduling(Graph sdfGraph)
Initialize list-scheduling algorithm.
|
Modifier and Type | Field and Description |
---|---|
(package private) Graph |
Throughput.TransitionSystem.graph |
private Graph |
ThroughputMcm.hsdfGraph
HSDF graph
|
Modifier and Type | Method and Description |
---|---|
double |
Throughput.calculateThroughput(Graph inputGraph)
Calculates throughput of the graph.
|
Constructor and Description |
---|
Throughput.TransitionSystem(Graph inputGraph) |
ThroughputMcm(Graph hsdfGraph)
Initialize throughput calculator object.
|
Modifier and Type | Field and Description |
---|---|
private Graph |
ParseProfileInfo.graph
Application graph
|
Modifier and Type | Method and Description |
---|---|
Graph |
ParseProfileInfo.parseProfileXml(java.lang.String fileName)
Parse profiling XML file from framework and build application graph.
|
private Graph |
ParseApplicationGraph.parseSdfGraph(org.w3c.dom.Element root)
Top level function to build SDF graph.
|
Graph |
ParseApplicationGraph.parseSingleGraphXml(java.lang.String fileName)
Parse single application graph from XML file.
|
Modifier and Type | Method and Description |
---|---|
java.util.List<Graph> |
ParseApplicationGraph.parseMultipleGraphXml(java.lang.String fileName)
Parse an XML file for application graph and build a graph structure.
|
Modifier and Type | Method and Description |
---|---|
private void |
ParseApplicationGraph.parseActorElement(org.w3c.dom.Node actorNode,
Graph g)
Parse Actor information from XML file.
|
private void |
ParseApplicationGraph.parseActorPropertiesElement(org.w3c.dom.Node actrPropNode,
Graph g)
Parse Actor properties from XML file.
|
private void |
ParseApplicationGraph.parseChannelElement(org.w3c.dom.Node channelNode,
Graph g)
Parse Channel information from XML file.
|
private void |
ParseApplicationGraph.parseChannelPropertiesElement(org.w3c.dom.Node channelPropNode,
Graph g)
Parse Channel properties from XML file.
|
Modifier and Type | Method and Description |
---|---|
void |
DotGraph.generateDotFromGraph(Graph graph,
java.lang.String fileName)
This function generates a Dot File from the input
graph structure.
|
void |
DotGraph.generateJpgFromGraph(Graph graph,
java.lang.String fileName)
This function generates a JPEG File from the input
graph structure.
|
void |
GenerateSdfXml.generateOutput(Graph sdfGraph,
java.lang.String outputFileName)
Generate Application Graph XML file
|
java.lang.String |
DotGraph.getDotDataInString(Graph graph)
This function return a string which contains the code for the DOT file.
|
void |
GanttChart.plotChart(java.util.Map<java.lang.String,java.lang.String> model,
Graph sdfGraph,
java.lang.String outputFileName)
Plot the Gantt chart
|
Modifier and Type | Method and Description |
---|---|
private void |
NonPipelinedScheduleXml.addActorElements(Graph graph,
Solutions solutions,
DesignFlowSolution designSolution,
org.w3c.dom.Document doc,
org.w3c.dom.Element parent)
Add Actor elements in the XML file.
|
private void |
PipelinedScheduleXml.addActorElements(Graph graph,
Solutions solutions,
org.w3c.dom.Document doc,
org.w3c.dom.Element parent)
Add Actor elements in the XML file.
|
private void |
NonPipelinedScheduleXml.addChannelElements(Graph graph,
Solutions solutions,
DesignFlowSolution designSolution,
org.w3c.dom.Document doc,
org.w3c.dom.Element parent)
Add Channel elements in the XML file.
|
private void |
PipelinedScheduleXml.addChannelElements(Graph graph,
Solutions solutions,
org.w3c.dom.Document doc,
org.w3c.dom.Element parent,
java.util.Map<java.lang.String,java.lang.String> schedule)
Add Channel elements in the XML file.
|
private void |
NonPipelinedScheduleXml.addDmaScheduleElement(Graph graph,
Solutions solutions,
DesignFlowSolution designSolution,
Platform platform,
org.w3c.dom.Document doc,
org.w3c.dom.Element parent)
Add DMA information elements in the XML file.
|
private void |
NonPipelinedScheduleXml.addFifoElement(Graph graph,
Solutions solutions,
DesignFlowSolution designSolution,
Platform platform,
org.w3c.dom.Document doc,
org.w3c.dom.Element parent)
Add FIFO elements in the XML file.
|
private void |
PipelinedScheduleXml.addFifoElement(Graph graph,
Solutions solutions,
java.util.Map<java.lang.String,java.lang.String> schedule,
org.w3c.dom.Document doc,
org.w3c.dom.Element parent)
Add FIFO elements in the XML file.
|
private void |
PipelinedScheduleXml.addPostScheduleElement(Graph graph,
Solutions solutions,
java.util.Map<java.lang.String,java.lang.String> schedule,
org.w3c.dom.Document doc,
org.w3c.dom.Element parent)
Add Post schedule element to the XML file.
|
private void |
PipelinedScheduleXml.addPreScheduleElement(Graph graph,
Solutions solutions,
java.util.Map<java.lang.String,java.lang.String> schedule,
org.w3c.dom.Document doc,
org.w3c.dom.Element parent)
Add pre-schedule element to XML file.
|
private void |
NonPipelinedScheduleXml.addScheduleElement(Graph graph,
Solutions solutions,
DesignFlowSolution designSolution,
org.w3c.dom.Document doc,
org.w3c.dom.Element parent)
Add Schedule information elements in the XML file.
|
private void |
PipelinedScheduleXml.addScheduleElement(Graph graph,
Solutions solutions,
java.util.Map<java.lang.String,java.lang.String> schedule,
org.w3c.dom.Document doc,
org.w3c.dom.Element parent)
Add schedule element to the XML file.
|
void |
PipelinedScheduleXml.generateSolutionXml(java.lang.String outputFileName,
Graph graph,
Solutions solutions,
java.util.Map<java.lang.String,java.lang.String> schedule)
Generate pipelined schedule XML for the platform.
|
void |
NonPipelinedScheduleXml.generateSolutionXml(java.lang.String outputFileName,
Graph graph,
Solutions solutions,
Platform platform,
DesignFlowSolution designSolution)
Generate Schedule XML for application schedule to execute on the platform.
|
private java.util.Map<java.lang.Integer,java.lang.String> |
PipelinedScheduleXml.getActorsBelongToK(Graph graph,
java.util.Map<java.lang.String,java.lang.String> schedule,
int k,
int processor,
boolean yPrimeLess) |
Modifier and Type | Method and Description |
---|---|
private void |
PipelinedScheduleXml.addActorElements(Graph graph,
Solutions solutions,
org.w3c.dom.Document doc,
org.w3c.dom.Element parent)
Add Actor elements in the XML file.
|
private void |
NonPipelinedScheduleXml.addActorElements(Graph graph,
Solutions solutions,
org.w3c.dom.Document doc,
org.w3c.dom.Element parent,
java.util.Map<java.lang.String,java.lang.String> model)
Add Actor elements in the XML file.
|
private void |
PipelinedScheduleXml.addChannelElements(Graph graph,
Solutions solutions,
org.w3c.dom.Document doc,
org.w3c.dom.Element parent,
java.util.Map<java.lang.String,java.lang.String> schedule)
Add Channel elements in the XML file.
|
private void |
NonPipelinedScheduleXml.addChannelElements(Graph graph,
Solutions solutions,
org.w3c.dom.Document doc,
org.w3c.dom.Element parent,
java.util.Map<java.lang.String,java.lang.String> model)
Add Channel elements in the XML file.
|
private void |
PipelinedScheduleXml.addPostScheduleElement(Graph graph,
Solutions solutions,
java.util.Map<java.lang.String,java.lang.String> schedule,
org.w3c.dom.Document doc,
org.w3c.dom.Element parent)
Add Post schedule element to the XML file.
|
private void |
PipelinedScheduleXml.addPreScheduleElement(Graph graph,
Solutions solutions,
java.util.Map<java.lang.String,java.lang.String> schedule,
org.w3c.dom.Document doc,
org.w3c.dom.Element parent)
Add pre-schedule element to XML file.
|
private void |
NonPipelinedScheduleXml.addScheduleElement(Graph graph,
Solutions solutions,
org.w3c.dom.Document doc,
org.w3c.dom.Element parent,
java.util.Map<java.lang.String,java.lang.String> model)
Add Schedule information elements in the XML file.
|
private void |
PipelinedScheduleXml.addScheduleElement(Graph graph,
Solutions solutions,
java.util.Map<java.lang.String,java.lang.String> schedule,
org.w3c.dom.Document doc,
org.w3c.dom.Element parent)
Add schedule element to the XML file.
|
void |
PipelinedScheduleXml.generateSolutionXml(java.lang.String outputFileName,
Graph graph,
Solutions solutions,
java.util.Map<java.lang.String,java.lang.String> schedule)
Generate pipelined schedule XML for the platform.
|
void |
NonPipelinedScheduleXml.generateSolutionXml(java.lang.String outputFileName,
Graph graph,
Solutions solutions,
java.util.Map<java.lang.String,java.lang.String> model)
Generate Schedule XML for application schedule to execute on the platform.
|
private java.util.Map<java.lang.Integer,java.lang.String> |
PipelinedScheduleXml.getActorsBelongToK(Graph graph,
java.util.Map<java.lang.String,java.lang.String> schedule,
int k,
int processor,
boolean yPrimeLess) |
Modifier and Type | Field and Description |
---|---|
private Graph |
MappingCommSolver.graph
Application Graph
|
private Graph |
MappingCommSolver.hsdf
Equivalent HSDF graph
|
Constructor and Description |
---|
MappingCommSolver(Graph inputGraph,
Graph hsdf,
Solutions solutions,
Platform platform)
Build a mapping solver.
|
Modifier and Type | Field and Description |
---|---|
protected Graph |
GenericPartitionSolver.graph
Application Graph
|
protected Graph |
GenericPartitionSolver.hsdf
Equivalent HSDF graph of application graph
|
Modifier and Type | Method and Description |
---|---|
private Graph |
PartitionSolverHSDF.modelToPartitionAwareGraph(java.util.Map<java.lang.String,java.lang.String> model)
Convert a solution model to partition aware graph.
|
private Graph |
PartitionSolverSDF.modelToPartitionAwareGraph(java.util.Map<java.lang.String,java.lang.String> model)
Convert a model to partition aware graph by inserting DMA actors.
|
private Graph |
GenericPartitionSolver.modelToPartitionAwareGraph(java.util.Map<java.lang.String,java.lang.String> model)
Convert a model to partition aware graph by inserting DMA actors.
|
Constructor and Description |
---|
GenericPartitionSolver(Graph inputGraph,
Graph hsdf,
Solutions solutions,
Platform platform)
Initialize a generic partition solver object
|
PartitionSolverHSDF(Graph inputGraph,
Graph hsdf,
Solutions solutions,
Platform platform,
java.lang.String outputDirectory)
Initialize a partition solver object
|
PartitionSolverSDF(Graph inputGraph,
Graph hsdf,
Solutions solutions,
Platform platform,
java.lang.String outputDirectory)
Build a partition solver object
|
Modifier and Type | Field and Description |
---|---|
private Graph |
ClusterMutExclNonPipelined.graph
Application Graph
|
private Graph |
ClusterMutExclPipelined.graph |
private Graph |
ClusterMutExclNonPipelined.hsdf
Equivalent HSDF of application graph
|
private Graph |
ClusterMutExclNonPipelined.partitionAwareGraph
Partition aware graph
|
private Graph |
ClusterMutExclPipelined.partitionAwareGraph |
private Graph |
ClusterMutExclNonPipelined.partitionAwareHsdf
Equivalent HSDF of partition aware graph
|
private Graph |
ClusterMutExclPipelined.partitionAwareHsdf |
Modifier and Type | Method and Description |
---|---|
private Graph |
ClusterMutExclNonPipelined.OptimizeSchedule.getBufferConstraintSdf(java.util.HashMap<java.lang.String,java.lang.String> model)
Generate a SDF graph from the model containing buffer size.
|
Modifier and Type | Method and Description |
---|---|
Actor |
ClusterMutExclNonPipelined.OptimizeSchedule.getOutgoingPreviousDmaActor(Actor hsdfActr,
Graph hsdfGraph) |
private void |
ClusterMutExclNonPipelined.OptimizeSchedule.nonLazyConstraints(java.util.HashMap<java.lang.String,java.lang.String> model,
Graph bufferConstraintHsdf)
Generate constraints to make a schedule non-lazy
|
Constructor and Description |
---|
ClusterMutExclNonPipelined(Graph graph,
Graph hsdf,
Solutions solutions,
Graph partitionAwareGraph,
Graph partitionAwareHsdf,
Solutions partitionGraphSolutions,
Platform platform,
java.lang.String outputDirectory,
SchedulingConstraints schedulingConstraints)
Initialize a Cluster scheduler based on mutual exclusion.
|
ClusterMutExclPipelined(Graph graph,
Graph hsdf,
Solutions solutions,
Graph partitionAwareGraph,
Graph partitionAwareHsdf,
Solutions partitionGraphSolutions,
Platform platform,
SchedulingConstraints schedulingConstraints) |
Modifier and Type | Field and Description |
---|---|
protected Graph |
MutualExclusionSolver.graph
Application SDF graph
|
protected Graph |
MutualExclusionSolver.hsdf
Equivalent HSDF graph of application graph
|
Constructor and Description |
---|
MutualExclusionSolver(Graph inputGraph)
Initialize the mutual exclusion solver
|
Modifier and Type | Field and Description |
---|---|
protected Graph |
MatrixSolver.graph
Application graph.
|
protected Graph |
MatrixSolver.hsdf
Equivalent HSDF graph
|
Constructor and Description |
---|
MatrixSolver(Graph inputGraph)
Build a matrix solver object.
|
MutExNonPipelinedScheduling(Graph inputGraph)
Build mutual exclusion solver object
|
Modifier and Type | Field and Description |
---|---|
protected Graph |
UnfoldingScheduling.graph
Application SDF graph
|
protected Graph |
UnfoldingScheduling.hsdf
Equivalent Application HSDF graph
|
Constructor and Description |
---|
MutExPipelinedScheduling(Graph inputGraph)
Build a mutual exclusion pipelined solver
|
UnfoldingScheduling(Graph inputGraph)
Build an unfolding solver for pipelined scheduling
|
Modifier and Type | Field and Description |
---|---|
(package private) Graph |
Channel.graph |
private Graph |
Id.graph |
Modifier and Type | Method and Description |
---|---|
Graph |
Channel.getGraph() |
Graph |
Id.getGraph() |
Modifier and Type | Method and Description |
---|---|
void |
Graph.clone(Graph anotherGraph) |
(package private) void |
Channel.setGraph(Graph g)
Called by the graph when the link is getting assigned to the graph
|
(package private) void |
Id.setGraph(Graph g)
Called by the graph when the object is getting assigned to the graph
|
Constructor and Description |
---|
Graph(Graph referenceGraph)
Build a graph as exactly a copy of another graph.
|
Modifier and Type | Field and Description |
---|---|
private Graph |
ParamComm.graph |
private Graph |
SpdfAnalyzer.graph |
(package private) Graph |
Solutions.Data.graph |
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)
|
private Actor |
Solutions.getArbitraryActor(Graph graph)
pick up the first actor we can get
|
void |
GraphExpressions.parse(Graph graph)
parse the expressions for the periods and rates from textual
form to internal form.
|
void |
ParamComm.setGraph(Graph graph)
set the graph to be managed by this ParamComm object
|
InconsistencyProof |
Solutions.solve(Graph graph,
GraphExpressions expressions)
Use method of "Software Synthesis from Dataflow Graphs" book
of Bhattacharrya, generalized to SPDF graphs
If inconsistency is found and throwExpetion==true (default)
then throws am exception.
|
InconsistencyProof |
Solutions.solve(Graph graph,
GraphExpressions expressions,
Actor startActor)
Solve balance equations.
|
Constructor and Description |
---|
LivenessAcyclic.Data(Graph g) |
SpdfAnalyzer(Graph g) |
Modifier and Type | Field and Description |
---|---|
private Graph |
TryLiveness.graph |
private Graph |
TrySafety.graph |
Modifier and Type | Method and Description |
---|---|
private static Graph |
TryApplicationXML.buildExpectedGraph()
This function builds the SDF graph that is being represented in the XML file.
|
protected Graph |
TestBase.constructGraph(int numA,
int numP,
java.lang.String[][] gs,
java.lang.String[][] md)
Construct an SPDF graph.
|
Modifier and Type | Method and Description |
---|---|
private static void |
TrySolutions.checkSolutions(Graph graph,
Solutions solutions) |
private void |
TestBase.setPortRate(Graph g,
java.lang.String actorName,
java.lang.String portName,
java.lang.String rate) |
private static void |
TryApplicationXML.validateTestOutput(Graph generatedGraph)
This procedure validates the graph that is built by the XML parser
against the model.
|
private static void |
TrySpdf.validateTestOutput(Graph graph,
Solutions solution) |
Modifier and Type | Field and Description |
---|---|
private Graph |
TryQuasiStatic.graph |
private Graph |
QuasiStaticScheduling.graph |
private Graph |
QuasiStaticScheduling.multiplicityGraph |
Modifier and Type | Method and Description |
---|---|
private void |
QuasiStaticScheduling.createNewLink(Graph graph,
Actor oppositeActor,
Port oppositePort,
Actor newActor,
Channel oldChannel) |
private Actor |
QuasiStaticScheduling.getStartActor(Graph graph) |
private java.util.Queue<Actor> |
QuasiStaticScheduling.topologicalSort(Graph graph) |
Constructor and Description |
---|
QuasiStaticScheduling(Graph graph,
ParamComm paramcomm,
Solutions solutions) |