Content deleted Content added
m Minor edits |
No edit summary |
||
Line 213:
</syntaxhighlight>
Note that now loop1 and loop2 can be executed in parallel. Instead of single instruction being performed in parallel on different data as in data level parallelism, here different loops perform different tasks on different data. We call this type of parallelism either function or task parallelism.
== Steps to parallelization ==
The process of parallelizing a sequential program can be broken down into four discrete steps.<ref name="Solihin" />
{| class="wikitable"
|-
! Type
! Description
|-
| Decomposition
| The program is broken down into tasks, the smallest exploitable unit of concurrence.
|-
| Assignment
| Tasks are assigned to processes.
|-
| Orchestration
| Data access, communication, and synchronization of processes.
|-
| Mapping
| Processes are bound to processors.
|}
== References ==
| |||