CSC/ECE 506 Fall 2007/wiki2 6 sbh: Difference between revisions
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
Wiki: MSIMD applications MSIMD architectures have garnered quite a bit of contention recently. Read a few papers on these architectures and write a survey of applications for which they would be suitable. If possible, talk about the steps in parallelizing these applications (decomposition, assignment, orchestration, and mapping). | Wiki: MSIMD applications MSIMD architectures have garnered quite a bit of contention recently. Read a few papers on these architectures and write a survey of applications for which they would be suitable. If possible, talk about the steps in parallelizing these applications (decomposition, assignment, orchestration, and mapping). | ||
[http://www.lib.ncsu.edu:2178/iel2/294/2914/00089460.pdf?tp=&arnumber=89460&isnumber=2914]The GPA Machine: A Generally Partitionable MSIMD Architectures | |||
The GPA machine has shown to be beneficial to algorithms based on dynamic data structures and fragmented partitions. These algorithms will show substatial speedup on this architecture. Multi-user operating system development will also benefit from this architecture. A main benefit of the GPA machine architecture is the ability to allocate resources based on availability and need. | |||
[http://www.lib.ncsu.edu:2178/iel3/1599/4340/00168054.pdf?tp=&arnumber=168054&isnumber=4340]A MSIMD Architecture for Feature Tracking | |||
The Warwick Pyramid Machine (WPM) allows for the faster tracking of features within images. Each SIMD cluster within the WPM works on a region of the image. Iconic data is processed in the MSIMD array. | |||
[http://citeseer.ist.psu.edu/cache/papers/cs/2442/http:zSzzSzwww.ce.chalmers.sezSzstaffzSzmickezSztencon96.pdf/a-multiple-simd-approach.pdf]A Multiple SIMD Approach to Radar Signal Processing | |||
Revision as of 19:03, 23 September 2007
Wiki: MSIMD applications MSIMD architectures have garnered quite a bit of contention recently. Read a few papers on these architectures and write a survey of applications for which they would be suitable. If possible, talk about the steps in parallelizing these applications (decomposition, assignment, orchestration, and mapping).
[1]The GPA Machine: A Generally Partitionable MSIMD Architectures
The GPA machine has shown to be beneficial to algorithms based on dynamic data structures and fragmented partitions. These algorithms will show substatial speedup on this architecture. Multi-user operating system development will also benefit from this architecture. A main benefit of the GPA machine architecture is the ability to allocate resources based on availability and need.
[2]A MSIMD Architecture for Feature Tracking
The Warwick Pyramid Machine (WPM) allows for the faster tracking of features within images. Each SIMD cluster within the WPM works on a region of the image. Iconic data is processed in the MSIMD array.
[3]A Multiple SIMD Approach to Radar Signal Processing