Fast graph-based instruction selection for multi-output instructions

Title
Fast graph-based instruction selection for multi-output instructions
Author(s)
윤종희이종원[이종원]백윤흥[백윤흥]이종은[이종은]Hanno Scharwaechter[Hanno Scharwaechter]Rainer Leupers[Rainer Leupers]
Keywords
CODE GENERATION
Issue Date
201105
Publisher
WILEY-BLACKWELL
Citation
SOFTWARE-PRACTICE & EXPERIENCE, v.41, no.6, pp.717 - 736
Abstract
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. Copyright (C) 2010 John Wiley & Sons, Ltd.
URI
http://hdl.handle.net/YU.REPOSITORY/25224http://dx.doi.org/10.1002/spe.1034
ISSN
0038-0644
Appears in Collections:
공과대학 > 컴퓨터공학과 > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE