Sökning: "Christian Schulte"

Visar resultat 1 - 5 av 7 avhandlingar innehållade orden Christian Schulte.

  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 :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

  3. 2. 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 :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

  4. 3. Universal Instruction Selection

    Författare :Gabriel Hjort Blindell; Christian Schulte; Peter van Beek; KTH; []
    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

  5. 4. Performance Optimization Techniques and Tools for Distributed Graph Processing

    Författare :Vasiliki Kalavri; Vladimir Vlassov; Christian Schulte; Seif Haridi; Peter Van Roy; Peter Boncz; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Graph processing; distributed systems; big data; Informations- och kommunikationsteknik; Information and Communication Technology;

    Sammanfattning : In this thesis, we propose optimization techniques for distributed graph processing. First, we describe a data processing pipeline that leverages an iterative graph algorithm for automatic classification of web trackers. LÄS MER

  7. 5. Techniques for Efficient Constraint Propagation

    Författare :Mikael Zayenz Lagerkvist; Seif Haridi; Christian Schulte; Pierre Flener; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; constraint programming; constraint propagation; optimization; Computer science; Datalogi;

    Sammanfattning : This thesis explores three new techniques for increasing the efficiency of constraint propagation: support for incremental propagation, improved representation of constraints, and abstractions to simplify propagation.  Support for incremental propagation is added to a propagator centered propagation system by adding a new intermediate layer of abstraction, advisors, that capture the essential aspects of a variable centered system. LÄS MER