21 December 1998 Efficiency of microSIMD architectures and index-mapped data for media processors
Author Affiliations +
We show that microSIMD architectures are more efficient for media processing than other parallel architectures like SIMD or MIMD parallel processor architectures, and VLIW or superscalar architectures. We define alternative mappings of data onto subwords, and show that the index mapping is an ideal mapping for achieving maximal subword parallelism with minimal revamping of the original serial loop code. We show an example where packed data loaded directly into registers from memory can be interpreted as index-mapped data rather than area-mapped data. This allows increased use of the subword parallelism provided by the microSIMD architecture, by exploiting data parallelism across loop iterations rather than within a loop. We also show how to convert rapidly between data mappings by using the Mix permutation instruments, first defined in the MAX-2 multimedia extensions for PA-RISC processors. We propose a new instruction, MixPair, which cuts by half the cost of parallel Mix functional units, while achieving maximum subword permutation performance.
© (1998) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ruby B. Lee, Ruby B. Lee, } "Efficiency of microSIMD architectures and index-mapped data for media processors", Proc. SPIE 3655, Media Processors 1999, (21 December 1998); doi: 10.1117/12.334770; https://doi.org/10.1117/12.334770


Tensor decomposition-based color image watermarking
Proceedings of SPIE (January 09 2014)
Image Processing and Geographic Information
Proceedings of SPIE (December 18 1985)
Scanline algorithms in compressed domain
Proceedings of SPIE (March 21 1996)
ANDROX Parallel Image Array Processor
Proceedings of SPIE (March 21 1988)

Back to Top