25th IEEE International Real-Time Systems Symposium

5-8 Dec. 2004

Filter Results

Displaying Results 1 - 25 of 55
  • Proceedings. 25th IEEE International Real-Time Systems Symposium

    Publication Year: 2004
    Request permission for reuse | PDF file iconPDF (49 KB)
    Freely Available from IEEE
  • 25th IEEE International Real-Time Systems Symposium - Title Pages

    Publication Year: 2004, Page(s):i - iii
    Request permission for reuse | PDF file iconPDF (25 KB)
    Freely Available from IEEE
  • 25th IEEE International Real-Time Systems Symposium - Copyright Page

    Publication Year: 2004, Page(s): iv
    Request permission for reuse | PDF file iconPDF (36 KB)
    Freely Available from IEEE
  • 25th IEEE International Real-Time Systems Symposium - Table of contents

    Publication Year: 2004, Page(s):v - viii
    Request permission for reuse | PDF file iconPDF (48 KB)
    Freely Available from IEEE
  • Message from the Conference Chairs

    Publication Year: 2004, Page(s):ix - x
    Request permission for reuse | PDF file iconPDF (33 KB) | HTML iconHTML
    Freely Available from IEEE
  • Organizing Committee

    Publication Year: 2004, Page(s): xi
    Request permission for reuse | PDF file iconPDF (27 KB)
    Freely Available from IEEE
  • Program Committees

    Publication Year: 2004, Page(s):xii - xiii
    Request permission for reuse | PDF file iconPDF (34 KB)
    Freely Available from IEEE
  • list-reviewer

    Publication Year: 2004, Page(s): xiv
    Request permission for reuse | PDF file iconPDF (23 KB)
    Freely Available from IEEE
  • Let’s Get the Real into Real-Time Computing

    Publication Year: 2004, Page(s): 3
    Request permission for reuse | PDF file iconPDF (39 KB) | HTML iconHTML
    Freely Available from IEEE
  • The Road Ahead: It Doesn't Get Any Easier

    Publication Year: 2004, Page(s): 4
    Request permission for reuse | PDF file iconPDF (43 KB) | HTML iconHTML
    Freely Available from IEEE
  • Modeling Real-Time Systems

    Publication Year: 2004, Page(s):5 - 6
    Cited by:  Papers (2)
    Request permission for reuse | PDF file iconPDF (44 KB) | HTML iconHTML
    Freely Available from IEEE
  • Fixed or Dynamic Priority? That is the Question

    Publication Year: 2004, Page(s): 9
    Cited by:  Papers (3)
    Request permission for reuse | PDF file iconPDF (29 KB)
    Freely Available from IEEE
  • Integrated resource management and scheduling with multi-resource constraints

    Publication Year: 2004, Page(s):12 - 22
    Cited by:  Papers (42)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (242 KB) | HTML iconHTML

    Dynamic real-time systems such as phased-array radars must manage multiple resources, satisfy energy constraints and make frequent on-line scheduling decisions. These systems are hard to manage because task and system requirements change rapidly (e.g. in radar systems, the targets/tasks in the sky are moving continuously) and must satisfy a multitude of constraints. Their highly dynamic nature and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finite-horizon scheduling of radar dwells with online template construction

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

    Timing constraints for radar tasks are usually specified in terms of the minimum and maximum temporal distance between successive radar dwells. We utilize the idea of feasible intervals for dealing with the temporal distance constraints. In order to increase the freedom that the scheduler can offer a high-level resource manager, we introduce a technique for nesting and interleaving dwells online w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Feasibility analysis of preemptive real-time systems upon heterogeneous multiprocessor platforms

    Publication Year: 2004, Page(s):37 - 46
    Cited by:  Papers (22)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (433 KB) | HTML iconHTML

    Given a collection of recurring tasks or processes that comprise a real-time system, and a collection of available processing units of different kinds upon which to execute them, the heterogeneous multiprocessor feasibility problem is concerned with determining whether the given tasks can be executed on the available processing units in such a manner that all timing constraints are met. A preempti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Negative results for scheduling independent hard real-time tasks with self-suspensions

    Publication Year: 2004, Page(s):47 - 56
    Cited by:  Papers (35)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (158 KB) | HTML iconHTML

    In most real-time systems, tasks use remote operations that are executed upon dedicated processors. External operations introduce self-suspension delays in the behavior of tasks. This paper presents several negative results concerning scheduling independent hard real-time tasks with self-suspensions. Our main objective is to show that well-known scheduling policies such as fixed-priority or earlie... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compositional real-time scheduling framework

    Publication Year: 2004, Page(s):57 - 67
    Cited by:  Papers (118)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (398 KB) | HTML iconHTML

    Our goal is to develop a compositional real-time scheduling framework so that global (system-level) timing properties can be established by composing independently (specified and) analyzed local (component-level) timing properties. The two essential problems in developing such a framework are: (1) to abstract the collective real-time requirements of a component as a single real-time requirement an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pre-scheduling on the domain of integers

    Publication Year: 2004, Page(s):68 - 77
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (316 KB) | HTML iconHTML

    A preschedule is a static schedule without assuming constant and completely predictable rate of resource supply. A generalized prescheduling framework and a sound, complete, and PTIME preschedule generator was proposed in Wang et al. (2004) based on linear programming (LP). Since infinitely small time slices are not implementable for resources with context switch overhead, it is desirable to defin... View full abstract»

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

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

    Some processors incur a pipeline delay whenever an instruction transfers control to a target that is not the next sequential instruction. Compiler writers attempt to reduce these delays by positioning the basic blocks within a function to minimize the number of unconditional jumps and taken conditional branches that occur. Such a code positioning algorithm is traditionally driven by profile data r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling out-of-order processors for software timing analysis

    Publication Year: 2004, Page(s):92 - 103
    Cited by:  Papers (6)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (211 KB) | HTML iconHTML

    Estimating the worst case execution time (WCET) of a program on a given processor is important for the schedulability analysis of real-time systems. WCET analysis techniques typically model the timing effects of microarchitectural features in modern processors (such as the pipeline, caches, branch prediction, etc.) to obtain safe but tight estimates. In this paper, we model out-of-order processor ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design style case study for embedded multi media compute nodes

    Publication Year: 2004, Page(s):104 - 113
    Cited by:  Papers (4)  |  Patents (5)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (253 KB) | HTML iconHTML

    Users expect future handheld devices to provide extended multimedia functionality and have long battery life. This type of application imposes heavy constraints on both (realtime) performance and energy consumption and forces designers to optimise all parts of their platform. In this experiment we focus on the different processor core design options for embedded platforms, including the effect of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enforcing safety of real-time schedules on contemporary processors using a virtual simple architecture (VISA)

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

    Determining safe and tight upper bounds on the worst-case execution time (WCET) of hard real-time tasks running on contemporary microarchitectures is a difficult problem. Current trends in microarchitecture design have created a complexity wall: by enhancing performance through ever more complex architectural features, systems have become increasingly hard to analyze. This paper extends a framewor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Competitive algorithms for fine-grain real-time scheduling

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

    This paper investigates the task scheduling problem for real-time systems that provide rate of progress guarantees on task execution. A parameterized task system model, called (r, g) task system, is introduced that allows rate of progress requirements to be specified in terms of two simple parameters: an execution rate r and a granularity g. The granularity parameter is a metric that allows the sp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrating best-effort scheduling into a real-time system

    Publication Year: 2004, Page(s):139 - 150
    Cited by:  Papers (6)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (6186 KB) | HTML iconHTML

    Demand for real-time capability in general-purpose systems is rising and as systems are retrofitted with scheduling features they become increasingly complex. To counter this trend we present the best-effort bandwidth server (BEBS), an aperiodic server for flexible and efficient support of best-effort applications in a real-time system. Recognizing that the responsiveness of a server depends on it... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A virtual deadline scheduler for window-constrained service guarantees

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

    This paper presents an approach to window-constrained scheduling, that is suitable for multimedia and weakly-hard real-time systems. Our algorithm called virtual deadline scheduling (VDS) attempts to service m out of k job instances by their virtual deadlines, that may be some finite time after the corresponding real-time deadlines. By carefully deriving virtual deadlines, VDS outperforms our earl... View full abstract»

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