Applying Data Mapping Techniques to Vector DSPs |
| |
Authors: | Peter Westermann Ludwig Schwoerer Andre Kaufmann |
| |
Affiliation: | (1) Circuits and Systems Lab, Dortmund University of Technology, Otto-Hahn-Str. 4, 44221 Dortmund, Germany;(2) Institute for Communication & Electronics, Bochum University of Applied Sciences, Lennershofstr. 140, 44801 Bochum, Germany;(3) Nokia GmbH, Meesmannstr. 103, 44807 Bochum, Germany |
| |
Abstract: | Vector digital signal processors (DSPs) offer a good performance to power consumption ratio. Therefore, they are suitable
for mobile devices in software defined radio applications. These vector DSPs require input algorithms with vector operations.
The performance of vectorized algorithms to a great extent depends on the distribution of data on vector elements. Traditional
algorithms for vectorization focus on the extraction of parallelism from a program; we propose an analysis tool that focuses
on the selection of an efficient dynamic data mapping for vector DSPs. We transferred Garcia’s communication parallelism graph
(Garcia et al., IEEE Trans Parallel Distrib Syst 12: 416–431, 2001) for distributed memory multiprocessor systems to vector DSPs. By alternating the representation of two-dimensional data
distributions and the cost models, we are able to determine a dynamic mapping of data on vector elements on the Embedded Vector
Processor (EVP) (van Berkel et al., Proceedings of the 2004 software-defined radio technical conference SDR’04, 2004). Additionally, we propose a new efficient algorithm for processing the graph representation that operates in two steps.
We demonstrate the capabilities of our tool by describing the vectorization of some MIMO OFDM algorithms.
|
| |
Keywords: | Vector DSPs Vectorizing compilers |
本文献已被 SpringerLink 等数据库收录! |
|