Sökning: "heterogeneous multiprocessors"
Hittade 4 avhandlingar innehållade orden heterogeneous multiprocessors.
1. Scheduling techniques to improve the worst-case execution time of real-time parallel applications on heterogeneous platforms
Sammanfattning : The key to providing high performance and energy-efficient execution for hard real-time applications is the time predictable and efficient usage of heterogeneous multiprocessors. However, schedulability analysis of parallel applications executed on unrelated heterogeneous multiprocessors is challenging and has not been investigated adequately by earlier works. LÄS MER
2. Techniques to Improve Energy Efficiency on Heterogeneous Multiprocessors under Timing and Quality Constraints
Sammanfattning : Traditionally, applications are executed without the notion of a computational deadline and often use all available system resources, which leads to higher energy consumption. User specification of Quality of Service (QoS) constraints, in terms of completion time and solution quality, opens up for allocation of just enough resources to an application to finish just in time and thereby save energy. LÄS MER
3. Runtime Management of Multiprocessor Systems for Fault Tolerance, Energy Efficiency and Load Balancing
Sammanfattning : Efficiency of modern multiprocessor systems is hurt by unpredictable events: aging causes permanent faults that disable components; application spawnings and terminations taking place at arbitrary times, affect energy proportionality, causing energy waste; load imbalances reduce resource utilization, penalizing performance. This thesis demonstrates how runtime management can mitigate the negative effects of unpredictable events, making decisions guided by a combination of static information known in advance and parameters that only become known at runtime. LÄS MER
4. Techniques to Tighten the Upper Bound on the ExecutionTime of Task-based Parallel Applications
Sammanfattning : To use multiprocessors in hard real-time systems, schedulability analysis is needed to provide formally proven guarantees for the timing behavior of the system. Programming models for parallel applications, such as OpenMP, use pragmas to specify parts of the application as parallel tasks, for example, a function or a body of a loop. LÄS MER