Fast graph-based instruction selection for multi-output instructions

作者: Jonghee M. Youn , Jongwon Lee , Yunheung Paek , Jongeun Lee , Hanno Scharwaechter

DOI: 10.1002/SPE.1034

关键词:

摘要: A multi-output instruction (MOI) is an that produces multiple outputs to its destination locations. Such inherently parallel instructions are becoming more and popular in embedded processors, due the advances application-specific architectures. In order provide high-level programmability thus guarantee widespread acceptance, sophisticated compiler support for these programmable cores necessary. However, traditional tree-based approaches selection, although very fast, fail exploit MOIs mainly because of fundamental limitation tree representation. fact, generate optimal code with requires a general graph-based formulation selection problem, which at least NP-complete. this paper we present new methodology automatically from simple set descriptions, selectors can effectively utilize all provided including MOIs. Our experimental results using benchmarks on target processor various up two demonstrate our generated quickly many application level, therefore highly desirable both architecture exploration as generators after fixed. Copyright © 2010 John Wiley & Sons, Ltd. (This revised expanded version published Fifth IEEE/ACM International Conference Hardware/Software Codesign System Synthesis (CODES+ISSS), September 2007 1.)

参考文章(25)
Matthias Gries, Kurt Keutzer, Building ASIPs: The Mescal Methodology ,(2006)
Todd A. Proebsting, David R. Hanson, Christopher W. Fraser, Engineering E cient Code Generators using Tree Matching and Dynamic Programming ,(2007)
Erik Eckstein, Oliver König, Bernhard Scholz, Code Instruction Selection Based on SSA-Graphs software and compilers for embedded systems. pp. 49- 65 ,(2003) , 10.1007/978-3-540-39920-9_5
David R. Hanson, Christopher W. Fraser, A Retargetable C Compiler: Design and Implementation ,(1995)
Heinrich Meyr, Rainer Leupers, Andreas Hoffmann, Architecture Exploration for Embedded Processors with LISA ,(2002)
Davidson, Landskov, Shriver, Mallett, Some Experiments in Local Microcode Compaction for Horizontal Machines IEEE Transactions on Computers. ,vol. 30, pp. 460- 477 ,(1981) , 10.1109/TC.1981.1675826
Shuichi Sakai, Mitsunori Togasaki, Koichi Yamazaki, A note on greedy algorithms for the maximum weighted independent set problem Discrete Applied Mathematics. ,vol. 126, pp. 313- 322 ,(2003) , 10.1016/S0166-218X(02)00205-6
Ashok Halambi, Peter Grun, Vijay Ganesh, Asheesh Khare, Nikil Dutt, Alex Nicolau, EXPRESSION Proceedings of the conference on Design, automation and test in Europe - DATE '99. pp. 485- 490 ,(1999) , 10.1145/307418.307549
Hanno Scharwaechter, David Kammler, Andreas Wieferink, Manuel Hohenauer, Kingshuk Karuri, Jianjiang Ceng, Rainer Leupers, Gerd Ascheid, Heinrich Meyr, ASIP architecture exploration for efficient IPSec encryption ACM Transactions on Embedded Computing Systems. ,vol. 6, pp. 12- ,(2007) , 10.1145/1234675.1234679
M. Anton Ertl, Optimal code selection in DAGs Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '99. pp. 242- 249 ,(1999) , 10.1145/292540.292562