Sökning: "Instruction Scheduling"

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

  1. 1. 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

  2. 2. Universal Instruction Selection

    Författare :Gabriel Hjort Blindell; Christian Schulte; Peter van Beek; KTH; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; 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. Rethinking Dynamic Instruction Scheduling and Retirement for Efficient Microarchitectures

    Författare :Mehdi Alipour; David Black-Schaffer; Stefanos Kaxiras; Mikko H. Lipasti; Uppsala universitet; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Out-of-Order Processors; Energy-Efficient; High-Performance; Instruction Scheduling; Computer Science; Datavetenskap;

    Sammanfattning : Out-of-order execution is one of the main micro-architectural techniques used to improve the performance of both single- and multi-threaded processors. The application of such a processor varies from mobile devices to server computers. LÄS MER

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

    Författare :Andrzej Bednarski; Christoph Kessler; Alain Darte; Linköpings universitet; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Instruction-level parallelism; integrated code generation; dynamic programming; instruction scheduling; instruction selection; clustered VLIW architecture; integer linear programming; architecture description language; Computer science; 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

  5. 5. Integrated Software Pipelining

    Författare :Mattias Eriksson; Christoph Kessler; Sid Ahmed Ali Touati; Linköpings universitet; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Code generation; compilers; instruction scheduling; register allocation; spill code generation; modulo scheduling; integer linear programming; genetic programming.; Computer science; 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