Parallel programming: accelerator track 5
  • John Urbanic, PRACE, XSEDE, RIKEN, Compute Canada
  • June 2016

Slide contents

  • Hybrid Programming
  • Assuming you know basic MPI
  • Hybrid OpenACC Programming (Fast & Wrong)
  • Hybrid OpenACC Programming (Slow and Right)
  • Hybrid OpenACC Programming (Much Better)
  • Hybrid OpenMP Programming (Most “complex” version: MPI_THREAD_MULTIPLE)
  • Mix and Match
  • Bottom Line…
  • In Conclusion…
  • Hybrid Challenge Head Start
  • Simplest Decomposition for C Code
  • Simplest Decomposition for Fortran Code
  • Boundary Conditions
  • How do you know you are correct?
  • How do you know you are correct?
  • All the action is here.
  • Check for yourself.
  • Running to convergence
  • Send_init and Recv_init as used by a Summer Boot Camp Hybrid Challenge winner
  • Running to convergence
  • Send_init and Recv_init as used by a Summer Boot Camp Hybrid Challenge winner
  • Rules and Regulations of the 2nd Annual IHPCSS Challenge
  • General Rules
  • Some Specifics
  • Rules For Lawyers
  • Reality Checks
  • Suggested Things to Explore
  • Decision