Scheduling Precedence Constrained Task Graphs with Non-Negligible Intertask Communication onto Multiprocessors.
C. SelvakumarC. Siva Ram MurthyPublished in: IEEE Trans. Parallel Distributed Syst. (1994)
Keyphrases
- scheduling problem
- flow control
- series parallel
- graph theory
- scheduling algorithm
- communication networks
- resource constraints
- graph matching
- distributed memory
- complex structures
- communication cost
- communication systems
- communication overhead
- round robin
- information exchange
- parallel implementation
- graph structure
- information sharing
- graph theoretic
- computer networks
- resource allocation
- multithreading
- neural network