Algebraic Techniques in Systolic Array Design.

Abstract

The goal of this project was to develop an abstract mathematical framework general enough to include the standard mesh-connected architectures as well as more complex ones such as the cube-connected cycles, but restricted enough that the algebraic techniques used (sporadically) in the analysis of systolic arrays could be generalized and applied. The authors content that node-transitive networks, based especially on Cayley graphs, offer such a framework, though whether such networks provide a truly viable theory for modelling synchronous parallel computations remains to be seen. This report describes how to restrict the theory of synchronous parallel architectures to such networks, as well as demonstrating the applicability of algebraic techniques to such networks. It also describes various tools, such as the programming language MHDL, which were developed to aid in the study of these networks. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1984
Accession Number
ADA146417

Entities

People

  • C. G. Wright
  • G. E. Carlsson
  • H. B. Sexton
  • M. J. Shensa

Tags

Communities of Interest

  • Advanced Electronics
  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • C Programming Language
  • Computations
  • Computer Languages
  • Computer Programming
  • Computer Science
  • Computers
  • Language
  • Mathematics
  • Numerical Analysis
  • Operating Systems
  • Parallel Computing
  • Parallel Processing
  • Programming Languages
  • Standards
  • Very Large Scale Integration

Fields of Study

  • Computer science

Readers

  • Graph Algorithms and Convex Optimization.
  • Parallel and Distributed Computing.
  • Systems Analysis and Design