Advanced search
Showing result 1 - 5 of 30 swedish dissertations matching the above criteria.
-
1. Constraint-Based Register Allocation and Instruction Scheduling
Abstract : 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. READ MORE
-
2. Interprocedural register allocation for lazy functional languages
Abstract : .... READ MORE
-
3. Type Based Techniques for Covert Channel Elimination and Register Allocation
Abstract : As the title suggests, this thesis consists of two parts that address two rather different topics. The first part investigates secure information flow in sequential programs, with the aim of completely eliminating covert timing channels. The second part presents a technique to describe register allocation for a functional language. READ MORE
-
4. A typed functional language for expressing register usage
Abstract : .... READ MORE
-
5. Integrated Register Allocation and Instruction Scheduling with Constraint Programming
Abstract : 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. READ MORE