By Topic

Data distribution concepts for parallel image processing

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)
Nolle, M. ; Univ. of Technol. Hamburg-Harburg, Germany ; Schreiber, G.

Data distributions gained a considerable interest in the field of data parallel programming. In most cases they are key factors for the efficiency of the implementation. In this paper we analyze data distributions suited for parallel image processing and those defined by some of todays more popular parallel languages (HPF, Vienna Fortran, pC++) and libraries (ScaLAPACK). The majority of them belong to the class of bit permutations. These permutations can efficiently be realized on networks that are based on shuffle permutations. As a result we propose to widen the scope of data distributions tolerated by parallel languages and libraries towards classes of distributions. For the large class of the so called normal algorithms we demonstrate that it is possible to implement library functions that can handle a large subclass of distributions thereby avoiding redistribution. As the application level of programming data distributions are to be handled analogously to data types

Published in:

Pattern Recognition, 1996., Proceedings of the 13th International Conference on  (Volume:4 )

Date of Conference:

25-29 Aug 1996