1 / 19

Reducing Parallel Overhead

Reducing Parallel Overhead. Introduction to Parallel Programming – Part 12. Review & Objectives. Previously: Use loop fusion, loop fission, and loop inversion to create or improve opportunities for parallel execution

lauren
Download Presentation

Reducing Parallel Overhead

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Reducing Parallel Overhead Introduction to Parallel Programming – Part 12

  2. Review & Objectives • Previously: • Use loop fusion, loop fission, and loop inversion to create or improve opportunities for parallel execution • Explain why it can be difficult both to optimize load balancing and maximize locality • At the end of this part you should be able to: • Explain the pros and cons of static versus dynamic loop scheduling • Explain the different OpenMP schedule clauses and the situations each one is best suited for

  3. Reducing Parallel Overhead • Loop scheduling • Replicating work

  4. Loop Scheduling Example • for (i = 0; i < 12; i++) • for (j = 0; j <= i; j++) • a[i][j] = ...;

  5. Loop Scheduling Example • #pragmaomp parallel for • for (i = 0; i < 12; i++) • for (j = 0; j <= i; j++) • a[i][j] = ...; How are the iterations divided among threads?

  6. Loop Scheduling Example • #pragmaomp parallel for • for (i = 0; i < 12; i++) • for (j = 0; j <= i; j++) • a[i][j] = ...; Typically, the iterations are divided by the number of threads and assigned as chunks to a thread

  7. Loop Scheduling • Loop schedule: how loop iterations are assigned to threads • Static schedule: iterations assigned to threads before execution of loop • Dynamic schedule: iterations assigned to threads during execution of loop • The OpenMP schedule clause affects how loop iterations are mapped onto threads

  8. The schedule clause • schedule(static [,chunk]) • Blocks of iterations of size “chunk” to threads • Round robin distribution • Low overhead, may cause load imbalance • Best used for predictable and similar work per iteration

  9. Loop Scheduling Example • #pragmaomp parallel for schedule(static, 2) • for (i = 0; i < 12; i++) • for (j = 0; j <= i; j++) • a[i][j] = ...;

  10. The schedule clause • schedule(dynamic[,chunk]) • Threads grab “chunk” iterations • When done with iterations, thread requests next set • Higher threading overhead, can reduce load imbalance • Best used for unpredictable or highly variable work per iteration

  11. Loop Scheduling Example • #pragmaomp parallel for schedule(dynamic, 2) • for (i = 0; i < 12; i++) • for (j = 0; j <= i; j++) • a[i][j] = ...;

  12. The schedule clause • schedule(guided[,chunk]) • Dynamic schedule starting with large block • Size of the blocks shrink; no smaller than “chunk” • Best used as a special case of dynamic to reduce scheduling overhead when the computation gets progressively more time consuming

  13. Loop Scheduling Example • #pragmaomp parallel for schedule(guided) • for (i = 0; i < 12; i++) • for (j = 0; j <= i; j++) • a[i][j] = ...;

  14. Replicate Work • Every thread interaction has a cost • Example: Barrier synchronization • Sometimes it’s faster for threads to replicate work than to go through a barrier synchronization

  15. Before Work Replication • for (i = 0; i < N; i++) a[i] = foo(i); • x = a[0] / a[N-1]; • for (i = 0; i < N; i++) b[i] = x * a[i]; • Both for loops are amenable to parallelization

  16. First OpenMP Attempt • #pragmaomp parallel • { • #pragmaomp for • for (i = 0; i < N; i++) a[i] = foo(i); • #pragmaomp single • x = a[0] / a[N-1]; • #pragmaomp for • for (i = 0; i < N; i++) b[i] = x * a[i]; • } • Synchronization among threads required if x is shared and one thread performs assignment Implicit Barrier

  17. After Work Replication • #pragmaomp parallel private (x) • { • x = foo(0) / foo(N-1); • #pragmaomp for • for (i = 0; i < N; i++) { • a[i] = foo(i); • b[i] = x * a[i]; • } • }

  18. References • Rohit Chandra, Leonardo Dagum, Dave Kohr, Dror Maydan, Jeff McDonald, and Ramesh Menon, Parallel Programming in OpenMP, Morgan Kaufmann (2001). • Peter Denning, “The Locality Principle,” Naval Postgraduate School (2005). • Michael J. Quinn, Parallel Programming in C with MPI and OpenMP, McGraw-Hill (2004).

More Related