𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel Implementation of the Accelerated Integer GCD Algorithm

✍ Scribed by KENNETH WEBER

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
539 KB
Volume
21
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Improvements on the accelerated integer
Improvements on the accelerated integer GCD algorithm
✍ Mohamed S. Sedjelmaci; Christian Lavault πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 493 KB

The present paper analyses and presents several improvements to the algorithm for finding the (a, b)-pairs used in the k-ary reduction of the right-shift k-ary integer GCD algorithm. While the worst-case complexity of the "Accelerated integer GCD algorithm" is 0( (log,( k))'), we show that the worst

A Double-Digit Lehmer-Euclid Algorithm f
A Double-Digit Lehmer-Euclid Algorithm for Finding the GCD of Long Integers
✍ Tudor Jebelean πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 316 KB

The use of pairs of double digits in the Lehmer-Euclid multiprecision GCD algorithm halves the number of long multiplications, but a straightforward implementation of this idea does not give the desired speed-up. We show how to overcome the practical difficulties by using an enhanced condition for e

Parallel implementation of a genetic alg
Parallel implementation of a genetic algorithm
✍ R. Davies; T. Clarke πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 662 KB

This paper considers the parallel implementation of a genetic algorithm using a network of transputers. The context of the work is the design of a flight control system using a novel approach to Robust Eigenstructure Assignment. The robustness properties of the Linear Quadratic Regulator are exploit