Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published May 2, 2012 | Submitted
Report Open

A mathematical approach to modelling the flow of data and control in computational networks

Abstract

This paper proposes a mathematical formalism for the synthesis and qualitative analysis of computational networks that treats data and control in the same manner. Expressions in this notation are given a direct interpretation in the implementation domain. Topology, broadcasting, pipelining, and similar properties of implementations can be determined directly from the expressions. This treatment of computational networks emphasizes the space/time tradeoff of implementations. A full instantiation in space of most computational problems is unrealistic, even in VLSI (Finnegan [4]). Therefore, computations also have to be at least partially instantiated in the time domain, requiring the use of explicit control mechanisms, which typically cause the data flow to be nonstationary and sometimes turbulent.

Additional Information

The authors gratefully acknowledge the support for this research provided generously by the Defense Advanced Research Projects Agency under contract MDA-80-C-0523 with the USC/Information Sciences Institute and contract N00014-79-C-0597 with the California Institute of Technology. Views and conclusions contained in·this paper are the authors' and should not be interpreted as representing the official opinion or policy of DARPA, the U.S. Government, nor any person or agency connected with them.

Attached Files

Submitted - 5120_TM_81.pdf

Files

5120_TM_81.pdf
Files (2.3 MB)
Name Size Download all
md5:5aff02935beb2250a8fb20d8b6aebef9
2.3 MB Preview Download

Additional details

Created:
August 19, 2023
Modified:
January 13, 2024