Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Systolic Super Summation

Published: 01 June 1988 Publication History

Abstract

A principal limitation in accuracy for scientific computation performed with floating-point arithmetic is due to the computation of repeated sums, such as those that arise in inner products. A systolic super summer of cellular design is proposed for the high-throughput performance of repeated sums of floating-point numbers. The apparatus receives pipelined inputs of streams of summands from one or many sources. The floating-point summands are converted into a fixed-point form by a sieve-like pipelined cellular packet-switching device with signal combining. The emerging fixed-point numbers are then summed in a corresponding network of extremely long accumulators (i.e., super accumulators). At the cell level, the design uses a synchronous model of VLSI. The amount of time the apparatus needs to compute an entire sum depends on the values of summands; at this architectural level, the design is asynchronous. The throughput per unit area of hardware approaches that of a tree network, but without the long wire and signal propagation delay that are intrinsic to tree networks.

References

[1]
{1} U. W. Kulisch and W. L. Miranker, Computer Arithmetic in Theory and Practice. New York: Academic, 1981.
[2]
{2} J. Coonan et al., "A proposed standard for floating-point arithmetic," SIGNUM Newsletter, 1979.
[3]
{3} U. W. Kulisch and W. L. Miranker, "The arithmetic of the digital computer," SIAM Rev., vol. 28, pp. 1-40, Mar. 1986.
[4]
{4} H. Leuprecht and W. Oberaigner, "Parallel algorithms for the rounding exact summation of floating point numbers," Computing, vol. 28, 1982.
[5]
{5} G. Bohlender and U. W. Kulisch, "Features of a hardware implementation of an optimal arithmetic," in A New Approach to Scientific Computation, U. W. Kulisch and W. L. Miranker, Eds. New York: Academic, 1983.
[6]
{6} C. D. Thompson, "Area-time complexity for VLSI," in Proc. 11th Annu. Symp. Theory Comput., Apr. 1979.
[7]
{7} R. P. Brent and H. T. Kung, "The area-time complexity of binary multiplication," J. ACM, vol. 28, July 1981.
[8]
{8} G. Bilardi, M. Pracchi, and F. P. Preparata, "A critique and an appraisal of VLSI models of computation," IEEE J. Solid-State Circuits, vol. SC-17, pp. 696-702.
[9]
{9} A. W. Ed. Burks, Essays on Cellular Automata. Urbana, IL: Univ. of Illinois Press, 1970.

Cited By

View all
  • (1997)Validated Roundings of Dot Products by Sticky AccumulationIEEE Transactions on Computers10.1109/12.58924146:5(623-629)Online publication date: 1-May-1997
  • (1992)Systolic Super Summation with Reduced HardwareIEEE Transactions on Computers10.1109/12.12744541:3(339-342)Online publication date: 1-Mar-1992

Recommendations

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Computers
IEEE Transactions on Computers  Volume 37, Issue 6
June 1988
136 pages

Publisher

IEEE Computer Society

United States

Publication History

Published: 01 June 1988

Author Tags

  1. VLSI
  2. accumulators
  3. cellular arrays
  4. cellular design
  5. cellular packet-switching device
  6. digital arithmetic.
  7. fixed-point form
  8. floating-point arithmetic
  9. summands
  10. synchronous model
  11. systolic super summer

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 03 Sep 2024

Other Metrics

Citations

Cited By

View all
  • (1997)Validated Roundings of Dot Products by Sticky AccumulationIEEE Transactions on Computers10.1109/12.58924146:5(623-629)Online publication date: 1-May-1997
  • (1992)Systolic Super Summation with Reduced HardwareIEEE Transactions on Computers10.1109/12.12744541:3(339-342)Online publication date: 1-Mar-1992

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media