Binary Addition Chain on EREW PRAM

Khaled Fathy ,Hazem M Bahig,A A Ragb

doi:10.1007/978-3-642-24669-2_31

Binary Addition Chain on EREW PRAM

Khaled Fathy , Hazem M Bahig + Show 1 more

https://doi.org/10.1007/978-3-642-24669-2_31

Copy DOI

Publication Date: Jan 1, 2011

Citations: 8

Affiliation: Sinai University, Ain Shams University, Al Azhar University

#EREW Parallel Random Access Machine #Parallel Random Access Machine + Show 8 more

Abstract
Full-Text PDF
Similar Papers

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.

Full Text