mapss.dif.csdf.sdf.sched
Class SDPPOStrategy

java.lang.Object
  mapss.dif.DIFScheduleStrategy
      mapss.dif.csdf.sdf.sched.DPPOStrategy
          mapss.dif.csdf.sdf.sched.SDPPOStrategy

All Implemented Interfaces:

mocgraph.analysis.analyzer.Analyzer, mocgraph.analysis.analyzer.GraphAnalyzer, mocgraph.sched.ScheduleAnalyzer

public class SDPPOStrategy
extends DPPOStrategy

A DPPO scheduler for buffer sharing.

Version:

$Id: SDPPOStrategy.java 406 2007-05-10 14:27:07Z plishker $

Author:

Mingyung Ko

Field Summary

Fields inherited from class mapss.dif.csdf.sdf.sched.DPPOStrategy

_lexicalOrder, _tableDimension

Fields inherited from class mapss.dif.DIFScheduleStrategy

_clusterManager

Constructor Summary

SDPPOStrategy(SDFGraph graph, java.util.List lexicalOrder)
Constructor for a given graph and a lexical order.

Method Summary

protected void	_optimumFor(int i, int j) The optimal buffer sharing results along elements of index i to j.
java.lang.String	toString() A desrciption of the scheduler.

Methods inherited from class mapss.dif.csdf.sdf.sched.DPPOStrategy

_bufferCost, _computeDPPO, _computeSchedule, _crossingSDFEdges, _DPPOTableElement, _SDFEdges, _SDFNodes, _verifyIndices, _verifyIndices, optimalCost, schedule, setLexicalOrder

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

SDPPOStrategy

public SDPPOStrategy(SDFGraph graph,
                     java.util.List lexicalOrder)

Constructor for a given graph and a lexical order.

Parameters:

graph - The given SDF graph.

lexicalOrder - The lexical order in the form of List.

Method Detail

toString

public java.lang.String toString()

A desrciption of the scheduler.

Specified by:

toString in interface mocgraph.analysis.analyzer.Analyzer

Overrides:

toString in class DPPOStrategy

Returns:

A text description.

_optimumFor

protected void _optimumFor(int i,
                           int j)

The optimal buffer sharing results along elements of index i to j. The optimal cost and split are stored in the associated table element.

Specified by:

_optimumFor in class DPPOStrategy

Parameters:

i - The element with index i.

j - The element with index j.