Sökning: "Roberto Castañeda Lozano"
Hittade 2 avhandlingar innehållade orden Roberto Castañeda Lozano.
1. Constraint-Based Register Allocation and Instruction Scheduling
Sammanfattning : Register allocation (mapping variables to processor registers or memory) and instruction scheduling (reordering instructions to improve latency or throughput) are central compiler problems. This dissertation proposes a combinatorial optimization approach to these problems that delivers optimal solutions according to a model, captures trade-offs between conflicting decisions, accommodates processor-specific features, and handles different optimization criteria. LÄS MER
2. Integrated Register Allocation and Instruction Scheduling with Constraint Programming
Sammanfattning : This dissertation proposes a combinatorial model, program representations, and constraint solving techniques for integrated register allocation and instruction scheduling in compiler back-ends. In contrast to traditional compilers based on heuristics, the proposed approach generates potentially optimal code by considering all trade-offs between interdependent decisions as a single optimization problem. LÄS MER