By Topic

Supporting data-level and processor-level parallelism in data-parallel programming languages

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
$31 $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)
Hatcher, P.J. ; Dept. of Comput. Sci., New Hampshire Univ., NH, USA ; Quinn, M.J.

The dataparallel C and C* languages do not allow the programmer to express both data-level and processor-level parallelism. Instead, the programmer must choose between them. Choosing data-level parallelism prevents the programmer from applying efficient sequential algorithms to data aggregates and causes unacceptable performance. Choosing processor-level parallelism forces the programmer to sequentialize fundamentally parallel data permutation or reduction operations through the use of `for' loops. The authors give several prototypical examples that demonstrate how data-parallel algorithms can exhibit both data-level and processor-level parallelism. They suggest several ways that data-parallel programming languages or their compilers could be extended to support both kinds of parallelism, and discuss the advantages and disadvantages of each approach

Published in:

System Sciences, 1993, Proceeding of the Twenty-Sixth Hawaii International Conference on  (Volume:ii )

Date of Conference:

5-8 Jan 1993