|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectmapss.dif.DIFScheduleStrategy
mapss.dif.csdf.sdf.sched.MinBufferStrategy
public class MinBufferStrategy
A minimum buffer cost scheduler for SDF graphs. This is an implementation of the algorithm available in the book "Software Synthesis from Dataflow Graphs" by Shuvra S. Bhattacharyya, Praveen K. Murthy, and Edward A. Lee, page 54.
| Field Summary |
|---|
| Fields inherited from class mapss.dif.DIFScheduleStrategy |
|---|
_clusterManager |
| Constructor Summary | |
|---|---|
MinBufferStrategy(SDFGraph graph)
Constructor of an SDFGraph. |
|
| Method Summary | |
|---|---|
int |
bufferCost()
Get total buffer cost for the associated graph and the computed schedule. |
int |
bufferCost(mocgraph.Edge edge)
Get buffer cost for the SDF edge. |
mocgraph.sched.Schedule |
schedule()
Compute a minimum buffer schedule. |
java.lang.String |
toString()
A description of minimum buffer scheduler. |
| Methods inherited from class mapss.dif.DIFScheduleStrategy |
|---|
getClusterManager, graph, valid |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
| Constructor Detail |
|---|
public MinBufferStrategy(SDFGraph graph)
SDFGraph.
graph - The given SDF graph.| Method Detail |
|---|
public int bufferCost(mocgraph.Edge edge)
edge - The SDF edge.
public int bufferCost()
public mocgraph.sched.Schedule schedule()
schedule in interface mocgraph.sched.ScheduleAnalyzerschedule in class DIFScheduleStrategypublic java.lang.String toString()
toString in interface mocgraph.analysis.analyzer.AnalyzertoString in class DIFScheduleStrategy
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||