منابع مشابه
A parallel extended GCD algorithm
A new parallel extended GCD algorithm is proposed. It matches the best existing parallel integer GCD algorithms of Sorenson and Chor and Goldreich, since it can be achieved in O (n/ logn) time using at most n1+ processors on CRCW PRAM. Sorenson and Chor and Goldreich both use a modular approach which consider the least significant bits. By contrast, our algorithm only deals with the leading bit...
متن کاملParallel Implementation of Schönhage's Integer GCD Algorithm
We present a parallel implementation of Schönhage’s integer GCD algorithm on distributed memory architectures. Results are generalized for the extended GCD algorithm. Experiments on sequential architectures show that Schönhage’s algorithm overcomes other GCD algorithms implemented in two well known multiple-precision packages for input sizes larger than about 50000 bytes. In the extended case t...
متن کاملA New Algorithm and Refined Bounds for Extended Gcd Computation
Extended gcd computation is interesting itself. It also plays a fundamental role in other calculations. We present a new algorithm for solving the extended gcd problem. This algorithm has a particularly simple description and is practical. It also provides reened bounds on the size of the multipliers obtained.
متن کاملA Sublinear Time Parallel GCD Algorithm for the EREW PRAM
We present a parallel algorithm that computes the greatest common divisor of two integers of n bits in length that takes O(n log logn/ logn) expected time using n processors on the EREW PRAM parallel model of computation. We believe this to be the first sublinear time algorithm on the EREW PRAM for this problem.
متن کاملA modular integer GCD algorithm
This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U , V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC ’93: International Symposium on Symbolic and Algebr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2008
ISSN: 1570-8667
DOI: 10.1016/j.jda.2006.12.009