By Topic

17th Euromicro Conference on Real-Time Systems (ECRTS'05)

Date 6-8 July 2005

Filter Results

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

    Publication Year: 2005, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (63 KB)
    Freely Available from IEEE
  • Proceedings. 17th Euromicro Conference on Real-Time Systems

    Publication Year: 2005
    Request permission for commercial reuse | PDF file iconPDF (50 KB)
    Freely Available from IEEE
  • Tables of contents

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

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

    Publication Year: 2005, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (28 KB)
    Freely Available from IEEE
  • Program Committee

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

    Publication Year: 2005, Page(s): xi
    Request permission for commercial reuse | PDF file iconPDF (28 KB)
    Freely Available from IEEE
  • Speed modulation in energy-aware real-time systems

    Publication Year: 2005, Page(s):3 - 10
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB) | HTML iconHTML

    This paper presents a general framework for analyzing and designing embedded systems with energy and timing requirements. A set of realistic assumptions is considered in the model in order to apply the results in practical realtime applications. For example, the processor is assumed to have as a set of discrete operating modes, each characterized by speed, power consumption. The transition delay b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Energy-aware memory firewalling for QoS-sensitive applications

    Publication Year: 2005, Page(s):11 - 20
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1160 KB) | HTML iconHTML

    This paper presents operating system abstractions for managing physical memory and paging that can be used to improve both timing predictability and the run-time performance of soft real-time tasks. First, we propose a memory reservation scheme which allows any application to reserve a portion of the total system memory pages for its exclusive use. If the application's memory needs exceed its memo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Energy aware non-preemptive scheduling for hard real-time systems

    Publication Year: 2005, Page(s):21 - 30
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB) | HTML iconHTML

    Slowdown based on dynamic voltage scaling (DVS) provides the ability to perform an energy-delay tradeoff in the system. Nonpreemptive scheduling becomes an integral part of systems where resource characteristics makes preemption undesirable or impossible. We address the problem of energy efficient scheduling of nonpreemptive tasks based on the earliest deadline first (EDF) scheduling policy. We pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A WCET-oriented static branch prediction scheme for real time systems

    Publication Year: 2005, Page(s):33 - 40
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB) | HTML iconHTML

    Branch prediction mechanisms are becoming commonplace within current generation processors. Dynamic branch predictors, albeit able to predict branches quite accurately in average, are becoming increasingly complex. Thus, determining their worst-case behavior, which is highly recommended for real-time applications, is getting increasingly difficult and error-prone, and may even be soon impossible f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling analysis of real-time systems with precise modeling of cache related preemption delay

    Publication Year: 2005, Page(s):41 - 48
    Cited by:  Papers (36)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB) | HTML iconHTML

    Accurate timing analysis is key to efficient embedded system synthesis and integration. Caches are needed to increase the processor performance but they are hard to use because of their complex behaviour especially in preemptive scheduling. Current approaches use simplified assumptions or propose exponentially complex scheduling analysis algorithms to bound the cache related preemption delay at a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cache contents selection for statically-locked instruction caches: an algorithm comparison

    Publication Year: 2005, Page(s):49 - 56
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB) | HTML iconHTML

    Cache memories have been extensively used to bridge the gap between high speed processors and relatively slower main memories. However, they are sources of predictability problems because of their dynamic and adaptive behavior, and thus need special attention to be used in hard real-time systems. A lot of progress has been achieved in the last ten years to statically predict worst-case execution t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automated model-based generation of Ravenscar-compliant source code

    Publication Year: 2005, Page(s):59 - 67
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB) | HTML iconHTML

    Graphical languages of various sorts are increasingly used for the specification and the design of high-integrity real-time systems. Their coverage however does not extend with as much success to automated source code generation. Several hurdles cause the model-to-code translation to often lapse in the preservation of the desired semantics. This paper illustrates the choices we have made to provid... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Component-based approach to run-time kernel specification and verification

    Publication Year: 2005, Page(s):68 - 76
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB) | HTML iconHTML

    The traditional approach to high-integrity embedded system development has been to develop and verify the application with the assumption that either the operating system services have deterministic behaviour with well understood operational semantics or that the operating system itself is certified. Formal verification approaches have focused on modelling the application at the right level of abs... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A space-optimal wait-free real-time synchronization protocol

    Publication Year: 2005, Page(s):79 - 88
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB) | HTML iconHTML

    We present a wait-free protocol for the single-writer/multiple-reader problem in small-memory embedded real-time systems. We analytically establish that our protocol requires lesser (or equal) number of buffers than previously best wait-free protocols for this problem. Further, we prove that our protocol is space-optimal - the first space optimality established for wait-free protocols that conside... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast component interaction for real-time systems

    Publication Year: 2005, Page(s):89 - 97
    Cited by:  Papers (14)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB) | HTML iconHTML

    Open real-time systems provide for co-hosting hard-, soft- and non-real-time applications. Microkernel-based designs in addition allow for these applications to be mutually protected. Thus, trusted servers can coexist next to untrusted applications. These systems place a heavy burden on the performance of the message-passing mechanism, especially when based on microkernel-like inter-process commun... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Non-preemptive interrupt scheduling for safe reuse of legacy drivers in real-time systems

    Publication Year: 2005, Page(s):98 - 105
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB) | HTML iconHTML

    Low-level support of peripheral devices is one of the most demanding activities in a real-time operating system. In fact, the rapid development of new interface boards causes a tremendous effort at the operating system level for writing and testing low-level drivers for supporting the new hardware. The possibility of reusing legacy drivers in real-time systems would offer the great advantage of ke... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Non-blocking deterministic replacement of functionality, timing, and data-flow for hard real-time systems at runtime

    Publication Year: 2005, Page(s):106 - 114
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB) | HTML iconHTML

    Embedded systems are usually an integral component of a larger system and are used to control and/or directly monitor this system by using special hardware devices. The complexity of the whole system, which the embedded control system monitors, increases steadily. Consequently, the initial version of the control software that is used at the time of deployment may be inadequate and may need to be u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fully polynomial-time approximation scheme for feasibility analysis in static-priority systems with arbitrary relative deadlines

    Publication Year: 2005, Page(s):117 - 126
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB) | HTML iconHTML

    Current feasibility tests for the static-priority scheduling on uniprocessors of periodic task systems run in pseudo-polynomial time. We present a fully polynomial-time approximation scheme (FPTAS) for feasibility analysis in static-priority systems with arbitrary relative deadlines. This test is an approximation with respect to the amount of a processor's capacity that must be "sacrificed" for th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast and tight response-times for tasks with offsets

    Publication Year: 2005, Page(s):127 - 136
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB) | HTML iconHTML

    In previous work, we presented a tight approximate response-time analysis for tasks with offsets. While providing a tight bound on response times, the tight analysis exhibits similarly long execution times as does the traditional methods for calculating response-times for tasks with offsets. The existing method for fast analysis of tasks with offsets is not applicable to the tight analysis. In thi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The limited-preemption uniprocessor scheduling of sporadic task systems

    Publication Year: 2005, Page(s):137 - 144
    Cited by:  Papers (30)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (234 KB) | HTML iconHTML

    Although preemptive uniprocessor scheduling algorithms are able to successfully schedule some systems that cannot be scheduled by any non-preemptive scheduling algorithm, the run-time overhead associated with implementing preemptive algorithms is often higher than for non-preemptive algorithms. In choosing between preemptive and non-preemptive scheduling algorithms on uniprocessors, the tradeoff i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spare CASH: reclaiming holes to minimize aperiodic response times in a firm real-time environment

    Publication Year: 2005, Page(s):147 - 156
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB) | HTML iconHTML

    Scheduling periodic tasks that allow some instances to be skipped produces spare capacity in the schedule. Only a fraction of this spare capacity is uniformly distributed and can easily be reclaimed for servicing aperiodic requests. The remaining fraction of the spare capacity is non-uniformly distributed, and no existing technique has been able to reclaim it. We present a method for improving the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling tasks with Markov-chain based constraints

    Publication Year: 2005, Page(s):157 - 166
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB) | HTML iconHTML

    Markov-chain (MC) based constraints have been shown to be an effective QoS measure for a class of real-time systems, particularly those arising from control applications. Scheduling tasks with MC constraints introduces new challenges because these constraints require not only specific task finishing patterns but also certain task completion probability. Multiple tasks with different MC constraints... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Real-time scheduling for data stream management systems

    Publication Year: 2005, Page(s):167 - 176
    Cited by:  Papers (15)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB) | HTML iconHTML

    Quality-aware management of data streams is gaining more and more importance with the amount of data produced by streams growing continuously. The resources required for data stream processing depend on different factors and are limited by the environment of the data stream management system (DSMS). Thus, with a potentially unbounded amount of stream data and limited processing resources, some of ... View full abstract»

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