2009 IEEE Computer Society Annual Symposium on VLSI 2009
DOI: 10.1109/isvlsi.2009.6
|View full text |Cite
|
Sign up to set email alerts
|

Scheduling for an Embedded Architecture with a Flexible Datapath

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2010
2010
2018
2018

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 6 publications
0
2
0
Order By: Relevance
“…These architectures usually contain a large number of PUs with local storage. However, their current compiler technology (Lee et al 1998;Smith et al 2006;Aijö et al 2016;Guo et al 2006;Schilling et al 2009), although utilizing register bypassing, still relies on classic code generators where the use of a minimal number of registers is in the focus rather than maximizing the degree of ILP. In , we therefore suggested a code generation technique for exposed datapath architectures that is based on a breadth-first traversal rather than the classic depth-first traversal (Sethi and Ullman 1970) over the syntax trees.…”
Section: Motivationmentioning
confidence: 99%
“…These architectures usually contain a large number of PUs with local storage. However, their current compiler technology (Lee et al 1998;Smith et al 2006;Aijö et al 2016;Guo et al 2006;Schilling et al 2009), although utilizing register bypassing, still relies on classic code generators where the use of a minimal number of registers is in the focus rather than maximizing the degree of ILP. In , we therefore suggested a code generation technique for exposed datapath architectures that is based on a breadth-first traversal rather than the classic depth-first traversal (Sethi and Ullman 1970) over the syntax trees.…”
Section: Motivationmentioning
confidence: 99%
“…b) Ordering: When scheduling a basic block, the goal is to create a compact schedule. The scheduling is done by greedily selecting as many instructions as possible according to a priority function, while using each limited resource, such as ALU, memory and multiplier, only once [6]. An instruction can only be scheduled if all the instructions it depends on are already scheduled.…”
Section: ) Flexcomp -The Compilermentioning
confidence: 99%