Skip to main content
eScholarship
Open Access Publications from the University of California

Automatic data/program partitioning using the single assignment principle

Abstract

Loosely-coupled MIMD architectures do not suffer from memory contention; hence large numbers of processors may be utilized. The main problem, however, is how to partition data and programs in order to exploit the available parallelism. In this paper we show that efficient schemes for automatic data/program partitioning and synchronization may be employed if single assignment is used. Using simulations of program loops common to scientific computations (the Livermore Loops), we demonstrate that only a small fraction of data accesses are remote and thus the degradation in network performance due to multiprocessing is minimal.

Main Content
For improved accessibility of PDF content, download the file to your device.
Current View