Traversing large graphs on GPUs with unified memory

Keyphrases

• Large Graphs 100%
• Unified Memory 100%
• Graph Compression 100%
• Host Memory 100%
• Limited Capacity 50%
• Preprocessing Techniques 50%
• Data Access Pattern 50%
• Undirected Graph 50%
• Traversal 50%
• Breadth-first Search 50%
• Problem Space 50%
• Real-world Graphs 50%
• Graph Applications 50%
• Low Computational 50%
• Graph Traversal 50%
• Static Graph 50%
• Unified Virtual Memory 50%
• Graph Bisection 50%
• Reordering Algorithms 50%
• GPU Memory 50%
• Computational Intensity 50%
• Irregular Data 50%
• Ordering Problem 50%
• Recursive Graph 50%
• Graph Reordering 50%

Computer Science

• Virtual Memory 100%
• Preprocessing Step 100%
• Data Access Pattern 100%
• Directed Graphs 100%
• Graph Traversal 100%
• Application Graph 100%