Graph contraction for mapping data on parallel computers: A quality–cost tradeoff

Keyphrases

• Parallel Computer 100%
• Mapping Data 100%
• Graph Contraction 100%
• Original Problem 40%
• Parallel Graph 40%
• Mapping Solution 40%
• Optimization Methods 20%
• Genetic Algorithm 20%
• Computational Fluid Dynamics 20%
• Execution Time 20%
• Good Quality 20%
• Substantial Reduction 20%
• Problem Size 20%
• Dynamic Applications 20%
• Heuristic Algorithms 20%
• Problem Domain 20%
• Mapping Time 20%
• Simulated Annealing 20%
• Physical Optimization 20%
• Cost-quality Trade-off 20%
• Associated Application 20%
• Contracted Graph 20%
• Small Representations 20%
• Quality Mapping 20%
• Contraction Algorithm 20%

Computer Science

• Data Mapping 100%
• Experimental Result 100%
• Parallel Computer 100%
• Execution Time 50%
• Genetic Algorithm 50%
• Heuristic Algorithm 50%
• Simulated Annealing 50%
• Problem Domain 50%