Buffer minimization in earliest-deadline first scheduling of dataflow graphs.
Adnan BouakazJean-Pierre TalpinPublished in: LCTES (2013)
Keyphrases
- scheduling algorithm
- graph transformation
- response time
- scheduling problem
- series parallel
- graph theory
- real time database systems
- graph matching
- buffer size
- graph mining
- data flow
- graph representation
- graph databases
- objective function
- resource constraints
- graph theoretic
- graph structures
- database machine
- spanning tree
- control flow
- design methodology
- bipartite graph
- np hard