Mapping regular recursive algorithms to fine-grained processor arrays

With the continuing growth of VLSI technology, special-purpose parallel processors have become a promising approach in the quest for high performance. Fine-grained processor arrays have become popular as they are suitable for solving problems with a high degree of parallelism, and can be inexpensively built using custom designs or commercially available field programmable gate arrays (FPGA). Such specialised designs are often required in portable computing and communication systems with real-time constraints, as software-controlled processors often fail to provide the necessary throughput. This thesis addresses many issues in designing such application-specific systems built with fine-grained processor arrays for regular recursive uniform dependence algorithms. A uniform dependence algorithm consists of a set of indexed computations and a set of uniform dependence vectors which are independent of the indices of computations. Many important applications in signal/image processing, communications, and scientific computing can be formulated as uniform dependence algorithms.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Electrical and Computer Engineering

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2011

Author dc:creator

• Ganapathy, Kumar Nanjunda

Contributors dc:contributor

• Wah, Benjamin W.

• Engineering, Electronics and Electrical
• Computer Science

Statement dc:rights

• Copyright 1994 Ganapathy, Kumar Nanjunda

Language dc:language

eng

Identifier

AAI9503192
(UMI)AAI9503192

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/23359