Binary addition chain on EREW PRAM

Authors:
Khaled A. Fathy;Hazem M. Bahig;Hatem M. Bahig;A. A. Ragb
Affiliations:
Department of Basic Science, Faculty of Engineering, Sinai University, Egypt;Computer Science Division, Department of Mathematics, Ain Shams University, Cairo, Egypt;Computer Science Division, Department of Mathematics, Ain Shams University, Cairo, Egypt;Department of Mathematics, Faculty of Science, AlAzhar University, Egypt
Venue:
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part II
Year:
2011

Citing 4
Cited 0

Addition chains using continued fractions

Journal of Algorithms
An introduction to parallel algorithms

An introduction to parallel algorithms
Parallel computation: models and methods

Parallel computation: models and methods
A survey of fast exponentiation methods

Journal of Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

An addition chain for a natural number x of n bits is a sequence of numbers a0, a1, ..., al, such that a0 = 1, al = x, and ak = ai+aj with 0 ≥ i, j k ≥ l. The addition chain problem is what is the minimal number of additions needed to compute x starting from 1? In this paper, we present a new parallel algorithm to generate a short addition chain for x. The algorithm has running time O(log2 n) using polynomial number processors under EREW PRAM (exclusive read exclusive write parallel random access machine). The algorithm is faster than previous algorithms and is based on binary method.