K-Periodic schedules for evaluating the maximum throughput of a Synchronous Dataflow graph.
Bruno BodinAlix Munier KordonBenoît Dupont de DinechinPublished in: ICSAMOS (2012)
Keyphrases
- graph transformation
- response time
- scheduling problem
- graph theory
- random walk
- graph structure
- bipartite graph
- graph model
- graph representation
- graph theoretic
- connected components
- database machine
- data flow
- link analysis
- graph matching
- directed acyclic graph
- graph databases
- web graph
- weighted graph
- control flow
- structured data
- asynchronous communication
- computational complexity