skip to main content
10.1145/1278177.1278198acmconferencesArticle/Chapter ViewAbstractPublication PagesissacConference Proceedingsconference-collections
Article

POSIX threads polynomials(PTPol): a scalable implementation of univariate arithmetic operations

Published: 27 July 2007 Publication History

Abstract

In this paper, we describe the design of a C library which is named PTPol implementing arithmetic operations for univariate polynomials. We report on practical experiments showing the relevance of using threads on recent multicore computers.
We show how to use efficiently an API named OpenMP and POSIX Threads to achieve scalability. On multi-core architectures, we obtain a speed-up equivalent to the number of cores on addition and multiplication on univariate polynomials even for moderate degrees.

References

[1]
Single Unix Specification ISBN 1931624437
[2]
POSIX standard ISO/IEC 9945-3: 2003 (IEEE Std. 1003.3: 2001)
[3]
OpenMP Open MP Specification 2.5 May 2005 (http://www.openmp.org/drupal/node/view/75)
[4]
C programming language Norm ISO-Standard ISO/IEC 9899:1999
[5]
D. Bini, V. Pan Polynomial and matrix computation. Progress in Theoretical Computer Science, Birkhäuser, 1994
[6]
Shoup, V., NTL: A Library for doing Number Theory, (http://shoup.net/ntl/)

Index Terms

  1. POSIX threads polynomials(PTPol): a scalable implementation of univariate arithmetic operations

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    PASCO '07: Proceedings of the 2007 international workshop on Parallel symbolic computation
    July 2007
    116 pages
    ISBN:9781595937414
    DOI:10.1145/1278177
    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

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 27 July 2007

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. scalability
    2. symbolic-numeric computation
    3. univariate polynomial

    Qualifiers

    • Article

    Conference

    ISSAC07
    Sponsor:

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 139
      Total Downloads
    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 17 Feb 2025

    Other Metrics

    Citations

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media