Expanding CGA Acceleration Regions Using Compiler-Driven Architecture Extensions
- Authors
- Choi, J[Choi, Jungsik]; Kim, S[Kim, Seonggun]; Han, H[Han, Hwansoo]
- Issue Date
- Jul-2012
- Publisher
- INT INFORMATION INST
- Keywords
- Instruction extensions; Loop acceleration; Coarse-
- Citation
- INFORMATION-AN INTERNATIONAL INTERDISCIPLINARY JOURNAL, v.15, no.7, pp.2787 - 2802
- Indexed
- SCIE
SCOPUS
- Journal Title
- INFORMATION-AN INTERNATIONAL INTERDISCIPLINARY JOURNAL
- Volume
- 15
- Number
- 7
- Start Page
- 2787
- End Page
- 2802
- URI
- https://scholarworks.bwise.kr/skku/handle/2021.sw.skku/64979
- ISSN
- 1343-4500
- Abstract
- Aggressive embedded processors are often equipped with general purpose cores and special purpose acceleration logics. In our paper, we consider a reconfigurable processor that consists of very long instruction word (VLIW) cores and coarse grained arrays (CGAs). CGAs are particularly used to enhance the performance by exploiting loop parallelism, while VLIW cores rely on discovering instruction level parallelism. For time consuming loops, CGAs can accelerate them with powerful pipeline scheduling. However, not all loops can be accelerated by CGAs. Outer loops and loops containing function calls cannot be candidates for CGA acceleration. In our paper, we adopt instruction extensions to convert code fragments in outer loops and simple functions into single instructions. With the extended instructions in CGA, more loops can be accelerated with CGA. In addition, we transform loop structures to include larger regions for CGA acceleration. Our experiment with mpeg2dec and epic from Mediabench shows 44% and 46% performance increases, respectively.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Computing and Informatics > Computer Science and Engineering > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/skku/handle/2021.sw.skku/64979)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.