Name
randdfg — random Data Flow Graph (DFG) generator.
Synopsis
DFG=RANDDFG(N,M,DEGMAX,NE)
G=RANDDFG(N,M,DEGMAX,NE,NEH,HMAX)
Description
DFG=RANDDFG(N,M,DEGMAX,NE) generates DFG, where N is the number of nodes in the graph DFG, M is the number of dedicated processors. Relation of node to a processor is stored in 'G.N(i).UserParam'. Parameter DEGMAX restricts upper bound of outdegree of vertices. NE is number of edges. Resultant graph is Direct Acyclic Graph (DAG).
G=RANDDFG(N,M,DEGMAX,NE,NEH,HMAX) generates cyclic DFG (CDFG), where NEH is number of edges with parameter '0 < G.E(i).UserParam <= HMAX'. Other edges has user parameter 'G.E(i).UserParam=0'.
Webmaster - Jan Dvořák (2004 - 2024)