mapss.dif.csdf.sdf
Class SDFRandomTreeGenerator

java.lang.Object
  mapss.dif.DIFRandomGraphGenerator
      mapss.dif.csdf.sdf.SDFRandomGraphGenerator
          mapss.dif.csdf.sdf.SDFRandomTreeGenerator

public class SDFRandomTreeGenerator
extends SDFRandomGraphGenerator

Random graph generator in generating random SDF trees. SDF trees are useful in that it is possible for scheduling heuristics, like MinBufferStrategy, to reach the minimum buffer cost. Please reference

M. CUBRIC and P. PANANGADEN. "Minimal memory schedules for dataflow networks". In E.Best, editor, In Proceedings of the 4th Intl. Conf. on Concurrency Theory (CONCUR ‘93, Hildesheim, Germany, Aug. 1993), Lecture Notes in Computer Science 715, 368-383.

Version:

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

Author:

Mingyung Ko

Field Summary

Fields inherited from class mapss.dif.DIFRandomGraphGenerator

_graph, _incidence, _reachability

Constructor Summary

SDFRandomTreeGenerator()
Constructor with node count.

Method Summary

DIFGraph

graph(int nodeCount) Generate a random acyclic SDF graph with the desired node count.

Methods inherited from class mapss.dif.csdf.sdf.SDFRandomGraphGenerator

_initialize, _makeRandomRates, _reset, getRepetitions, setMaxRate, setOneProbability

Methods inherited from class mapss.dif.DIFRandomGraphGenerator

_initialize, _isIncident, _isReachable, _makeDAG, _randomNonNegativeInt, graph, graphs, setMaxFanIn, setMaxFanOut

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

SDFRandomTreeGenerator

public SDFRandomTreeGenerator()

Constructor with node count.

Method Detail

graph

public DIFGraph graph(int nodeCount)

Generate a random acyclic SDF graph with the desired node count.

Overrides:

graph in class SDFRandomGraphGenerator

Parameters:

nodeCount - The desired node count.

Returns:

The random graph in DIFGraph.