Sciweavers

7 search results - page 1 / 2
» Fast and Scalable Parallel Matrix Computations with Optical ...
Sort
View
IPPS
1999
IEEE
13 years 9 months ago
Optimally Scaling Permutation Routing on Reconfigurable Linear Arrays with Optical Buses
We present an optimal and scalable permutation routing algorithm for three reconfigurable models based on linear arrays that allow pipelining of information through an optical bus...
Jerry L. Trahan, Anu G. Bourgeois, Ramachandran Va...
IPPS
1997
IEEE
13 years 8 months ago
A Fast Scalable Universal Matrix Multiplication Algorithm on Distributed-Memory Concurrent Computers
We present a fast and scalable matrix multiplication algorithm on distributed memory concurrent computers, whose performance is independent of data distribution on processors, and...
J. Choi
CONCURRENCY
1998
151views more  CONCURRENCY 1998»
13 years 4 months ago
A new parallel matrix multiplication algorithm on distributed-memory concurrent computers
We present a new fast and scalable matrix multiplication algorithm, called DIMMA Distribution-Independent Matrix Multiplication Algorithm, for block cyclic data distribution on ...
Jaeyoung Choi
ISPDC
2007
IEEE
13 years 11 months ago
Hybrid MPI-Thread Parallelization of the Fast Multipole Method
We present in this paper multi-thread and multi-process parallelizations of the Fast Multipole Method (FMM) for Laplace equation, for uniform and non uniform distributions. These ...
Olivier Coulaud, Pierre Fortin, Jean Roman