By Topic

Index bit permutations for automatic data redistribution

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)
Mackerras, P. ; Dept. of Comput. Sci., Australian Nat. Univ., Canberra, ACT, Australia ; Corrie, B.

PISTON is a machine-independent software framework for developing scientific applications on parallel computers. It presents a consistent data-parallel distributed memory model across a wide range of architectures. It has been implemented on MIMD, SIMD and SMP architectures. In this paper, we describe PISTON's implementation of index bit permutations (IBP) as a means of performing automatic regular data redistributions. A theoretical analysis of IBPs is derived and the predicted performance is compared with the actual performance of an IBP implementation on the Fujitsu API000. A detailed examination of the performance of IBPs on two common data redistributions is compared to the performance of hand-coded implementations of the same data redistributions in order to determine the effectiveness of IBPs. Based on this analysis, we generalize to describe what architectural features of a MIMD machine impact on the performance of IBPs and show that they are an efficient means of implementing regular data redistributions on MIMD parallel architectures

Published in:

Parallel Rendering, 1997. PRS 97. Proceedings. IEEE Symposium on

Date of Conference:

20-21 Oct 1997