Avancerad sökning

Visar resultat 6 - 7 av 7 avhandlingar som matchar ovanstående sökkriterier.

1. 6. 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. 7. Short-term Underground Mine Scheduling : Constraint Programming in an Industrial Application

   Författare :Max Åstrand; Mikael Johansson; Christian Schulte; KTH; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; scheduling; mining; mine; underground; constraint programming; cp; large neighborhood search; lns; Electrical Engineering; Elektro- och systemteknik;

   Sammanfattning : The operational performance of an underground mine depends critically on how the production is scheduled. Increasingly advanced methods are used to create optimized long-term plans, and simultaneously the actual excavation is getting more and more automated. LÄS MER