OpenMP in Small Bites/Tasking - Revision history

Simon-schwitanski-3f90@rwth-aachen.de at 08:48, 18 January 2021

2021-01-18T08:48:47Z

2020-12-04T15:31:35Z

Tweak title

2020-12-04T15:31:07Z

Tweak page sorting

2020-12-04T14:51:30Z

Add DISPLAYTITLE

2020-12-01T08:31:06Z

2020-12-01T08:30:19Z

2020-11-30T19:06:43Z

2020-11-30T19:05:40Z

2020-11-30T16:03:01Z

2020-11-30T16:01:04Z

@@ Line 44: / Line 44: @@
 {{hidden begin
-|title = 3. Why can it be benficial for the performance to use cut-off strategies for task-based OpenMP programs?
+|title = 3. Why can it be beneficial for the performance to use cut-off strategies for task-based OpenMP programs?
 }}
 <quiz display=simple>
@@ Line 51: / Line 51: @@
 + It can avoid overhead caused by too fine-grained tasks.
 || Correct.
-- It can synchonize tasks faster.
+- It can synchronize tasks faster.
 || Wrong.
 - It can accelerate task stealing be enforcing one task queue per thread.

@@ Line 1: / Line 1: @@
 [[Category:Tutorials|Tasking (OpenMP)]]<nowiki />
-{{DISPLAYTITLE:OpenMP Tasking}}<nowiki />
+{{DISPLAYTITLE:Tasking (OpenMP)}}<nowiki />
 {{Syllabus OpenMP in Small Bites}}<nowiki />
 __TOC__

@@ Line 1: / Line 1: @@
-[[Category:Tutorials]]<nowiki />
+[[Category:Tutorials|Tasking (OpenMP)]]<nowiki />
 {{DISPLAYTITLE:OpenMP Tasking}}<nowiki />
 {{Syllabus OpenMP in Small Bites}}<nowiki />

@@ Line 1: / Line 1: @@
 [[Category:Tutorials]]<nowiki />
 {{Syllabus OpenMP in Small Bites}}<nowiki />
 __TOC__

@@ Line 9: / Line 9: @@
 <youtube width="600" height="340" right>lALAUBDszrU</youtube>
-([[Media:hpc.nrw_05_Introduction-Tasking.pdf | Slides as pdf]])
+([[Media:Hpc.nrw_05_Introduction-Tasking.pdf | Slides as pdf]])
 == Quiz ==

← Older revision		Revision as of 08:30, 1 December 2020
Line 8:		Line 8:

	<youtube width="600" height="340" right>lALAUBDszrU</youtube>		<youtube width="600" height="340" right>lALAUBDszrU</youtube>
		+
		+	([[Media:hpc.nrw_05_Introduction-Tasking.pdf \| Slides as pdf]])

	== Quiz ==		== Quiz ==

@@ Line 3: / Line 3: @@
 __TOC__
-This video introduces another way to to express parallelism in OpenMP: Tasking. This concept enables the programmer to parallelize code regions with non-canonical loop forms or regions which do not use loops at all (including recursive algorithms). The video explains how use OpenMP tasking, how to synchonize, how to deal with cut-off strategies and how an OpenMP runtime environment manages the tasks in queues. More examples and details about [[OpenMP_in_Small_Bites/Tasking_and_Data_Scoping|Tasking and Data Scoping]] as well as [[OpenMP_in_Small_Bites/Tasking_and_Synchronization| Tasking_and_Synchronization]] are given in further parts of this tutorial.
+This video introduces another way to to express parallelism in OpenMP: Tasking. This concept enables the programmer to parallelize code regions with non-canonical loop forms or regions which do not use loops at all (including recursive algorithms). The video explains how to use OpenMP tasking, how to synchonize, how to deal with cut-off strategies and how an OpenMP runtime environment manages the tasks in queues. More examples and details about [[OpenMP_in_Small_Bites/Tasking_and_Data_Scoping|Tasking and Data Scoping]] as well as [[OpenMP_in_Small_Bites/Tasking_and_Synchronization| Tasking_and_Synchronization]] are given in further parts of this tutorial.
 == Video ==

@@ Line 24: / Line 24: @@
 {{hidden begin
-|title = 2. Which tasks are synchronized with by a <code>taskyield</code> construct?
+|title = 2. Which tasks are synchronized with by a <code>taskwait</code> construct?
 }}
 <quiz display=simple>

@@ Line 16: / Line 16: @@
 - Always <code>firstprivate</code>.
 || Wrong.
-+ <code>firstprivate</code> unless shared in the enclosing context.
++ <code>firstprivate</code> unless <code>shared</code> in the enclosing context.
 || Correct.
 - <code>shared</code> unless <code>firstprivate</code> in the enclosing context.