Sökning: "Roberto Castañeda Lozano"

Hittade 3 avhandlingar innehållade orden Roberto Castañeda Lozano.

  1. 1. Integrated Register Allocation and Instruction Scheduling with Constraint Programming

    Författare :Roberto Castaneda Lozano; Computer Systems Laboratory; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP;

    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

  2. 2. Constraint-Based Register Allocation and Instruction Scheduling

    Författare :Roberto Castañeda Lozano; Christian Schulte; Ingo Sander; Mats Carlsson; Laurent Michel; KTH; []
    Nyckelord :ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; TEKNIK OCH TEKNOLOGIER; NATURAL SCIENCES; ENGINEERING AND TECHNOLOGY; constraint programming; combinatorial optimization; register allocation; instruction scheduling; compiler construction; Informations- och kommunikationsteknik; Information and Communication Technology;

    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

  3. 3. Integrated Register Allocation and Instruction Scheduling with Constraint Programming

    Författare :Roberto Castañeda Lozano; Christian Schulte; Mats Carlsson; Ingo Sander; Peter van Beek; KTH; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Computer Science; Datalogi;

    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