The Community for Technology Leaders
RSS Icon
Issue No.09 - September (1992 vol.41)
pp: 1069-1077
<p>The basic computational model of a massively parallel processor is discussed, and three massively parallel algorithms using carry-lookahead techniques for binary addition of large integers are presented. It is shown how performance can be improved by exploiting the average case behavior of large n-bit additions and the asymmetry of the computation time of two particular operations. Even better performance is obtained by grouping multiple bits per processor. Performance measurements of all the algorithms are presented and discussed.</p>
computation time asymmetry; large integers; computational model; massively parallel processor; massively parallel algorithms; carry-lookahead; binary addition; average case behavior; large n-bit additions; multiple bits; digital arithmetic; parallel algorithms.
B.S. Fagin, "Fast Addition of Large Integers", IEEE Transactions on Computers, vol.41, no. 9, pp. 1069-1077, September 1992, doi:10.1109/12.165389
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool