By Topic

2009 21st Euromicro Conference on Real-Time Systems

Date 1-3 July 2009

Filter Results

Displaying Results 1 - 25 of 36
  • [Front cover]

    Publication Year: 2009, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (110 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2009, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (44 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2009, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (66 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2009, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (104 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2009, Page(s):v - vii
    Request permission for commercial reuse | PDF file iconPDF (200 KB)
    Freely Available from IEEE
  • Message from the Program Chair

    Publication Year: 2009, Page(s): viii
    Request permission for commercial reuse | PDF file iconPDF (68 KB) | HTML iconHTML
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2009, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (75 KB)
    Freely Available from IEEE
  • list-reviewer

    Publication Year: 2009, Page(s): x
    Request permission for commercial reuse | PDF file iconPDF (54 KB)
    Freely Available from IEEE
  • Real-Time Communication Analysis with a Priority Share Policy in On-Chip Networks

    Publication Year: 2009, Page(s):3 - 12
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1982 KB) | HTML iconHTML

    Wormhole switching with fixed priority preemption has been proposed as a possible solution for real-time on-chip communication. However, the hardware implementation cost is expensive and hence constrains its practical deployment. To address this problem, we propose a new solution by utilizing a priority share policy to reduce the resource overhead while still achieving the hard real-time service g... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • End-to-End Delay Analysis of Distributed Systems with Cycles in the Task Graph

    Publication Year: 2009, Page(s):13 - 22
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (321 KB) | HTML iconHTML

    A significant problem with no simple solutions in current real-time literature is analyzing the end-to-end schedulability of tasks in distributed systems with cycles in the task graph. Prior approaches including network calculus and holistic schedulability analysis work best for acyclic task flows. They involve iterative solutions or offer no solutions at all when flows are non-acyclic. This paper... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Refactoring Asynchronous Event Handling in the Real-Time Specification for Java

    Publication Year: 2009, Page(s):25 - 34
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB) | HTML iconHTML

    The primary goal for asynchronous event handling (AEH) in the Real-Time Specification for Java (RTSJ) is to have a lightweight concurrency mechanism. However the RTSJ neither provides a well-defined guideline on how to implement AEH nor requires the documentation of the AEH model used in the implementation. Also the AEH API in the RTSJ are criticized as lacking in configurability as they do not pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combining Worst-Case Timing Models, Loop Unrolling, and Static Loop Analysis for WCET Minimization

    Publication Year: 2009, Page(s):35 - 44
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (247 KB) | HTML iconHTML

    Program loops are notorious for their optimization potential on modern high-performance architectures. Compilers aim at their aggressive transformation to achieve large improvements of the program performance. In particular, the optimization loop unrolling has shown in the past decades to be highly effective achieving significant increases of the average-case performance. In this paper, we present... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deriving the Worst-Case Execution Time Input Values

    Publication Year: 2009, Page(s):45 - 54
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (324 KB) | HTML iconHTML

    A Worst-Case Execution Time (WCET) analysis derives upper bounds for execution times of programs. Such bounds are crucial when designing and verifying real-time systems. A major problem with todaypsilas WCET analysis approaches is that there is no feedback on the particular values of the input variables that cause the programpsilas WCET. However, this is important information for the real-time sys... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Profinet IO IRT Message Scheduling

    Publication Year: 2009, Page(s):57 - 65
    Cited by:  Papers (13)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (337 KB) | HTML iconHTML

    This paper presents an algorithm that allows one to create a static schedule of the Profinet IO IRT communication, which is an industrial Ethernet protocol standardised in IEC 61158. This algorithm offers an alternative to the available commercial tool, providing comparable results regarding the resulting time schedule length. Furthermore, we extend the problem by useful time constraints providing... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical Utilization Control for Real-Time and Resilient Power Grid

    Publication Year: 2009, Page(s):66 - 75
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (400 KB) | HTML iconHTML

    Blackouts in our daily life can be disastrous with enormous economic loss. Blackouts usually occur when appropriate corrective actions are not effectively taken for an initial contingency, resulting in a cascade failure. Therefore, it is critical to complete those tasks that are running power grid computing algorithms in the energy management system (EMS) in a timely manner to avoid blackouts. Thi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improvement to Quick Processor-Demand Analysis for EDF-Scheduled Real-Time Systems

    Publication Year: 2009, Page(s):76 - 86
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB) | HTML iconHTML

    Earliest Deadline First (EDF) is an optimal scheduling algorithm for uniprocessor real-time systems. Quick Processor-demand Analysis (QPA) provides efficient and exact schedulability tests for EDF scheduling with arbitrary relative deadline. In this paper, we propose Improved Quick Processor-demand Analysis (QPA*) which is based on QPA. By extensive experiments, we show that QPA* can significantly... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate Bandwidth Allocation for Compositional Real-Time Systems

    Publication Year: 2009, Page(s):87 - 96
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB) | HTML iconHTML

    Allocation of bandwidth among components is a fundamental problem in compositional real-time systems. State-of-the-art algorithms for bandwidth allocation use either exponential-time or pseudo-polynomial-time techniques for exact allocation, or linear-time, utilization-based techniques which may over-provision bandwidth. In this paper, we develop a fully-polynomial-time approximation scheme (FPTAS... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On-Line Scheduling Algorithm for the Gravitational Task Model

    Publication Year: 2009, Page(s):97 - 106
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (489 KB) | HTML iconHTML

    Some applications for real-time scheduling have target demands in addition to the commonly used start-time and deadline constraints: a task should be executed at a target point in time for maximum utility, but can execute around this point, albeit at lower utility. Examples for such applications include control and media processing. In this paper, we present a scheduling algorithm for the gravitat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Notion of Useful Cache Block to Improve the Bounds of Cache-Related Preemption Delay

    Publication Year: 2009, Page(s):109 - 118
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (302 KB) | HTML iconHTML

    In preemptive real-time systems, scheduling analyses are based on the worst-case response time of tasks. This response time includes worst-case execution time (WCET) and context switch costs. In case of preemption, cache memories may suffer interferences between memory accesses of the preempted and of the preempting task. These interferences lead to some additional reloads that are referred to as ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Precise Worst-Case Execution Time Analysis for Processors with Timing Anomalies

    Publication Year: 2009, Page(s):119 - 128
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (253 KB) | HTML iconHTML

    This paper explores timing anomalies in WCET analysis.Timing anomalies add to the complexity of WCET analysis and make it hard to apply divide-and-conquer strategies to simplify the WCET assessment. So far, timing anomalies have been described as a problem that occurs when the WCET of a control-flow graph is computed from the WCETs of its subgraphs, i.e., from a series decomposition. This paper ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using Randomized Caches in Probabilistic Real-Time Systems

    Publication Year: 2009, Page(s):129 - 138
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (290 KB) | HTML iconHTML

    While hardware caches are generally effective at improving application performance, they greatly complicate performance prediction. Slight changes in memory layout or data access patterns can lead to large and systematic increases in cache misses, degrading performance. In the worst case, these misses can effectively render the cache useless. These pathological cases, or "cache risk patterns'', ar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sustainable Multiprocessor Scheduling of Sporadic Task Systems

    Publication Year: 2009, Page(s):141 - 150
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB) | HTML iconHTML

    A scheduling policy or a schedulability test is defined to be sustainable with respect to a particular workload model if any task system represented in that model that is determined to be schedulable remains so if it behaves "better" than mandated by its specifications. We investigate the sustainability properties of global scheduling algorithms when applied to systems represented using the sporad... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two Protocols for Scheduling Multi-mode Real-Time Systems upon Identical Multiprocessor Platforms

    Publication Year: 2009, Page(s):151 - 160
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (339 KB) | HTML iconHTML

    We consider the global and preemptive scheduling problem of multi-mode real-time systems upon identical multiprocessor platforms. Since it is a multi-mode system, the system can change from one mode to another such that the current task set is replaced with a new task set. Ensuring that deadlines are met requires not only that a schedulability test is performed on tasks in each mode but also that ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Norm Approach for the Partitioned EDF Scheduling of Sporadic Task Systems

    Publication Year: 2009, Page(s):161 - 169
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (254 KB) | HTML iconHTML

    In this paper, we propose a new approach for the partitioned Earliest Deadline First (EDF) scheduling of sporadic task systems. We consider the case of constrained task deadlines where the deadlines of the tasks are less than or equal to their periods. We introduce the concept of the EDF norm, for defining the space of WCET values that result in schedulable systems given fixed periods and relative... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Predictable Runtime Monitoring

    Publication Year: 2009, Page(s):173 - 183
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (401 KB) | HTML iconHTML

    Dynamic program monitoring has been applied in software-intensive systems to detect runtime constraint violations and trigger system recovery actions. Uncontrolled monitoring activities may, however, delay detection of a violation for an unbounded time and, worse, affect the original system's schedulability. In this paper, we introduce the concept of predictable monitoring, which demands a bound o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.