Sökning: "Instruction Scheduling"

Visar resultat 1 - 5 av 15 avhandlingar innehållade orden Instruction Scheduling.

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

    Detta är en avhandling från Stockholm : KTH Royal Institute of Technology

    Författare :Roberto Castañeda Lozano; KTH.; [2018]
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; 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

  2. 2. Universal Instruction Selection

    Detta är en avhandling från KTH Royal Institute of Technology

    Författare :Gabriel Hjort Blindell; KTH.; KTH.; [2018]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; instruction selection; code generation; compilers; constraint programming; combinatorial optimization; Informations- och kommunikationsteknik; Information and Communication Technology;

    Sammanfattning : In code generation, instruction selection chooses instructions to implement a given program under compilation, global code motion moves computations from one part of the program to another, and block ordering places program blocks in a consecutive sequence. Local instruction selection chooses instructions one program block at a time while global instruction selection does so for the entire function. LÄS MER

  3. 3. Integrated Optimal Code Generation for Digital Signal Processors

    Detta är en avhandling från Institutionen för datavetenskap

    Författare :Andrzej Bednarski; Linköpings universitet.; Linköpings universitet.; [2006]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Instruction-level parallelism; integrated code generation; dynamic programming; instruction scheduling; instruction selection; clustered VLIW architecture; integer linear programming; architecture description language; TECHNOLOGY Information technology Computer science; TEKNIKVETENSKAP Informationsteknik Datavetenskap;

    Sammanfattning : In this thesis we address the problem of optimal code generation for irregular architectures such as Digital Signal Processors (DSPs). Code generation consists mainly of three interrelated optimization tasks: instruction selection (with resource allocation), instruction scheduling and register allocation. LÄS MER

  4. 4. Integrated Software Pipelining

    Detta är en avhandling från Linköping : Linköping University Electronic Press

    Författare :Mattias Eriksson; Linköpings universitet.; Linköpings universitet.; [2009]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Code generation; compilers; instruction scheduling; register allocation; spill code generation; modulo scheduling; integer linear programming; genetic programming.; TECHNOLOGY Information technology Computer science; TEKNIKVETENSKAP Informationsteknik Datavetenskap;

    Sammanfattning : In this thesis we address the problem of integrated software pipelining for clustered VLIW architectures. The phases that are integrated and solved as one combined problem are: cluster assignment, instruction selection, scheduling, register allocation and spilling. LÄS MER

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

    Detta är en avhandling från Stockholm, Sweden : KTH Royal Institute of Technology

    Författare :Roberto Castañeda Lozano; Roberto Castaneda Lozano; KTH.; Computer Systems Laboratory.; [2014]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; 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