Sökning: "worst-case execution time"

Visar resultat 1 - 5 av 38 avhandlingar innehållade orden worst-case execution time.

1. 1. Processor Pipelines and Static Worst-Case Execution Time Analysis

   Författare :Jakob Engblom; Peter Puschner; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Information technology; Informationsteknik; Computer Systems; Datorteknik;

   Sammanfattning : Worst-Case Execution Time (WCET) estimates for programs are necessary when building real-time systems. They are used to ensure timely responses from interrupts, to guarantee the throughput of cyclic tasks, as input to scheduling and schedule analysis algorithms, and in many other circumstances. LÄS MER

3. 2. A Modular Tool Architecture for Worst-Case Execution Time Analysis

   Författare :Andreas Ermedahl; Hans Hansson; Reinhard Wilhelm; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer engineering; Datorteknik; Computer Systems; Datorteknik;

   Sammanfattning : Estimations of the Worst-Case Execution Time (WCET) are required in providing guarantees for timing of programs used in computer controlled products and other real-time computer systems. To derive program WCET estimates, both the properties of the software and the hardware must be considered. LÄS MER

4. 3. Scheduling techniques to improve the worst-case execution time of real-time parallel applications on heterogeneous platforms

   Författare :Petros Voudouris; Chalmers tekniska högskola; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; parallel applications; global; work-conserving; federated; heterogeneous multiprocessors; response time; Hard real-time systems; unrelated model; DAG; makespan;

   Sammanfattning : The key to providing high performance and energy-efficient execution for hard real-time applications is the time predictable and efficient usage of heterogeneous multiprocessors. However, schedulability analysis of parallel applications executed on unrelated heterogeneous multiprocessors is challenging and has not been investigated adequately by earlier works. LÄS MER

5. 4. Towards Aspectual Component-Based Real-Time System Development

   Författare :Aleksandra Tešanović; Linköpings universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; aspect-oriented software development; component-based software development; real-time systems; embedded systems; database systems; aspects; components; worst-case execution time; Computer science; Datavetenskap;

   Sammanfattning : Increasing complexity of real-time systems and demands for enabling their configurability and tailorability are strong motivations for applying new software engineering principles such as aspect-oriented and component-based software development. The integration of these two techniques into real-time systems development would enable: (i) efficient system configuration from the components in the component library based on the system requirements, (ii) easy tailoring of components and/or a system for a specific application by changing the behavior (code) of the component by aspect weaving, and (iii) enhanced flexibility of the real-time and embedded software through the notion of system configurability and component tailorability. 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