By Topic

2011 23rd Euromicro Conference on Real-Time Systems

Date 5-8 July 2011

Filter Results

Displaying Results 1 - 25 of 36
  • Proceedings of the 23rd Euromicro Conference on Real-Time Systems, ECRTS 2011 [Front cover]

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

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

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

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

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

    Publication Year: 2011, Page(s):viii - ix
    Request permission for commercial reuse | PDF file iconPDF (85 KB)
    Freely Available from IEEE
  • Keynote speakers

    Publication Year: 2011, Page(s):x - xi
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (93 KB)

    These keynote speeches discuss the following: The Time-Triggered Architecture (TTA); Thermal-Aware System-Level Design of 2D/3D MPSoC Architectures. View full abstract»

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

    Publication Year: 2011, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (56 KB)
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2011, Page(s): xiii
    Request permission for commercial reuse | PDF file iconPDF (56 KB)
    Freely Available from IEEE
  • Bus-Aware Multicore WCET Analysis through TDMA Offset Bounds

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

    In the domain of real-time systems, the analysis of the timing behavior of programs is crucial for guaranteeing the schedulability and thus the safeness of a system. Static analyses of the WCET (Worst-Case Execution Time) have proven to be a key element for timing analysis, as they provide safe upper bounds on a program's execution time. For single-core systems, industrial-strength WCET analyzers ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • WCET-aware Register Allocation Based on Integer-Linear Programming

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

    Current compilers lack precise timing models guiding their built-in optimizations. Hence, compilers apply ad-hoc heuristics during optimization to improve code quality. One of the most important optimizations is register allocation. Many compilers heuristically decide when and where to spill a register to memory, without having a clear understanding of the impact of such spill code on a program's ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CAMA: A Predictable Cache-Aware Memory Allocator

    Publication Year: 2011, Page(s):23 - 32
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (426 KB) | HTML iconHTML

    General-purpose dynamic memory allocation algorithms strive for small memory fragmentation and good average-case response times. Hard real-time settings, in contrast, place different demands on dynamic memory allocators: worst-case response times are more important than average-case response times. Furthermore, predictable cache behavior is a prerequisite for timing analysis to derive tight bounds... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Priority Assignment for Real-Time Flows in WirelessHART Networks

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

    WirelessHART is a new wireless sensor-actuator network standard specifically developed for process industries. A key challenge faced by WirelessHART networks is to meet the stringent real-time communication requirements imposed by process monitoring and control applications. Fixed-priority scheduling, a popular scheduling policy for real-time networks, has recently been shown to be an effective re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Controller Area Network (CAN) Schedulability Analysis with FIFO Queues

    Publication Year: 2011, Page(s):45 - 56
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (647 KB) | HTML iconHTML

    Controller Area Network (CAN) is widely used in automotive applications. Existing schedulability analysis for CAN is based on the assumption that the highest priority message ready for transmission at each node on the network will be entered into arbitration on the bus. However, in practice, some CAN device drivers implement FIFO rather than priority-based queues invalidating this assumption. In t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MBStar: A Real-time Communication Protocol for Wireless Body Area Networks

    Publication Year: 2011, Page(s):57 - 66
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (345 KB) | HTML iconHTML

    In this paper, we report on the design and implementation of MBStar, a higher-frequency, real-time, reliable, secure protocol for wireless body area networks (WBAN). As in most proposals for body sensor networks, MBStar adopts the star topology for communication, and is designed to support a message rate as high as 400 Hz, which to the best of our knowledge, is the highest among low-power wireless... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interference-Aware Real-Time Flow Scheduling for Wireless Sensor Networks

    Publication Year: 2011, Page(s):67 - 77
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (773 KB) | HTML iconHTML

    With the emergence of wireless sensor networks, an enabling communication technology for distributed real-time systems, we face the critical challenge of meeting the end-to-end deadlines of real-time flows. This paper presents Real-time Flow Scheduling (RFS), a novel conflict-free real-time transmission scheduling approach for periodic real-time flows in wireless sensor networks. In contrast to ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • End-to-End Delay Minimization in Thermally Constrained Distributed Systems

    Publication Year: 2011, Page(s):81 - 91
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (562 KB) | HTML iconHTML

    With ever-increasing power densities, managing on-chip temperatures by optimizing mapping and scheduling of tasks is becoming increasingly necessary. We study the minimization of end-to-end delay for thermally constrained scheduling of an application that is specified as a task graph and is executing on parallel processors without speed scaling. We show that task graph scheduling on thermally cons... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enhanced Race-To-Halt: A Leakage-Aware Energy Management Approach for Dynamic Priority Systems

    Publication Year: 2011, Page(s):92 - 101
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB) | HTML iconHTML

    With progressing CMOS technology miniaturization, the leakage power consumption starts to dominate the dynamic power consumption. The recent technology trends have equipped the modern embedded processors with the several sleep states and reduced their overhead (energy/time) of the sleep transition. The dynamic voltage frequency scaling (DVFS) potential to save energy is diminishing due to efficien... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cache-Aware Utilization Control for Energy Efficiency in Multi-Core Real-Time Systems

    Publication Year: 2011, Page(s):102 - 111
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (553 KB) | HTML iconHTML

    Multi-core processors are anticipated to become a major development platform for real-time systems. However, existing power management algorithms are not designed to sufficiently utilize the features available in many multi-core processors, such as shared L2 caches and per-core DVFS, to effectively minimize processor energy consumption while providing real-time guarantees. In this paper, we propos... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Partitioned Real-time Scheduling on Heterogeneous Shared-Memory Multiprocessors

    Publication Year: 2011, Page(s):115 - 124
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (285 KB) | HTML iconHTML

    We consider several real-time scheduling problems on heterogeneous multiprocessor platforms, in which the different processors share a common memory pool. These include (i)~scheduling a collection of implicit-deadline sporadic tasks with the objective of meeting all deadlines, and (ii)~scheduling a collection of independent jobs with the objective of minimizing the make span of the schedule. Both ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Is Semi-Partitioned Scheduling Practical?

    Publication Year: 2011, Page(s):125 - 135
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (789 KB) | HTML iconHTML

    Semi-partitioned schedulers are -- in theory -- a particularly promising category of multiprocessor real-time scheduling algorithms. Unfortunately, issues pertaining to their implementation have not been investigated in detail, so their practical viability remains unclear. In this paper, the practical merit of three EDF-based semi-partitioned algorithms is assessed via an experimental comparison b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved Schedulability Tests for Global Fixed-Priority Scheduling

    Publication Year: 2011, Page(s):136 - 147
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (396 KB) | HTML iconHTML

    In this paper, global fixed-priority multiprocessor scheduling of a set of sporadic real-time tasks is addressed. First, we propose a priority-assignment policy, called ISM-US, for implicit-deadline task systems. Policy ISM-US assigns slack monotonic priorities to a subset of the given task set and other tasks are assigned the highest fixed priority. We prove that the schedulability utilization bo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stability Conditions of On-line Resource Managers for Systems with Execution Time Variations

    Publication Year: 2011, Page(s):151 - 161
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (367 KB) | HTML iconHTML

    Today's embedded systems are exposed to variations in load demand due to complex software applications, hardware platforms, and impact of the run-time environments. When these variations are large, and efficiency is required, on-line resource managers may be deployed on the system to help it control its resource usage. An often neglected problem is whether these resource managers are stable, meani... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Tractability of Digraph-Based Task Models

    Publication Year: 2011, Page(s):162 - 171
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB) | HTML iconHTML

    In formal analysis of real-time systems, a major concern is the analysis efficiency. As the expressiveness of models grows, so grows the complexity of their analysis. A recently proposed model, the digraph real-time task model (DRT), offers high expressiveness well beyond traditional periodic task models. Still, the associated feasibility problem on preemptive uniprocessors remains tractable. It i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modelling, Verification and Synthesis of Two-Tier Hierarchical Fixed-Priority Preemptive Scheduling

    Publication Year: 2011, Page(s):172 - 181
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB) | HTML iconHTML

    Hierarchical scheduling has major benefits when it comes to integrating hard real-time applications. One of those benefits is that it gives a clear runtime separation of applications in the time domain. This in turn gives a protection against timing error propagation in between applications. However, these benefits rely on the assumption that the scheduler itself schedules applications correctly a... View full abstract»

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