| | |
Summary: Automatic Partitioning of Data and Computations
on Scalable Shared Memory Multiprocessors
Sudarsan Tandri
IBM Canada Ltd.
Toronto, Ontario, Canada, M3C 1V7
tandri@vnet.ibm.com
Tarek S. Abdelrahman
Dept. of Electrical and Computer Engineering
The University of Toronto
Toronto, Ontario, Canada, M5S 3G4
tsa@eecg.toronto.edu
Abstract--This paper describes an algorithm for deriv-
ing data and computation partitions on scalable shared
memory multiprocessors. The algorithm establishes affin-
ity relationships between where computations are per-
formed and where data is located based on array accesses
in the program. The algorithm then uses these affinity re-
lationshipsto determine both static and dynamic partitions
for arrays and parallel loops. Experimental results from
a prototype implementation of the algorithm demonstrate
|
