public class CalculateBounds
extends java.lang.Object
Modifier and Type | Field and Description |
---|---|
private Graph |
graph
Graph to be analysed
|
private Graph |
hsdf
HSDF of the same graph.
|
private int |
maxBufferSize
Maximum Latency to be used for a design space exploration.
|
private int |
maxLatency
Maximum Latency to be used for a design space exploration.
|
private int |
maxProcessors
Maximum Number of processors to be used for a design space exploration.
|
private int |
minBufferSize
Minimum Buffer Size to be used for a design space exploration.
|
private int |
minLatency
Minimum Latency to be used for a design space exploration.
|
(package private) int |
minPeriod
Minimum Period to be used for a design space exploration.
|
private Solutions |
solutions
Solutions of the graph containing repetition count.
|
Constructor and Description |
---|
CalculateBounds(Graph graph,
Graph hsdf,
Solutions solutions)
Initialize the bounds calculation object.
|
CalculateBounds(Graph graph,
Solutions solutions)
Initialize the bounds calculation object.
|
Modifier and Type | Method and Description |
---|---|
int |
findGraphMaxLatency()
Maximum latency of the graph for scheduling.
|
int |
findGraphMaxPeriod()
Maximum period for the period exploration of the graph.
|
int |
findGraphMinLatency()
Finds minimum latency of the graph
|
int |
findGraphMinPeriod()
Minimum Period for the exploration of the graph.
|
int |
findMaxBufferSizeInBytes()
Maximum buffer size for an application in terms of bytes.
|
int |
findMaxBufferSizeInTokens()
Maximum buffer size for an application in terms of tokens.
|
int |
findMaxCommunicationCost()
Communication cost for a channel is calculated as
(source port rate * token size ).
|
int |
findMaxProcessors()
A loose bound on maximum number of processors that can be used for scheduling.
|
int |
findMinBufferSizeInBytes()
Minimum buffer size required for execution of application in terms of bytes.
|
int |
findMinBufferSizeInTokens()
Minimum buffer size required for execution of application in terms of tokens.
|
int |
findMinCommunicationCost()
Communication cost for a channel is calculated as
(source port rate * token size ).
|
int |
findMinWorkLoad()
Find minimum workload for exploration.
|
int |
findTotalWorkLoad()
Total workload will be equal to sum of execution times
of all the actors in the graph.
|
private Graph graph
private Graph hsdf
private Solutions solutions
private int maxProcessors
int minPeriod
private int minLatency
private int maxLatency
private int minBufferSize
private int maxBufferSize
public CalculateBounds(Graph graph, Graph hsdf, Solutions solutions)
graph
- input graph to be analyzedhsdf
- equivalent HSDF graphsolutions
- solutions of the input graphpublic int findMinWorkLoad()
public int findMinCommunicationCost()
public int findMaxCommunicationCost()
public int findTotalWorkLoad()
public int findMaxProcessors()
public int findMaxBufferSizeInBytes()
public int findMaxBufferSizeInTokens()
public int findMinBufferSizeInBytes()
public int findMinBufferSizeInTokens()
public int findGraphMinPeriod()
public int findGraphMaxPeriod()
public int findGraphMinLatency()
public int findGraphMaxLatency()