Sökning: "Multiprocessor computer"
Visar resultat 1 - 5 av 56 avhandlingar innehållade orden Multiprocessor computer.
1. 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
2. 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
3. Predictable Real-Time Applications on Multiprocessor Systems-on-Chip
Detta är en avhandling från Linköping : Linköping University Electronic PressSammanfattning : 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
4. Runtime Management of Multiprocessor Systems for Fault Tolerance, Energy Efficiency and Load Balancing
Detta är en avhandling från Linköping : Linköping University Electronic PressSammanfattning : 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
5. Scheduling Algorithms For Fault-Tolerant Real-Time Systems
Detta är en avhandling från Linköping : Linköping University Electronic PressSammanfattning : This thesis deals with the problem of designing efficient fault-tolerant real-time scheduling algorithms for independent periodic tasks on uni- and multiprocessor platforms. The well-known Rate-Monotonic (RM) scheduling algorithm is assumed as it is widely used in many commercial systems due to its simplicity and ease of implementation. LÄS MER
