Abstract
Reported are experiences and practical results from parallelizing the modular GCD algorithm for sparse multivariate polynomials. The strategy is to identify key computation steps in the sequential algorithm and implement them in parallel. The two major steps of the sequential algorithm—computing the GCD modulo several primes and applying the Chinese Remainder Algorithm on the integer coefficients—are easily partitioned into independent subtasks. The subtask of computing the GCD modulo one prime can be subdivided further. Several parallel strategies for the multivariate GCD modulo a prime are presented. Actual timings on a Sequent Balance with 26 processors are presented.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
