By Topic

Scalable hardware-algorithms for binary prefix sums

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Lin, R. ; Dept. of Comput. Sci., State Univ. of New York, Geneseo, NY, USA ; Nakano, K. ; Olariu, S. ; Pinotti, M.C.
more authors

We address the problem of designing efficient and scalable hardware-algorithms for computing the sum and prefix sums of a wk -bit, (k⩾2), sequence using as basic building blocks linear arrays of at most w2 shift switches, where w is a small power of 2. An immediate consequence of this feature is that in our designs broadcasts are limited to buses of length at most w2. We adopt a VLSI delay model where the “length” of a bus is proportional with the number of devices on the bus. We begin by discussing a hardware-algorithm that computes the sum of a wk-bit binary sequence in the time of 2k-2 broadcasts, while the corresponding prefix sums can be computed in the time of 3k-4 broadcasts. Quite remarkably, in spite of the fact that our hardware-algorithm uses only linear arrays of size at most w2, the total number of broadcasts involved is less than three times the number required by an “ideal” design. We then go on to propose a second hardware-algorithm, operating in pipelined fashion, that computes the sum of a kw2-bit binary sequence in the time of 3k+[logw k]=3 broadcasts. Using this design, the corresponding prefix sums can be computed in the time of 4k+[logw k]-5 broadcasts

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:11 ,  Issue: 8 )