Memory-constrained static rate-optimal scheduling of synchronous dataflow graphs via retiming.
Xue-Yang ZhuMarc GeilenTwan BastenSander StuijkPublished in: DATE (2014)
Keyphrases
- optimal scheduling
- graph transformation
- memory size
- scheduling problem
- scheduling algorithm
- memory requirements
- graph theory
- disk resident
- graph clustering
- memory usage
- graph matching
- dynamic graph
- random access
- asynchronous communication
- pruning power
- limited memory
- memory space
- computing power
- graph theoretic
- graph representation
- parallel computing
- design methodology
- data flow
- graph structure
- bipartite graph
- main memory
- directed graph
- graph kernels