67 search results - page 5 / 14 » Parallel sparse polynomial multiplication using heaps |
ASPLOS
2009
ACM
14 years 8 months ago
2009
ACM
The growth in complexity of modern systems makes it increasingly difficult to extract high-performance. The software stacks for such systems typically consist of multiple layers a...
IWMM
2000
Springer
13 years 11 months ago
2000
Springer
We investigate reference counting in the context of a multithreaded architecture by exploiting two observations: (1) reference-counting can be performed by a transformed program s...
FPGA
2005
ACM
14 years 1 months ago
2005
ACM
Floating-point Sparse Matrix-Vector Multiplication (SpMXV) is a key computational kernel in scientific and engineering applications. The poor data locality of sparse matrices sig...
PC
2002
13 years 7 months ago
2002
We present a new parallel algorithm to compute an exact triangularization of large square or rectangular and dense or sparse matrices in any field. Using fast matrix multiplicatio...
TCS
2008
13 years 7 months ago
2008
Formalized study of self-assembly has led to the definition of the tile assembly model, Previously I presented ways to compute arithmetic functions, such as addition and multiplic...