Sökning: "fixed-priority scheduling"

Visar resultat 1 - 5 av 14 avhandlingar innehållade orden fixed-priority 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. Three Aspects of Real-Time Multiprocessor Scheduling: Timeliness, Fault Tolerance, Mixed Criticality

   Författare :Risat Pathan; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Mixed-Criticality Systems; Fault-Tolerant Scheduling; Fixed Priority; Real-Time Systems; Global Multiprocessor Scheduling; Time Redundancy; Sporadic Tasks;

   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

4. 3. New Techniques for Building Timing-Predictable Embedded Systems

   Författare :Nan Guan; Wang Yi; Lothar Thiele; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Real-time systems; WCET analysis; cache analysis; abstract interpretation; multiprocessor scheduling; fixed-priority scheduling; EDF; multi-core processors; response time analysis; utilization bound; real-time calculus; scalability; Datavetenskap med inriktning mot realtidssystem; Computer Science with specialization in Real Time 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

5. 4. Transformation methods for off-line schedules to attributes for fixed priority scheduling

   Författare :Radu Dobrin; Mälardalens högskola; []
   Nyckelord :;

   Sammanfattning : .... LÄS MER

7. 5. Preemption-Delay Aware Schedulability Analysis of Real-Time Systems

   Författare :Filip Marković; Jan Carlson; Radu Dobrin; Björn Lisper; Enrico Bini; Mälardalens högskola; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Real-time systems; Scheduling; Schedulability analysis; Preemptions; Preemption delays; Embedded Systems; Preemptive scheduling; Response-time analysis; Cache-related preemption delay; Timing analysis; Worst-case execution time analysis; Limited-preemptive scheduling; Fixed preemption points; Computer Science; datavetenskap;

   Sammanfattning : Schedulability analysis of real-time systems under preemptive scheduling may often lead to false-negative results, deeming a schedulable taskset being unschedulable. This is the case due to the inherent over-approximation of many time-related parameters such as task execution time, system delays, etc. LÄS MER