Sciweavers

416 search results - page 2 / 84
» A Paradigm for Parallel Matrix Algorithms:
Sort
View
ACMMSP
2006
ACM
260views Hardware» more  ACMMSP 2006»
13 years 10 months ago
Seven at one stroke: results from a cache-oblivious paradigm for scalable matrix algorithms
A blossoming paradigm for block-recursive matrix algorithms is presented that, at once, attains excellent performance measured by • time, • TLB misses, • L1 misses, • L2 m...
Michael D. Adams, David S. Wise
IPPS
2010
IEEE
13 years 2 months ago
Oblivious algorithms for multicores and network of processors
We address the design of algorithms for multicores that are oblivious to machine parameters. We propose HM, a multicore model consisting of a parallel shared-memory machine with hi...
Rezaul Alam Chowdhury, Francesco Silvestri, Brando...
ICPP
2008
IEEE
13 years 11 months ago
Challenges and Advances in Parallel Sparse Matrix-Matrix Multiplication
We identify the challenges that are special to parallel sparse matrix-matrix multiplication (PSpGEMM). We show that sparse algorithms are not as scalable as their dense counterpar...
Aydin Buluç, John R. Gilbert
IPPS
2002
IEEE
13 years 9 months ago
High-Performance Parallel and Distributed Computing for the BMI Eigenvalue Problem
The BMI Eigenvalue Problem is one of optimization problems and is to minimize the greatest eigenvalue of a bilinear matrix function. This paper proposes a parallel algorithm to co...
Kento Aida, Yoshiaki Futakata, Shinji Hara