Mapping of recursive algorithms onto multi-rate arrays Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/rb68xg46b

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • 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.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Peer Reviewed
Language
Digitization Specifications
  • File scanned at 300 ppi (Monochrome, 256 Grayscale) using Capture Perfect 3.0 on a Canon DR-9050C in PDF format. CVista PdfCompressor 4.0 was used for pdf compression and textual OCR.
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2012-11-07T23:23:37Z (GMT) No. of bitstreams: 1 ZhengYuePeng1995.pdf: 10400278 bytes, checksum: 2e917d27e831f49bbebbfa76b2c630e8 (MD5)
  • description.provenance : Submitted by Kirsten Clark (kcscannerosu@gmail.com) on 2012-11-07T23:09:43Z No. of bitstreams: 1 ZhengYuePeng1995.pdf: 10400278 bytes, checksum: 2e917d27e831f49bbebbfa76b2c630e8 (MD5)
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2012-11-08T19:13:12Z (GMT) No. of bitstreams: 1 ZhengYuePeng1995.pdf: 10400278 bytes, checksum: 2e917d27e831f49bbebbfa76b2c630e8 (MD5)
  • description.provenance : Made available in DSpace on 2012-11-08T19:13:12Z (GMT). No. of bitstreams: 1 ZhengYuePeng1995.pdf: 10400278 bytes, checksum: 2e917d27e831f49bbebbfa76b2c630e8 (MD5) Previous issue date: 1994-05-27

Relationships

In Administrative Set:
Last modified: 08/20/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items