By Topic

Exploitation of control parallelism in data parallel algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
V. Garg ; Sch. of Electr. and Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA ; D. E. Schimmel

This paper considers the matrix decomposition A=LDLT, as a vehicle to explore the improvement in performance obtainable through the execution of multiple streams of control on SIMD architectures. Several methods for partitioning the SIMD array are considered. Architectural support for and feasibility of using control parallelism in SIMD algorithms is briefly considered. Techniques for converting the extracted control parallelism into increased performance are illustrated via their application to the example algorithm. Analytical expressions for execution times are expressed in terms of execution times of the constituent operations. Experimental results for the various partitioning schemes based on execution traces are also presented. Timings based on MasPar MP-2 operations and extrapolated from experimental data are used to compare the various control parallel versions of the algorithm and the traditional SIMD counterpart

Published in:

Frontiers of Massively Parallel Computation, 1995. Proceedings. Frontiers '95., Fifth Symposium on the

Date of Conference:

6-9 Feb 1995