An abstraction-refinement framework for priority-driven scheduling of static dataflow graphs.

Adnan Bouakaz Thierry Gautier

Published in: MEMOCODE (2014)

Keyphrases

theoretical framework
data driven
main contribution
response time
directed graph
bipartite graph
data flow
graph partitioning