Sökning: "Uniprocessor"
Visar resultat 1 - 5 av 10 avhandlingar innehållade ordet Uniprocessor.
1. Scheduling Algorithms For Fault-Tolerant Real-Time Systems
Sammanfattning : 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
2. Limited Preemptive Scheduling in Real-time Systems
Sammanfattning : Preemptive and non-preemptive scheduling paradigms typically introduce undesirable side effects when scheduling real-time tasks, mainly in the form of preemption overheads and blocking, that potentially compromise timeliness guarantees. The high preemption overheads in preemptive real-time scheduling may imply high resource utilization, often requiring significant over-provisioning, e. LÄS MER
3. Compiling Concurrent Programs for Manycores
Sammanfattning : The arrival of manycore systems enforces new approaches for developing applications in order to exploit the available hardware resources. Developing applications for manycores requires programmers to partition the application into subtasks, consider the dependence between the subtasks, understand the underlying hardware and select an appropriate programming model. LÄS MER
4. Tools to Compile Dataflow Programs for Manycores
Sammanfattning : The arrival of manycore systems enforces new approaches for developing applications in order to exploit the available hardware resources. Developing applications for manycores requires programmers to partition the application into subtasks, consider the dependence between the subtasks, understand the underlying hardware and select an appropriate programming model. LÄS MER
5. Models and Complexity Results in Real-Time Scheduling Theory
Sammanfattning : When designing real-time systems, we want to prove that they will satisfy given timing constraints at run time. The main objective of real-time scheduling theory is to analyze properties of mathematical models that capture the temporal behaviors of such systems. LÄS MER