Chapter 4a: Brandon Chisholm, Chris Barile: Difference between revisions
Jump to navigation
Jump to search
m (→References: Added wiki page to reflist) |
(Added Introduction) |
||
| Line 1: | Line 1: | ||
Automatic Parallelism is the process of automatically converting sequential code into code that will make use of multiple processors. One main reason for implementing automatic parallelism is to save time and energy compared to converting the code manually. There are several techniques that have been created for parallelizing code, but each has limitations. | |||
== Techniques == | == Techniques == | ||
===Profile-Driven Parallelism=== | ===Profile-Driven Parallelism=== | ||
===Polyhedral Transformation=== | ===Polyhedral Transformation=== | ||
Revision as of 17:31, 19 March 2012
Automatic Parallelism is the process of automatically converting sequential code into code that will make use of multiple processors. One main reason for implementing automatic parallelism is to save time and energy compared to converting the code manually. There are several techniques that have been created for parallelizing code, but each has limitations.
Techniques
Profile-Driven Parallelism
Polyhedral Transformation
Automatic Program Exploration
Scalar and Array Analysis
Commutativity Analysis
Low Level Virtual Machine
Limitations
Notes
References
<references> <ref name="chia">http://www.eecs.berkeley.edu/%7Echiayuan/cs262a/cs262a_parallel.pdf</ref> <ref name="dipa">http://www.csc.villanova.edu/%7Etway/publications/DiPasquale_Masplas05_Paper5.pdf</ref> <ref name="wiki">http://en.wikipedia.org/wiki/Automatic_parallelization</ref> </references>