Multipartitioning is a strategy for partitioning multidimensional arrays among a collection of processors so that line-sweep computations can be performed efficiently. The principal property of a multipartitioned array is that for a line sweep along any array dimension, all processors have the same number of tiles to compute at each step in the sweep. This property results in full, balanced parallelism. A secondary benefit of multipartitionings is that they induce only coarse-grain communication. Previously, computing a d-dimensional multipartitioning required that p 1 d−1 be integral, where p is the number of processors. Here, we describe an algorithm to compute a d-dimensional multipartitioning of an array of ρ dimensions for an arbitrary...
A SIMD scheme for parallelization of the 2-D array operation M(x) = (D×A + B×I + V) x is developed f...
[[abstract]]In many scientific applications, array redistribution is usually required to enhance dat...
[[abstract]]A methodology for designing pipelined data-parallel algorithms on multicomputers is stud...
(eng) Multipartitioning is a strategy for partitioning multi-dimensional arrays on a collection of p...
Multipartitioning is a strategy for decomposing multi-dimensional arrays into tiles and mapping the ...
Abstract. Multipartitioning is a skewed-cyclic block distribution that yields better parallel effici...
Two approaches to architecture-independent parallel computation are investigated: a constructive fun...
Multipartitioning is a skewed-cyclic block distribution that yields better parallel efficiency and s...
Dynamic programming is a technique widely used to solve several combinatory optimization problems. A...
[[abstract]]The authors present a parallel algorithm to generate the permutations of at most k out o...
We introduce explicit multi-threading (XMT), a decentralized architecture that exploits fine-grained...
[[abstract]]We discuss how to design parallel algorithms based upon the divide-and-conquer strategy....
[[abstract]]In this paper, we present efficient methods for multidimensional array redistribution. B...
We investigate the efficient iterative solution of large-scale sparse linear systems on shared-memor...
. In this paper, we present a method for overlapping communications on parallel computers for pipeli...
A SIMD scheme for parallelization of the 2-D array operation M(x) = (D×A + B×I + V) x is developed f...
[[abstract]]In many scientific applications, array redistribution is usually required to enhance dat...
[[abstract]]A methodology for designing pipelined data-parallel algorithms on multicomputers is stud...
(eng) Multipartitioning is a strategy for partitioning multi-dimensional arrays on a collection of p...
Multipartitioning is a strategy for decomposing multi-dimensional arrays into tiles and mapping the ...
Abstract. Multipartitioning is a skewed-cyclic block distribution that yields better parallel effici...
Two approaches to architecture-independent parallel computation are investigated: a constructive fun...
Multipartitioning is a skewed-cyclic block distribution that yields better parallel efficiency and s...
Dynamic programming is a technique widely used to solve several combinatory optimization problems. A...
[[abstract]]The authors present a parallel algorithm to generate the permutations of at most k out o...
We introduce explicit multi-threading (XMT), a decentralized architecture that exploits fine-grained...
[[abstract]]We discuss how to design parallel algorithms based upon the divide-and-conquer strategy....
[[abstract]]In this paper, we present efficient methods for multidimensional array redistribution. B...
We investigate the efficient iterative solution of large-scale sparse linear systems on shared-memor...
. In this paper, we present a method for overlapping communications on parallel computers for pipeli...
A SIMD scheme for parallelization of the 2-D array operation M(x) = (D×A + B×I + V) x is developed f...
[[abstract]]In many scientific applications, array redistribution is usually required to enhance dat...
[[abstract]]A methodology for designing pipelined data-parallel algorithms on multicomputers is stud...