SIMD defragmenter: efficient ILP realization on data-parallel architectures
- Authors
- Park, Yongjun; Seo, Sangwon; Park, Hyunchul; Cho, Hyoun Kyu; Mahlke, Scott
- Issue Date
- Apr-2012
- Publisher
- Special Interest Group on Computer Graphics, Association for Computing Machinery
- Keywords
- Algorithms; Experimentation; Performance; Compiler; SIMD Architecture; Optimization
- Citation
- SIGPLAN Notices (ACM Special Interest Group on Programming Languages), v.47, no.4, pp.363 - 374
- Indexed
- SCIE
- Journal Title
- SIGPLAN Notices (ACM Special Interest Group on Programming Languages)
- Volume
- 47
- Number
- 4
- Start Page
- 363
- End Page
- 374
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/165854
- DOI
- 10.1145/2248487.2151014
- ISSN
- 0362-1340
- Abstract
- Single-instruction multiple-data (SIMD) accelerators provide an energy-efficient platform to scale the performance of mobile systems while still retaining post-programmability. The central challenge is translating the parallel resources of the SIMD hardware into real application performance. In scientific applications, automatic vectorization techniques have proven quite effective at extracting large levels of data-level parallelism (DLP). However, vectorization is often much less effective for media applications due to low trip count loops, complex control flow, and non-uniform execution behavior. As a result, SIMD lanes remain idle due to insufficient DLP. To attack this problem, this paper proposes a new vectorization pass called SIMD Defragmenter to uncover hidden DLP that lurks below the surface in the form of instruction-level parallelism (ILP). The difficulty is managing the data packing/unpacking overhead that can easily exceed the benefits gained through SIMD execution. The SIMD degragmenter overcomes this problem by identifying groups of compatible instructions (subgraphs) that can be executed in parallel across the SIMD lanes. By SIMDizing in bulk at the subgraph level, packing/unpacking overhead is minimized. On a 16-lane SIMD processor, experimental results show that SIMD defragmentation achieves a mean 1.6x speedup over traditional loop vectorization and a 31% gain over prior research approaches for converting ILP to DLP.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 컴퓨터소프트웨어학부 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/165854)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.