Schönhage-Strassen algorithm with MapReduce for multiplying terabit integers

DOI10.1145/2331684.2331693MaRDI QIDQ2819616zbMATH OpenOpenAlexFDO

Authors Tsz-Wo Sze

Publication date 29 September 2016

Published in Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2331684.2331693

zbMATH Keywords

distributed computingfast Fourier transforminteger multiplicationMapReducemultiprecision arithmeticsummation

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Distributed algorithms (68W15) Symbolic computation and algebraic computation (68W30)

Recommendations

• Research on large integer multiplication Schönhage-Strassen algorithm's multi-core parallelization
• A GMP-based implementation of Schönhage-Strassen's large integer multiplication algorithm
• Large integer multiplication on hypercubes
• Even faster integer multiplication
• Integer multiplication in time \(O(n\log n)\)

Cited in

(1)

• Research on large integer multiplication Schönhage-Strassen algorithm's multi-core parallelization

This page was built for publication: Schönhage-Strassen algorithm with MapReduce for multiplying terabit integers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819616)