By Topic

The TRANSPOSE machine-a global implementation of a parallel graph reducer

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

3 Author(s)
Ben-Asher, Y. ; Hebrew Univ., Jerusalem, Israel ; Seidl, H. ; Wilhelm, R.

A new concept is described for the parallel implementation of functional languages on a network of processors. The implementation uses a special variant of annotated graph reduction. Active waiting is employed to avoid complicated runtime data structures. A global address space is used along with a random distribution of the graph nodes over the local memories of the processors, in order to overcome the problems of load-balancing and scheduling. The reduction is organized in cycles during which all annotated redices are reduced. This notion of `cycles' permits the authors to restrict communication between the processors to the execution of a global permutation, defined by an array of messages. This 2-D permutation is realized by a simple and fast algorithm. This algorithm actually maps any 2-D permutation to a double 2-D transpose operation. Hence the implementation can be used for any network topology that supports the transpose operation (namely shuffle exchange). The potential speedup of graph reduction programs is compared with the overhead of the implementation, giving deeper insight into parallel graph reductions

Published in:

TENCON '89. Fourth IEEE Region 10 International Conference

Date of Conference:

22-24 Nov 1989