Importance of Runtime Considerations in Performance Engineering of Large-Scale Distributed Graph Algorithms.
Jesun Sahariar FirozThejaka Amila KanewalaMarcin ZalewskiMartina BarnasAndrew LumsdainePublished in: Euro-Par Workshops (2015)
Keyphrases
- graph theory
- theoretical analysis
- computationally efficient
- computational cost
- random walk
- distributed systems
- artificial intelligence
- graph structure
- distributed environment
- significant improvement
- cooperative
- optimization problems
- worst case
- lower bound
- data structure
- real world
- weighted graph
- minimum spanning tree
- graph search
- maximum flow
- partitioning algorithm
- strongly connected
- massive graphs