Communications of the ACM - Special issue on parallelism
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
On the Time Required to Perform Addition
Journal of the ACM (JACM)
The Time Required for Group Multiplication
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Charles Babbage: Pioneer of the Modern Computer
Charles Babbage: Pioneer of the Modern Computer
Computer Arithmetic: Principles, Architecture and Design
Computer Arithmetic: Principles, Architecture and Design
The Non-Recursive Power of Erroneous Computation
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
A Parallel Algorithm for Multiple-Precision Division by a Single-Precision Integer
Large-Scale Scientific Computing
The average time complexity to compute preffix functions in processor networks
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
| Hi-index | 14.98 |
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.