Register allocation with instruction scheduling for VLIW-architectures.

Saved in:
Bibliographic Details
Title: Register allocation with instruction scheduling for VLIW-architectures.
Authors: Ivanov, D.1 dimanovs@gmail.com
Source: Programming & Computer Software. Nov2010, Vol. 36 Issue 6, p363-367. 5p.
Subjects: Registers (Computers), Optimizing compilers, Dynamic storage allocation (Computer science), Instructional systems, Algorithms, Information networks, Matrices (Mathematics)
Abstract: Interaction between the phases of register allocation and instruction scheduling are often considered in publications devoted to optimizations for the final stage of compilation. Typically, it is proposed to adapt one of the phase for needs of another without their combination into a single unit. However, their integration can essentially reduce the time of operation and enhance the performance of the resulting code. This study describes an attempt to combine these phases as completely as possible with account for the features of static scheduling for VLIW-architectures. [ABSTRACT FROM AUTHOR]
Copyright of Programming & Computer Software is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Be the first to leave a comment!
You must be logged in first