Sökning: "multiprocessor scheduling"

Visar resultat 1 - 5 av 24 avhandlingar innehållade orden multiprocessor scheduling.

1. 1. Insights on non-partitioned fixed-priority preemptive scheduling

   Författare :Björn Andersson; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; real-time systems; non-partitioned method; fixed-priority scheduling; static-priority scheduling; multiprocessor; shared-memory multiprocessor; real-time scheduling; scheduling anomalies; global scheduling; Dhall s effect;

   Sammanfattning : .... LÄS MER

3. 2. Scheduling Algorithms For Fault-Tolerant Real-Time Systems

   Författare :Risat Pathan; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Online Scheduling; Partitioned Scheduling; Rate-Monotonic Scheduling; Multiprocessors; Uniprocessor; Task-Splitting Algorithms; Periodic Task Scheduling; Real-Time Systems; Fault-Tolerant Scheduling;

   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

4. 3. Techniques to Tighten the Upper Bound on the ExecutionTime of Task-based Parallel Applications

   Författare :Petros Voudouris; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Scheduling; Multiprocessor; WCET; Uniform; Hard; multicore; Related; DAG; Real-Time; Dynamic; Unrelated; Makespan; Homogeneous; Parallel; Identical;

   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

5. 4. Exploiting Fine-grain Parallelism in Concurrent Constraint Languages

   Författare :Johan Montelius; RISE; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Implicit parallelism; Concurrent Constraint Programming; Cache performance; Logic programming; Abstract machine; Parallel execution; Scheduling; Multiprocessor; Shared memory;

   Sammanfattning : This dissertation presents the design, implementation, and evaluation of a system that exploits fine-grain implicit parallelism in concurrent constraint programming language. The system is able to outperform a C implementation of an algorithm with complex dependencies without any user annotations. LÄS MER

7. 5. Reducing Energy Consumption through Adaptive Shutdown Scheduling on a Chip-Multiprocessor

   Författare :Mladen Nikitovic; KTH; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; mobile terminals; CMP; energy; power consumption; scheduling;

   Sammanfattning : There is seemingly a never-ending consumer demand for mobileterminals such as cellular phones and personal digitalassistants (PDAs). Each new generation of terminals comes withmore elaborate functions than in the previous generation. LÄS MER