arrays, parallelism, data-parallel applications, data partitioning
Two-dimensional arrays are useful in a large variety of scientific and engineering applications. Parallelization of these applications requires the decomposition of array elements among different machines. Several data-decomposition techniques have been studied in the literature for machines with uniform computational power. In this paper we develop new methods for decomposing arrays into a cluster of machines with nonuniform computational power. Simulation results show that our methods provide superior decomposition over naive schemes.
Kaddoura, Maher; Ranka, Sanjay; and Wang, Albert, "Array Decompositions for Nonuniform Computational Environments" (1996). L.C. Smith College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects. Paper 5.
Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.