Abstract

Stream processor is efficient for media applications as it exploits the features of media processing, such as data parallelism, producer-consumer locality and so on. However, the loosely coupled structure between host and stream processor makes the communication between scalar and SIMD part costly and scheduling across kernels less flexible. Besides, the kernel loading time adds additional cost. When the stream length becomes shorter the performance degradation caused by these factors is unacceptable. In addition to the loosely coupled structure, lack of efficient support for chained scalar and SIMD kernels makes the case worse. To overcome these shortcomings of stream processor, we propose a target architecture named AIFSP, which merges the host and stream processor together into a tightly coupled structure with both scalar and SIMD part. The whole processor can run in a single or dual instruction flow mode, adaptive to the characteristic of applications. When running in a single instruction flow mode, costless communication between scalar and SIMD part, flexible scheduling across kernels and zero kernel loading time can be achieved, the speedup for short streams can reach 2.6x, while in dual instruction flow mode, the scalar and SIMD kernels can run concurrently on scalar and SIMD part of AIFSP, thus kernel overlapping is realized and about 20% performance improving can be attained when SIMD width is set to 8, with the increase of SIMD width, the performance gain will be larger.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.