research-article

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

Author:

Tsz-Wo SzeAuthors Info & Claims

SNC '11: Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation

Pages 54 - 62

https://doi.org/10.1145/2331684.2331693

Published: 07 June 2012 Publication History

Abstract

We present MapReduce-SSA, an integer multiplication algorithm using the ideas from Schönhage-Strassen algorithm (SSA) on MapReduce. SSA is one of the most commonly used large integer multiplication algorithms. MapReduce is a programming model invented for distributed data processing on large clusters. MapReduce-SSA is designed for multiplying integers in terabit scale on clusters of commodity machines. As parts of MapReduce-SSA, two algorithms, MapReduce-FFT and MapReduce-Sum, are created for computing discrete Fourier transforms and summations. These mathematical algorithms match the model of MapReduce seamlessly.

References

[1]

F. Bellard. Pi computation record, 2009. http://bellard.org/pi/pi2700e9/announce.html.

[2]

F. Bellard. Tachuspi, 2009. http://bellard.org/pi/pi2700e9/tpi.html.

[3]

D. J. Bernstein. Multidigit multiplication for mathematicians, 2001. Available at http://cr.yp.to/papers/m3.pdf.

[4]

D. J. Bernstein. Fast multiplication and its applications. Number 44 in Mathematical Sciences Research Institute Publications, pages 325--384. Cambridge University Press, 2008.

[5]

J. M. Borwein, P. B. Borwein, and D. H. Bailey. Ramanujan, modular equations, and approximations to pi or how to compute one billion digits of pi. 96(3):201--219, 1989.

Digital Library

[6]

R. P. Brent and P. Zimmermann. Modern Computer Arithmetic. Number 18 in Cambridge Monographs on Computational and Applied Mathematics. Cambridge University Press, Cambridge, United Kingdom, 2010.

Digital Library

[7]

D. Chudnovsky and G. Chudnovsky. The computation of classical constants. In Proc. Nat. Acad. Sci. USA, volume 86, pages 8178--8182. Academic Press, 1989.

[8]

R. Crandall and C. Pomerance. Prime Numbers: A Computational Perspective. Springer-Verlag, New York, NY, 2001.

[9]

A. De, P. P. Kurur, C. Saha, and R. Saptharishi. Fast integer multiplication using modular arithmetic. In Proceedings of the 40th annual ACM Symposium on Theory of Computing, pages 499--506. ACM, 2008.

Digital Library

[10]

J. Dean and S. Ghemawat. MapReduce: simplified data processing on large clusters. In Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation, pages 137--150. USENIX Association, 2004.

Digital Library

[11]

M. Fürer. Faster integer multiplication. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing, pages 57--66. ACM, 2007.

Digital Library

[12]

P. Gaudry, A. Kruppa, and P. Zimmermann. A GMP-based implementation of Schönhage-Strassen's large integer multiplication algorithm. In Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation, pages 167--174. ACM, 2007.

Digital Library

[13]

D. E. Knuth. The Art of Computer Programming, Volume 2: Seminumerical Algorithms. Addison-Wesley, Reading, MA, 1997.

Digital Library

[14]

O. O'Malley and A. C. Murthy. Winning a 60 second dash with a yellow elephant, 2009. Available at http://sortbenchmark.org/Yahoo2009.pdf.

[15]

A. Schönhage and V. Strassen. Schnelle Multiplikation großer Zahlen. Computing, 7:281--292, 1971.

[16]

K. Shvachko, H. Kuang, S. Radia, and R. Chansler. The Hadoop Distributed File System. In 26th IEEE Symposium on Massive Storage Systems and Technologies, 2010.

Digital Library

[17]

D. Takahashi, 2010. Personal communication.

[18]

D. Takahashi. Parallel implementation of multiple-precision arithmetic and 2,576,980,370,000 decimal digits of π calculation. Parallel Comput., 36:439--448, August 2010.

Digital Library

[19]

A. J. Yee, 2010. Personal communication.

[20]

A. J. Yee. y-cruncher -- a multi-threaded pi-program, 2010. http://www.numberworld.org/y-cruncher/.

[21]

A. J. Yee and S. Kondo. 5 trillion digits of pi - new world record, 2010. http://www.numberworld.org/misc_runs/pi-5t/announce_en.html.

Cited By

Li CZhang YTan C(2023)Fault-Tolerant Computation Meets Network Coding: Optimal Scheduling in Parallel ComputingIEEE Transactions on Communications10.1109/TCOMM.2023.327516671:7(3847-3860)Online publication date: Jul-2023
https://doi.org/10.1109/TCOMM.2023.3275166
Zhao HDing DWang FHua PWang NWu QChai Z(2023)Hardware acceleration of number theoretic transform for zk‐SNARKEngineering Reports10.1002/eng2.12639Online publication date: 16-Feb-2023
https://doi.org/10.1002/eng2.12639
Zhang YWang SZhang XDong JMao XLong FWang CZhou DGao MSun GMartínez JDuato JJohn L(2021)PipeZKProceedings of the 48th Annual International Symposium on Computer Architecture10.1109/ISCA52012.2021.00040(416-428)Online publication date: 14-Jun-2021
https://dl.acm.org/doi/10.1109/ISCA52012.2021.00040
Show More Cited By

Index Terms

Schönhage-Strassen algorithm with MapReduce for multiplying terabit integers
1. Computing methodologies
  1. Symbolic and algebraic manipulation
    1. Symbolic and algebraic algorithms
2. Mathematics of computing
  1. Mathematical analysis
    1. Numerical analysis
      1. Computation of transforms
  2. Mathematical software

Recommendations

A gmp-based implementation of schönhage-strassen's large integer multiplication algorithm
ISSAC '07: Proceedings of the 2007 international symposium on Symbolic and algebraic computation

Schönhage-Strassen's algorithm is one of the best known algorithms for multiplying large integers. Implementing it ef?ciently is of utmost importance, since many other algorithms rely on it as a subroutine. We present here an improved implementation, ...
The Fast Hartley Transform Algorithm

The fast Hartley transform (FHT) is similar to the Cooley-Tukey fast Fourier transform (FFT) but performs much faster because it requires only real arithmetic computations compared to the complex arithmetic computations required by the FFT. Through use ...
Implementation of the DKSS Algorithm for Multiplication of Large Numbers
ISSAC '15: Proceedings of the 2015 ACM International Symposium on Symbolic and Algebraic Computation

The Schönhage-Strassen algorithm (SSA) is the de-facto standard for multiplication of large integers. For N-bit numbers it has a time bound of O(N log N log log N). De, Kurur, Saha and Saptharishi (DKSS) presented an asymptotically faster algorithm with ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SNC '11: Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation

June 2012

194 pages

ISBN:9781450305150

DOI:10.1145/2331684

General Chair:
Ilias Kotsireas
Wilfrid Laurier University, Canada

Copyright © 2012 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 June 2012

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

ISSAC '11

Sponsor:

SIGSAM

ISSAC '11: International Symposium on Symbolic and Algebraic Computation

June 7, 2011 - June 9, 2012

California, San Jose

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
216
Total Downloads

Downloads (Last 12 months)37
Downloads (Last 6 weeks)1

Reflects downloads up to 01 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Li CZhang YTan C(2023)Fault-Tolerant Computation Meets Network Coding: Optimal Scheduling in Parallel ComputingIEEE Transactions on Communications10.1109/TCOMM.2023.327516671:7(3847-3860)Online publication date: Jul-2023
https://doi.org/10.1109/TCOMM.2023.3275166
Zhao HDing DWang FHua PWang NWu QChai Z(2023)Hardware acceleration of number theoretic transform for zk‐SNARKEngineering Reports10.1002/eng2.12639Online publication date: 16-Feb-2023
https://doi.org/10.1002/eng2.12639
Zhang YWang SZhang XDong JMao XLong FWang CZhou DGao MSun GMartínez JDuato JJohn L(2021)PipeZKProceedings of the 48th Annual International Symposium on Computer Architecture10.1109/ISCA52012.2021.00040(416-428)Online publication date: 14-Jun-2021
https://dl.acm.org/doi/10.1109/ISCA52012.2021.00040
Li CTan CLi JChen S(2021)Fault-Tolerant Computation Meets Network Coding: Optimal Scheduling in Parallel Computing2021 IEEE Global Communications Conference (GLOBECOM)10.1109/GLOBECOM46510.2021.9685369(1-6)Online publication date: 7-Dec-2021
https://dl.acm.org/doi/10.1109/GLOBECOM46510.2021.9685369
Elgamel MDandoush A(2015)A modified Manhattan distance with application for localization algorithms in ad-hoc WSNsAd Hoc Networks10.1016/j.adhoc.2015.05.00333:C(168-189)Online publication date: 1-Oct-2015
https://dl.acm.org/doi/10.1016/j.adhoc.2015.05.003
Vanschoren JVespier UMiao SMeeng MCachucho RKnobbe A(2014)Large-Scale Sensor Network AnalysisBig Data Management, Technologies, and Applications10.4018/978-1-4666-4699-5.ch013(314-347)Online publication date: 2014
https://doi.org/10.4018/978-1-4666-4699-5.ch013

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents