In this dissertation, multi-rate array (MRA) architecture and its synthesis are proposed
and developed. Using multi-coordinate systems (MCS), a unified theory for mapping
algorithms from their original algorithmic specifications onto multi-rate arrays is
developed.
A multi-rate array is a grid of processors in which each interconnection may have its
own clock rate; operations with different complexities run at their own clock rate, thus
increasing the throughput and efficiency.
A class of algorithms named directional affine recurrence equations (DARE) is
defined. The dependence space of a DARE can be decomposed into uniform and non-uniform
subspaces. When projected along the non-uniform subspace, the resultant array
structure is regular. Limitations and restrictions of this approach are investigated and a
procedure for mapping DARE onto MRA is developed.
To generalize this approach, synthesis theory is developed with initial specification
as affine direct input output (ADIO) which aims at removing redundancies from algorithms.
Most ADIO specifications are the original algorithmic specifications. A multi-coordinate
systems (MCS) is used to present an algorithm's dependence structures. In a
MCS system, the index spaces of the variables in an algorithm are defined relative to their own coordinate systems. Most traditionally considered irregular algorithms present regular dependence structures under MCS technique. Procedures are provided for transforming algorithms from original algorithmic specifications to their regular specifications.
Multi-rate schedules and multi-rate timing functions are studied. The solution for multi-rate timing functions can be formulated as linear programming problems. Procedures are provided for mapping ADIOs onto multi-rate VLSI systems. Examples are provided to illustrate the synthesis of MRAs from DAREs and ADIOs.
The first major contribution of this dissertation is the development of the concrete, executable MRA architectures. The second is the introduction of MCS system and its application in the development of the theory for synthesizing MRAs from original algorithmic specifications. / Graduation date: 1995
| Identifer | oai:union.ndltd.org:ORGSU/oai:ir.library.oregonstate.edu:1957/34997 |
| Date | 27 May 1994 |
| Creators | Zheng, Yue-Peng |
| Contributors | Kiaei, Sayfe |
| Source Sets | Oregon State University |
| Language | en_US |
| Detected Language | English |
| Type | Thesis/Dissertation |
Page generated in 0.002 seconds