Sciweavers

51 search results - page 5 / 11
» Representation-transparent matrix algorithms with scalable p...
Sort
View
PVM
1999
Springer
13 years 11 months ago
Parallel Computation of the SVD of a Matrix Product
In this paper we study a parallel algorithm for computing the singular value decomposition (SVD) of a product of two matrices on message passing multiprocessors. This algorithm is ...
José M. Claver, Manuel Mollar, Vicente Hern...
IPPS
2008
IEEE
14 years 1 months ago
On the representation and multiplication of hypersparse matrices
Multicore processors are marking the beginning of a new era of computing where massive parallelism is available and necessary. Slightly slower but easy to parallelize kernels are ...
Aydin Buluç, John R. Gilbert
FPGA
2005
ACM
121views FPGA» more  FPGA 2005»
14 years 1 months ago
Floating-point sparse matrix-vector multiply for FPGAs
Large, high density FPGAs with high local distributed memory bandwidth surpass the peak floating-point performance of high-end, general-purpose processors. Microprocessors do not...
Michael DeLorimier, André DeHon
CISIM
2007
IEEE
14 years 1 months ago
A Particle Swarm Optimization Algorithm for Neighbor Selection in Peer-to-Peer Networks
Peer-to-peer (P2P) topology has significant influence on the performance, search efficiency and functionality, and scalability of the application. In this paper, we propose a P...
Shichang Sun, Ajith Abraham, Guiyong Zhang, Hongbo...
HIPC
2007
Springer
14 years 1 months ago
Multi-objective Peer-to-Peer Neighbor-Selection Strategy Using Genetic Algorithm
Peer-to-peer (P2P) topology has significant influence on the performance, search efficiency and functionality, and scalability of the application. In this paper, we present a Gen...
Ajith Abraham, Benxian Yue, Chenjing Xian, Hongbo ...