On the Analysis and Synthesis of VLSI Algorithms

Authors:
D. I. Moldovan
Affiliations:
Department of Electrical Engineering Systems, University of Southern California
Venue:
IEEE Transactions on Computers
Year:
1982

Citing 6
Cited 6

The parallel execution of DO loops

Communications of the ACM
Parallelism exposure and exploitation in programs

Parallelism exposure and exploitation in programs
Control and data dependence for program transformations.

Control and data dependence for program transformations.
Optimization and interconnection complexity for: parallel processors, single-stage networks, and decision trees

Optimization and interconnection complexity for: parallel processors, single-stage networks, and decision trees
Time and Parallel Processor Bounds for Fortran-Like Loops

IEEE Transactions on Computers
On the Number of Operations Simultaneously Executable in Fortran-Like Programs and Their Resulting Speedup

IEEE Transactions on Computers

Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays

IEEE Transactions on Computers
Complexity of Matrix Product on a Class of Orthogonally Connected Systolic Arrays

IEEE Transactions on Computers
Structured Scheduling of Recurrence Equations: Theory and Practice

Embedded Processor Design Challenges: Systems, Architectures, Modeling, and Simulation - SAMOS
Complexity of matrix product on modular linear systolic arrays for algorithms with affine schedules

Journal of Parallel and Distributed Computing
A reindexing based approach towards mapping of DAG with affine schedules onto parallel embedded systems

Journal of Parallel and Distributed Computing
Short Communication: Synthesis of algorithms on processor arrays

Parallel Computing

Quantified Score

Hi-index	14.99

Visualization

Abstract

This correspondence is concerned with the development of algorithms for special-purpose VLSI arrays. The approach used in this correspondence is to identify algorithm transformations which modify favorably the index set and the data dependences, but perserve the ordering imposed on the index set by the data dependences. Conditions for the existance of such transformations are given for a class of algorithms. Also, a methodology is proposed for the synthesis of VLSI algorithms.