Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

AICCSA
2001
IEEE

favoriteEmaildiscussreport

177views Hardware» more AICCSA 2001»

On a Parallel Extended Euclidean Algorithm

13 years 8 months ago

On a Parallel Extended Euclidean Algorithm

Download www-lipn.univ-paris13.fr

A new parallelization of Euclid's greatest common divisor algorithm is proposed. It matches the best existing integer GCD algorithms since it can be achieved in parallel O(n/log n) time using only n1+ processors on a Priority CRCW PRAM. Keywords : Parallel complexity, parallel algorithms, Greatest Common Divisor (GCD), Euclid algorithm.

Sidi Mohamed Sedjelmaci

Real-time Traffic

AICCSA 2001 | Common Divisor Algorithm | Greatest Common Divisor | Hardware | Integer Gcd |

claim paper

Related Content

» Efficient Parallel Algorithms for Euclidean Distance Transform

» Highspeed VLSI architecture for parallel ReedSolomon decoder

» A New Euclidean Division Algorithm For Residue Number Systems

» An Efficient Algorithm for 2D Euclidean 2Center with Outliers

» Extending ICScheduling via the Sweep Algorithm

» Parallel Banding Algorithm to compute exact distance transform with the GPU

» An Adaptive Parallel Hierarchical Clustering Algorithm

» Approximation Schemes for Euclidean kMedians and Related Problems

» CommunicationOptimal Parallel Minimum Spanning Tree Algorithms Extended Abstract

Post Info
More Details (n/a)

Added	23 Aug 2010
Updated	23 Aug 2010
Type	Conference
Year	2001
Where	AICCSA
Authors	Sidi Mohamed Sedjelmaci

Comments (0)