Sökning: "Periodic Task Scheduling"

Visar resultat 1 - 5 av 11 avhandlingar innehållade orden Periodic Task Scheduling.

1. 1. 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

3. 2. LQG-Based Real-Time Scheduling and Control Codesign

   Författare :Yang Xu; Institutionen för reglerteknik; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; LQG control; Real-time system; Scheduling; Time-delay system;

   Sammanfattning : Having multiple control tasks concurrently running on a single computing platform increases the processor utilization but degrades the control performance due to delay and jitter. In scheduling and control codesign, the objective is to optimize the combined performance of all the controllers, subject to a schedulability constraint. LÄS MER

4. 3. Static-priority Scheduling on Multiprocessors

   Författare :Björn Andersson; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

   Sammanfattning : This thesis deals with the problem of scheduling a set of tasks to meet deadlines on a computer with multiple processors. Static-priority scheduling is considered, that is, a task is assigned a priority number that never changes and at every moment the highest-priority tasks that request to be executed are selected for execution. LÄS MER

5. 4. Real-Time Workload Models : Expressiveness vs. Analysis Efficiency

   Författare :Martin Stigge; Wang Yi; Sanjoy Baruah; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Real-time systems; task models; EDF; fixed-priority scheduling; schedulability analysis; response-time analysis; abstraction refinement; Computer Science with specialization in Real Time Systems; Datavetenskap med inriktning mot realtidssystem;

   Sammanfattning : The requirements for real-time systems in safety-critical applications typically contain strict timing constraints. The design of such a system must be subject to extensive validation to guarantee that critical timing constraints will never be violated while the system operates. LÄS MER

7. 5. Task Placement and Resource Allocation in Edge Computing Systems

   Författare :Sladana Josilo; György Dán; Ben Liang; KTH; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Electrical Engineering; Elektro- och systemteknik;

   Sammanfattning : The evolution of wireless and hardware technology has led to the rapiddevelopment of a variety of mobile applications. Common to these applicationsis that they have low latency and high computational requirementsthat often cannot be fulfilled by individual devices due to their insufficientcomputational power, memory and battery capacity. LÄS MER