Sökning: "Global Multiprocessor Scheduling"
Visar resultat 1 - 5 av 9 avhandlingar innehållade orden Global Multiprocessor Scheduling.
1. Insights on non-partitioned fixed-priority preemptive scheduling
Sammanfattning : .... LÄS MER
2. Three Aspects of Real-Time Multiprocessor Scheduling: Timeliness, Fault Tolerance, Mixed Criticality
Sammanfattning : The design of real-time systems faces two important challenges: incorporating more functions/services on existing hardware to make the system more attractive to the market, and deploying existing software on multiprocessors (e.g., multicore) to utilize moreprocessing power. LÄS MER
3. New Techniques for Building Timing-Predictable Embedded Systems
Sammanfattning : Embedded systems are becoming ubiquitous in our daily life. Due to close interaction with physical world, embedded systems are typically subject to timing constraints. At design time, it must be ensured that the run-time behaviors of such systems satisfy the pre-specified timing constraints under any circumstance. LÄS MER
4. 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
5. Predictable Real-Time Applications on Multiprocessor Systems-on-Chip
Sammanfattning : Being predictable with respect to time is, by definition, a fundamental requirement for any real-time system. Modern multiprocessor systems impose a challenge in this context, due to resource sharing conflicts causing memory transfers to become unpredictable. LÄS MER
