Designing multithreaded algorithms for Breadth-First Search and si-connectivity on the Cray MTA-2

Keyphrases

• Cray 100%
• Multi-threaded Algorithms 100%
• Breadth-first Search 100%
• Scientific Domain 33%
• Large-scale Networks 33%
• Parallel Computing 33%
• Graph Theory 33%
• Sparse Graphs 33%
• High Performance 33%
• Parallel Implementation 33%
• Architectural Features 33%
• Computational Problems 33%
• Shortest Path 33%
• Multithreaded Architectures 33%
• Scalable Performance 33%
• Execution Time 33%
• Time Performance 33%
• Unweighted Graph 33%
• Graph Algorithms 33%
• Parallel Performance 33%
• Scale-free 33%
• Engineering Domains 33%
• St-connectivity 33%
• Irregular Graph 33%
• Scale-free Graphs 33%
• Parallel Graph Algorithms 33%
• Sequential Implementation 33%
• Graph Abstraction 33%
• Performance Graph 33%
• Sparse Random Graphs 33%

Computer Science

• Graph Algorithms 100%
• Graph Theory 50%
• Parallel Computing 50%
• Computational Problem 50%
• Execution Time 50%
• Parallel Implementation 50%
• Random Graphs 50%
• Sequential Implementation 50%
• Domain Engineering 50%