Optimized address assignment for DSPs with SIMD memory accesses

  • Authors:
  • Markus Lorenz;David Koffmann;Steven Bashford;Rainer Leupers;Peter Marwedel

  • Affiliations:
  • Dept. of Computer Science 12, University of Dortmund, Germany;Dept. of Computer Science 12, University of Dortmund, Germany;Dept. of Computer Science 12, University of Dortmund, Germany;Dept. of Computer Science 12, University of Dortmund, Germany;Dept. of Computer Science 12, University of Dortmund, Germany

  • Venue:
  • Proceedings of the 2001 Asia and South Pacific Design Automation Conference
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper deals with address assignment in code generation for digital signal processors (DSPs) with SIMD (single instruction multiple data) memory accesses. In these processors data are organized in groups (or partitions), whose elements share one common memory address. In order to optimize program performance for processors with such memory architectures it is important to have a suitable memory layout of the variables. We propose a two-step address assignment technique for scalar variables using a genetic algorithm based partitioning method and a graph based heuristic which makes use of available DSP address generation hardware. We show that our address assignment techniques lead to a significant code quality improvement compared to heuristics.