大数加法的顺序和并行算法
Sequential and Parallel Algorithms for the Addition of Big-Integer Numbers
摘要：
今天的个人电脑可以直接操作不超过64位的数字，因为CPU寄存器和数据路径的大小是有限的。因此，诸如加法之类的算术运算只能对该长度的数字执行。为了解决大整数的计算问题，人们提出了不同的算法。然而，这些算法相当慢，因为它们对单个位进行操作;并且仅被设计为在单处理器计算机上运行。本文给出了两个处理大整数算术加法的算法。第一个算法是顺序的，而第二个是并行的。与现有算法不同，这两种算法都对60位（18位）的块或令牌执行加法，从而将执行时间提高了60倍。
英文摘要：
Today's PCs can directly manipulate numbers not longer than 64 bits because the size of the CPU registers and the data-path are limited. Consequently, arithmetic operations such as addition, can only be performed on numbers of that length. To solve the problem of computation on big-integer numbers, different algorithms were developed. However, these algorithms are considerably slow because they operate on individual bits; and are only designed to run over single-processor computers. In this paper, two algorithms for handling arithmetic addition on big-integer numbers are presented. The first algorithm is sequential while the second is parallel. Both algorithms, unlike existing ones, perform addition on blocks or tokens of 60 bits (18 digits), and thus boosting the execution time by a factor of 60.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
