CHAPTER 5: Applications

Here we explore full applications and compare the implementations using shared memory, message passing, or CUDA.

• 5.1 AI Applications - Minimax Algorithm
  • 5.1.0 Introduction
  • 5.1.1 Example: Tic-Tac-Toe
  • 5.1.2 Minimax Tree Search
  • 5.1.3 Minimax with Serial Depth First Search
  • 5.1.4 Parallelizing Depth-First Search
  • 5.1.5 Programming Implementations
  • Serial Implementation
  • OpenMP Implementation
  • MPI Implementation
  • 5.1.6 Further exploration
• 5.2 Matrix Multiplication
  • Getting the code for these examples
  • The problem
  • Implementations
  • Complete Matrix Multiply code
  • Building the code
  • Experimenting with the programs
  • Scalability is good
  • Future Considerations

You have attempted of activities on this page