| Autor: |
Chowdhury, Muhammad F. I., Maza, Marc Moreno, Pan, Wei, Schost, Eric |
| Předmět: |
|
| Zdroj: |
AIP Conference Proceedings; 11/27/2011, Vol. 1368 Issue 1, p259-262, 4p, 1 Chart, 1 Graph |
| Abstrakt: |
Today's parallel hardware architectures and computer memory hierarchies enforce revisiting fundamental algorithms which were often designed with algebraic complexity as the main complexity measure and with sequential running time as the main performance counter. This study is devoted to two algorithms of univariate polynomial multiplication; that are independent of the coefficient ring: the plain and the Toom-Cook univariate multiplications. We analyze their cache complexity and report on their parallel implementations in Cilk++ [1]. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
