Fast graph-based instruction selection for multi-output instructions
Cited 0 times inCited 1 times in
- Fast graph-based instruction selection for multi-output instructions
- Youn, Jonghee M.; Lee, Jongwon; Paek, Yunheung; Lee, Jongeun; Scharwaechter, Hanno; Leupers, Rainer
- Application level; Application-Specific; Architecture exploration; ASIP; Code Generation; Code generators; compiler/architecture co-design; Destination location; Embedded processors; Fundamental limitations; General graph; Graph-based; Instruction selection; Instruction set; ISS; Multi-output; Multiple outputs; NP Complete; Optimal codes; Parallel instructions; Programmability; Programmable cores; Tree representation; Tree-based approach
- Issue Date
- SOFTWARE-PRACTICE & EXPERIENCE, v.41, no.6, pp.717 - 736
- A multi-output instruction (MOI) is an instruction that produces multiple outputs to its destination locations. Such inherently parallel instructions are becoming more and more popular in embedded processors, due to the advances in application-specific architectures. In order to provide high-level programmability and thus guarantee widespread acceptance, sophisticated compiler support for these programmable cores is necessary. However, traditional tree-based approaches for instruction selection, although very fast, fail to exploit MOIs mainly because of the fundamental limitation of the tree representation. In fact, to generate optimal code with MOIs requires a more general graph-based formulation of the instruction selection problem, which is at least NP-complete. In this paper we present a new methodology to automatically generate from simple instruction set descriptions, graph-based code selectors that can effectively utilize all provided instructions including MOIs. Our experimental results using a set of benchmarks on a target processor with various MOIs of up to two outputs demonstrate that our generated code selectors can quickly and effectively exploit many MOIs at the application level, and therefore are highly desirable both for architecture exploration and as code generators after architecture is fixed.
- ; Go to Link
- Appears in Collections:
- EE_Journal Papers
- Files in This Item:
can give you direct access to the published full text of this article. (UNISTARs only)
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.