Spanning tree routing strategies for divisible load scheduling on arbitrary graphs - A comparative performance analysis.
Sivakumar ViswanathanBharadwaj VeeravalliJingxi JiaPublished in: HiPC (2009)
Keyphrases
- spanning tree
- minimum spanning tree
- minimum spanning trees
- minimum cost
- edge disjoint
- undirected graph
- minimum weight
- load balancing
- load balance
- scheduling problem
- weighted graph
- traffic load
- round robin
- edge weights
- shortest path
- routing problem
- scheduling algorithm
- routing protocol
- data structure
- bayesian networks
- response time
- graph theory
- query processing
- routing algorithm
- scheduling policies
- ad hoc networks