Retargeting image-processing algorithms to varying processor grain sizes
Embedded computing architectures can be designed to meet a variety of application specific requirements. However, optimized hardware can require compiler support to realize the potential of the hardware. This is especially true for embedded image processing systems where significant architectural va...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Embedded computing architectures can be designed to meet a variety of application specific requirements. However, optimized hardware can require compiler support to realize the potential of the hardware. This is especially true for embedded image processing systems where significant architectural variation is possible, and targeted software can change drastically based on architectural variation. This paper presents methods to compile a single high-level source given a fundamental variation in data-parallel target architectures - processor granularity ranging from a single processor to a massively parallel processor array. The approach uses single PPE virtualization, which supports pixel-level data-parallel expressions that operate on a virtual one pixel per processing element (PPE) network and applies pixel-locating transformations to retarget the code into a given target PPE. Unlike mainstream parallel computing techniques, this technique can be applied to lightweight SIMD targets that do not provide global communication hardware or shared memory |
---|---|
ISSN: | 0190-3918 2332-5690 |
DOI: | 10.1109/ICPPW.2006.67 |