Dependence Analysis and Architecture Design for Bit-Level Algorithms

  • Authors:
  • Weijia Shang;Benjamin W. Wah

  • Affiliations:
  • University of Southwestern Louisiana;University of Illinois, Urbana-Champaign

  • Venue:
  • ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 01
  • Year:
  • 1993

Quantified Score

Hi-index 0.00

Visualization

Abstract

In designing application-specific bit-level architectures and in programming existing bit-level processor arrays, it is necessary to expand a word-level algorithm into its bit-level form before dependence analysis can be performed. In this paper, we consider dependence structures of bit-level algorithms as functions of three componentsdependence structures of word-level algorithms, dependence structures of the arithmetic algorithms implementing word-wise operations, and algorithm expansions. Based on these components, we can derive dependence structures of bit-level algorithms without using time consuming general dependence analysis methods. To illustrate our approach, we derive two dependence structures for bit-level matrix multiplication and apply a method developed earlier [5,6,10] to design two bit-level architectures. One of these architectures is O{p) times faster than the best word-level architecture, where p is the word length. The speedup we found here is true in general because a bit in a bit-level architecture goes to the next processor for processing as soon as it is available.