Multiprocessor Scheduling of an SDF Graph with Library Tasks Considering the Worst Case Contention Delay.
Hanwoong JungHyunok OhSoonhoi HaPublished in: ESTIMedia (2016)
Keyphrases
- worst case
- graph theory
- average case
- upper bound
- objective function
- random walk
- computational complexity
- structured data
- graph representation
- graph databases
- graph structure
- random graphs
- undirected graph
- graph model
- bipartite graph
- approximation algorithms
- greedy algorithm
- error bounds
- transfer learning
- np complete
- sufficient conditions