Issues in Instruction Scheduling

dc.contributor.authorSchielke, Philip 15, 1998
dc.description.abstractInstruction scheduling is a code reordering transformation that attempts to hide latencies present in modern day microprocessors. Current applications of these microprocessors and the microprocessors themselves present new parameters under which the scheduler must operate. For example, some multiple functional unit processors have partitioned register sets. In some applications, increasing the static size of a program may not be an acceptable tradeoff for gaining improved running time. The interaction between the scheduler and the register allocator can also dramatically affect the performance of the compiled code. In this work we will look at global scheduling techniques that do not replicate code, including scheduling overextended basic blocks. We also look at a replacement to the traditional list scheduler based on the techniques of iterative repair. Finally, we explore the interaction between instruction scheduling and register allocation, and look at ways of combining the two problems.
dc.format.extent27 pp
dc.identifier.citationSchielke, Philip. "Issues in Instruction Scheduling." (1998)
dc.rightsYou are granted permission for the noncommercial reproduction, distribution, display, and performance of this technical report in any format, but this permission is only for a period of forty-five (45) days from the most recent time that you verified that this technical report is still available from the Computer Science Department of Rice University under terms that include this permission. All other rights are reserved by the author(s).
dc.titleIssues in Instruction Scheduling
dc.typeTechnical report
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
1.69 MB
Adobe Portable Document Format