By Topic

A method of optimising data distribution on a loosely coupled multiprocessor system

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)
Symons, A. ; Dept. of Electr. & Comput. Eng., Queensland Univ., Brisbane, Qld., Australia ; Narasimhan, V.L.

The maximum speedup of a multiprocessor system is limited by the sequential part of an algorithm and in loosely coupled processor systems, a large part of this sequentiality is caused by the communication between processors. As this communication is dependent on the distribution of data the data distribution must be optimised in order to achieve the maximum speedup. In this paper we present a new method of achieving this optimisation for loosely coupled multiprocessors using a branch and bound technique based on the Moore-Skelboe interval arithmetic. Two key issues of this algorithm have been addressed, namely, the branch selection criterion, and an efficient data structure to keep track of the branches. A blocked data structure is shown to have the desirable properties of dynamic list length, and minimal disk thrashing. When this method is applied to an FFT algorithm running on a pipeline of transputers, the optimised data distribution is shown to yield an improved speedup over the equal and random distributions, which do not take into account communication overheads

Published in:

Algorithms and Architectures for Parallel Processing, 1995. ICAPP 95. IEEE First ICA/sup 3/PP., IEEE First International Conference on  (Volume:2 )

Date of Conference:

19-21 Apr 1995