The authors implemented and measured several methods to perform BMMC permutations on the MasPar MP-2. Each method is coded in C and MPL and uses only the global router to transfer data among processors. Implementation in MPL limits the amount of control the programmer has over the global router. The methods used were a naive method; the PE method, which adapts the block BMMC algorithm for parallel disk systems to treat processor elements as independent devices; and the cluster method, which adapts the block BMMC algorithm to treat clusters of processor elements as independent devices. The authors also implemented variations of the first two methods to compute virtual-processor numbers in Gray-code order. Our results indicate that for random...
The increasing availability of multi-core and multiprocessor architectures provides new opportunitie...
AbstractThe mesh of buses (MBUS) is a parallel computation model which consists of n×n processors, n...
Contents 1 Introduction 1 1.1 Contributions of this Thesis : : : : : : : : : : : : : : : : : : : : ...
This paper presents an architecture-independent method for performing BMMC permutations on multiproc...
This paper presents asymptotically equal lower and upper bounds for the number of parallel I/O opera...
We give asymptotically equal lower and upper bounds for the number of parallel I/O operations requir...
The ability to perform permutations of large data sets in place reduces the amount of necessary avai...
We describe our implementation of several efficient parallel algorithms on the massively parallel SI...
In this work, we present two new universally composable, actively secure, constant round multi-party...
Increasingly, modern computing problems, including many scientific and business applications, requir...
We present an optimal oblivious randomized algorithm for permutation routing on the MIMD version of ...
Network folding is a technique for realizing permutations on N elements using interconnection networ...
AbstractWe describe our implementation of several efficient parallel algorithms on the massively par...
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalized ...
International audienceWe tackle the feasibility and efficiency of two new parallel algorithms that s...
The increasing availability of multi-core and multiprocessor architectures provides new opportunitie...
AbstractThe mesh of buses (MBUS) is a parallel computation model which consists of n×n processors, n...
Contents 1 Introduction 1 1.1 Contributions of this Thesis : : : : : : : : : : : : : : : : : : : : ...
This paper presents an architecture-independent method for performing BMMC permutations on multiproc...
This paper presents asymptotically equal lower and upper bounds for the number of parallel I/O opera...
We give asymptotically equal lower and upper bounds for the number of parallel I/O operations requir...
The ability to perform permutations of large data sets in place reduces the amount of necessary avai...
We describe our implementation of several efficient parallel algorithms on the massively parallel SI...
In this work, we present two new universally composable, actively secure, constant round multi-party...
Increasingly, modern computing problems, including many scientific and business applications, requir...
We present an optimal oblivious randomized algorithm for permutation routing on the MIMD version of ...
Network folding is a technique for realizing permutations on N elements using interconnection networ...
AbstractWe describe our implementation of several efficient parallel algorithms on the massively par...
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalized ...
International audienceWe tackle the feasibility and efficiency of two new parallel algorithms that s...
The increasing availability of multi-core and multiprocessor architectures provides new opportunitie...
AbstractThe mesh of buses (MBUS) is a parallel computation model which consists of n×n processors, n...
Contents 1 Introduction 1 1.1 Contributions of this Thesis : : : : : : : : : : : : : : : : : : : : ...