Sciweavers

12 search results - page 1 / 3
» Improving Register Allocation for Subscripted Variables
Sort
View
PLDI
1990
ACM
13 years 9 months ago
Improving Register Allocation for Subscripted Variables
David Callahan, Steve Carr, Ken Kennedy
ICALP
2007
Springer
13 years 11 months ago
Aliased Register Allocation for Straight-Line Programs Is NP-Complete
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of regis...
Jonathan K. Lee, Jens Palsberg, Fernando Magno Qui...
ASAP
2007
IEEE
112views Hardware» more  ASAP 2007»
13 years 7 months ago
Scheduling Register-Allocated Codes in User-Guided High-Level Synthesis
In high-level synthesis, as for compilers, an important question is when register assignment should take place. Unlike compilers for which the processor architecture is given, syn...
Alain Darte, C. Quinson
ISCAS
2003
IEEE
96views Hardware» more  ISCAS 2003»
13 years 10 months ago
A novel improvement technique for high-level test synthesis
Improving testability during the early stages of High-Level Synthesis (HLS) has several benefits, including reduced test hardware overhead, reduced test costs, reduced design iter...
Saeed Safari, Hadi Esmaeilzadeh, Amir-Hossein Jaha...
CC
2008
Springer
138views System Software» more  CC 2008»
13 years 7 months ago
Improved Memory-Access Analysis for x86 Executables
Over the last seven years, we have developed static-analysis methods to recover a good approximation to the variables and dynamically allocated memory objects of a stripped executa...
Thomas W. Reps, Gogul Balakrishnan