Symbolic Buffer Sizing for Throughput-Optimal Scheduling of Dataflow Graphs.
Adnan BouakazPascal FradetAlain GiraultPublished in: RTAS (2016)
Keyphrases
- optimal scheduling
- buffer size
- graph transformation
- buffer allocation
- scheduling algorithm
- response time
- scheduling problem
- loss probability
- graph matching
- graph representation
- control flow
- graph theory
- graph databases
- blocking probability
- buffer management
- symbolic representation
- graph theoretic
- neural network
- weighted graph
- graph structure
- design methodology
- np hard