Search for dissertations about: "Ingo Sander"
Showing result 1 - 5 of 9 swedish dissertations containing the words Ingo Sander.
-
1. System Modeling and Design Refinement in ForSyDe
Abstract : Advances in microelectronics allow the integration of more andmore functionality on a single chip. Emerging system-on-a-chiparchitectures include a large amount of heterogeneous componentsand are of increasing complexity. Applications using thesearchitectures require many low-level details in order to yield anefficient implementation. READ MORE
-
2. Managing the Complexity in Embedded and Cyber-Physical System Design : System Modeling and Design-Space Exploration
Abstract : To cope with the increasing complexity of embedded and cyber-physical system design, different system-level design approaches are proposed which start from abstract models and implement them using design flows with high degrees of automation. However, creating models of such systems and also formulating the mathematical problems arising in these design flows are themselves challenging tasks. READ MORE
-
3. Methods and Tool Support for Analyzing Architectural Models of Embedded Systems
Abstract : Embedded systems are ubiquitous in the modern world. They are microcomputers most often included incomplete devices consisting of software and hardware. Embedded systems range from small devices to large systems monitoring and controlling complex processes. READ MORE
-
4. 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
-
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