The Community for Technology Leaders
RSS Icon
Subscribe
Xi'an, China
Sept. 10, 2007 to Sept. 14, 2007
ISBN: 0-7695-2933-X
pp: 27
Lei Pan , California Institute of Technology, USA
Jingling Xie , University of New South Wales, Australia
Ming Kin Lai , University of California, Irvine, USA
Michael B. Dillencourt , University of California, Irvine, USA
Lubomir F. Bic , University of California, Irvine, USA
ABSTRACT
Program parallelization requires mapping computation and data to processing elements. Navigational Programming (NavP), based on the principle of migrating computations, offers a different approach than the conventional solutions that use a SPMD model. This paper focuses on data distribution for NavP. We introduce the Navigational Trace Graph (NTG), a mathematical structure that captures the alignment and distribution preferences of a sequential program. Graph partitioning is applied to NTGs to obtain data distribution solutions. The major advantage is that our methodology can focus exclusively on reducing communication overhead first and later determine the actual computation partition and parallelization, because NavP computations migrate freely across partitions. This is in stark contrast to SPMD, where the data partitioning imposes hard constraints on the threads because they are stationary. We present experimental results to demonstrate the effectiveness of our approach.
INDEX TERMS
data distribution, navigational trace graph (NTG), graph partitioning, navigational programming
CITATION
Lei Pan, Jingling Xie, Ming Kin Lai, Michael B. Dillencourt, Lubomir F. Bic, "Toward Automatic Data Distribution for Migrating Computations", ICPP, 2007, 2013 42nd International Conference on Parallel Processing, 2013 42nd International Conference on Parallel Processing 2007, pp. 27, doi:10.1109/ICPP.2007.80
3 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool