๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Parallel Polynomial Operations on SMPs: an Overview

โœ Scribed by PAUL S. WANG

Book ID
102975336
Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
597 KB
Volume
21
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

โœฆ Synopsis

SMP-based parallel algorithms and implementations for polynomial factoring and GCD are overviewed. Topics include polynomial factoring modulo small primes, univariate and multivariate p-adic lifting, and reformulation of lift basis. Sparse polynomial GCD is also covered.

๐Ÿ“œ SIMILAR VOLUMES

Message passing and shared address space
Message passing and shared address space parallelism on an SMP cluster
โœ Hongzhang Shan; Jaswinder P. Singh; Leonid Oliker; Rupak Biswas ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 307 KB

Currently, message passing (MP) and shared address space (SAS) are the two leading parallel programming paradigms. MP has been standardized with MPI, and is the more common and mature approach; however, code development can be extremely difficult, especially for irregularly structured computations.

A Methodological Approach to Parallel Si
A Methodological Approach to Parallel Simulated Annealing on an SMP System
โœ Alessandro Bevilacqua ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 217 KB

Simulated annealing (SA) is a stochastic optimization technique which guarantees under certain conditions to converge to a global minimum. The major disadvantage of this technique is its very slow convergence: this makes it not suitable for many complex optimization problems. Different parallel vers