Code Generation for Embedded Processors 2002
DOI: 10.1007/978-1-4615-2323-9_12
|View full text |Cite
|
Sign up to set email alerts
|

A Unified Code Generation Approach Using Mutation Scheduling

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2003
2003
2016
2016

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 15 publications
(9 citation statements)
references
References 0 publications
0
9
0
Order By: Relevance
“…The last item we will discuss is a technique called mutation scheduling, 4 which was introduced in 1994 by Novack et al [267,268]. Mutation scheduling is technically a form of instruction scheduling that primarily targets VLIW architectures, but it also integrates a sufficient amount of instruction selection to warrant being included in this book.…”
Section: Improving Code Quality With Mutation Schedulingmentioning
confidence: 99%
“…The last item we will discuss is a technique called mutation scheduling, 4 which was introduced in 1994 by Novack et al [267,268]. Mutation scheduling is technically a form of instruction scheduling that primarily targets VLIW architectures, but it also integrates a sufficient amount of instruction selection to warrant being included in this book.…”
Section: Improving Code Quality With Mutation Schedulingmentioning
confidence: 99%
“…EXPRESS uses the GCC C frontend and performs different global optimizations like loop unrolling. The backend is built on top of the Mutation Scheduling technique [173], which aims at coupling the code selection and register allocation phases with a global instruction scheduler by comparing several alternative ways to map data flow graphs into machine code. EXPRESS also emphasizes the phase ordering problem for different code optimizations.…”
Section: Pipeline and Transfer Pathsmentioning
confidence: 99%
“…The compiler for TriMedia processor uses a technique much like the scheme in [2] to combine register allocation and scheduling [25]. Hanono and Devadas [22], and Novak et al [41] proposed code generation schemes for embedded processors, which combine the code selection, register allocation, and instruction scheduling phases. Motwani et al provides NPcompleteness results of a simple instance of combined register allocation and instruction scheduling problem (CRISP) and an algorithm called the [38].…”
Section: Related Workmentioning
confidence: 99%