Complexity of Task Graph Scheduling with Fixed Communication Capacity.
Lucian FintaZhen LiuPublished in: Int. J. Found. Comput. Sci. (1997)
Keyphrases
- resource requirements
- capacity allocation
- series parallel
- resource allocation
- worst case
- graph structure
- communication systems
- fixed number
- graph model
- bipartite graph
- computational cost
- scheduling algorithm
- scheduling problem
- communication overhead
- decision problems
- computational complexity
- directed graph
- communication networks
- graph matching
- directed acyclic graph
- spanning tree
- structured data
- communication technologies
- graph partitioning
- round robin
- flexible manufacturing systems
- bounded treewidth
- random walk
- graph based algorithm