| 1. |
- Johnsson, Lennart, et al.
(author)
-
Towards a Formal Treatment of VLSI Arrays
- 1981
-
Conference paper (peer-reviewed)abstract
- This paper presents a formalism for describing the behavior of computational networks at the algorithmic level. It establishes a direct correspondence between the mathematical expressions defining a function and the computational networks which compute that function. By formally manipulating the symbolic expressions that define a function, it is possible to obtain different networks that compute the function. From this mathematical description of a network, one can directly determine certain important characteristics of computational networks, such as computational rate, performance and communication requirements. The use of this formalism for design and verification is demonstrated on computational networks for Finite Impulse Response (FIR) filters, matrix operations, and the Discrete Fourier Transform (DFT). The progression of computations can often be modeled by wave fronts in an illuminating way. The formalism supports this model. A computational network can be viewed in an abstract form that can be represented as a graph. The duality between the graph representation and the mathematical expressions is briefly introduced.
|
|
| 2. |
- Maguire Jr., Gerald Q.
(author)
-
A Graphical Workstation and Programming Environment for Data-Driven Computation
- 1983
-
Doctoral thesis (other academic/artistic)abstract
- This dissertation reports on the development of a prototype programming environment for a graphical programming language to support a data-driven style of computation. Emphasis is on the need for tools to assist in the development of nontrivial graphical programs. Within the scope of programming languages there has been a lot of criticism that the current languages force an unnatural form for solutions, which is difficult to read, and even harder to verify, debug, maintain, and modify. One of the major "culprits" for all of these problems is felt to be side effects; thus there have been several proposals to create functional languages. One class of functional solutions which has received an increasing amount of interest is the area of data flow languages. In order to evaluate these alternate programming methodologies nontrivial programs need to be developed using such a methodology. This work grew out of an interest in providing a programming environment to support the development of very large programs in GPL and to find out what aspects of a programming environment would be substantially different for a graphical language which employs a data-driven computational model.
|
|
