By Topic

Real-Time Systems Symposium, 1999. Proceedings. The 20th IEEE

Date 1-3 Dec. 1999

Filter Results

Displaying Results 1 - 25 of 42
  • Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054)

    Publication Year: 1999
    Request permission for commercial reuse | PDF file iconPDF (341 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 1999, Page(s):371 - 372
    Request permission for commercial reuse | PDF file iconPDF (14 KB)
    Freely Available from IEEE
  • Testing the temporal behavior of real-time tasks using extended evolutionary algorithms

    Publication Year: 1999, Page(s):270 - 271
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (24 KB)

    For real-time systems, correct system functionality depends on logical as well as on temporal correctness. Static analysis alone is not sufficient to verify the temporal behavior of real-time systems. Since existing test methods are not specialized for the verification of temporal correctness, we have developed a new testing method, namely evolutionary testing. This paper illustrates results of th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On scheduling tasks in reliable real-time control systems

    Publication Year: 1999, Page(s):164 - 165
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (88 KB)

    Feedback control is one of the most common applications of real time systems. However, the design of controller frequencies, task scheduling and reliability engineering are often done separately, resulting in suboptimal results. The article provides an overview of an integrated approach to reliable real time controller design by optimizing the system control performance subject to schedulability a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fixed-priority-driven open environment for real-time applications

    Publication Year: 1999, Page(s):256 - 267
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    This paper extends the useful concept of open systems proposed by W.S. Liu, et al. (1997) in scheduling real-time applications and non-real-time applications, where the schedulability of each real-time application can be validated independently of other applications in the system. We replace the underlying earliest-deadline-first OS scheduler of the open system architecture by W.S. Liu, et al. (19... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A framework for scheduler synthesis

    Publication Year: 1999, Page(s):154 - 163
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB)

    We present a framework integrating specification and scheduler generation for real time systems. In a first step, the system, which can include arbitrarily designed tasks (cyclic or sporadic, with or without precedence constraints, any number of resources and CPUs) is specified as a timed Petri net. In a second step, our tool generates the most general non preemptive online scheduler for the speci... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementing a general real-time scheduling framework in the RED-Linux real-time kernel

    Publication Year: 1999, Page(s):246 - 255
    Cited by:  Papers (35)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (92 KB)

    Many scheduling paradigms have been studied for real-time applications and real-time communication network. Among them, the most commonly used paradigms include priority-driven, time-driven and share-driven paradigms. In this paper, we present a general scheduling framework which is designed to integrate these paradigms in one framework. The framework is implemented in our real-time extension of t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel switching in connection-oriented networks

    Publication Year: 1999, Page(s):200 - 209
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB)

    Packet switching in connection-oriented networks that may have multiple parallel links between pairs of switches is considered. An efficient packet scheduling algorithm that guarantees a deterministic quality of service to connections with real time constraints is proposed; this algorithm is a generalization of some recent multiprocessor scheduling algorithms, and offers real time performance guar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enabling deadline scheduling for Java real-time computing

    Publication Year: 1999, Page(s):152 - 153
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (28 KB)

    We present a scheduling architecture that enables the implementation of deadline based scheduling policies. The architecture is used to give real time capabilities to a custom Java virtual machine. This framework retains a clear separation between generic kernel mechanisms and upper level scheduling classes. A pure earliest deadline first algorithm can be implemented, but enhanced policies such as... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Priority inheritance and ceilings for distributed mutual exclusion

    Publication Year: 1999, Page(s):340 - 349
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB)

    The contributions of this paper are threefold. First, a solution to the problem of prioritized mutual exclusion in a distributed system is proved correct. This protocol is based on fewer requirements than prioritized extensions of other protocols and outperforms other protocols with an average complexity of θ(log n) and a worst-case complexity of O(n) messages for n nodes. Second, the concep... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards systematic testing of distributed real-time systems

    Publication Year: 1999, Page(s):360 - 369
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (148 KB)

    Reproducible and deterministic testing of sequential programs can in most cases be achieved by controlling the sequence of inputs to the program. The behavior of a distributed real-time system, on the other hand not only depends on the inputs but also on the order and timing of the concurrent tasks that execute and communicate with each other and the environment. Hence, sequential test techniques ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Specification and analysis of soft real-time systems: quantity and quality

    Publication Year: 1999, Page(s):104 - 114
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB)

    This paper presents a process algebra for specifying soft real-time constraints in a compositional way. For these soft constraints we take a stochastic point of view and allow arbitrary probability distributions to express delays of activities. The semantics of this process algebra is given in terms of stochastic automata, a variant of timed automata where clocks are initialised randomly and run b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Timing anomalies in dynamically scheduled microprocessors

    Publication Year: 1999, Page(s):12 - 21
    Cited by:  Papers (91)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (88 KB)

    Previous timing analysis methods have assumed that the worst-case instruction execution time necessarily corresponds to the worst-case behavior. We show that this assumption is wrong in dynamically scheduled processors. A cache miss, for example, can in some cases result in a shorter execution time than a cache hit. Many examples of such timing anomalies are provided. We first provide necessary co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • System-level issues for software thread integration: guest triggering and host selection

    Publication Year: 1999, Page(s):234 - 245
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (124 KB)

    Software thread integration provides low-cost concurrency on general-purpose processors by automatically interleaving multiple threads of control into one. This simplifies hardware to software migration and can help embedded system designers meet design constraints. Previous work describes how to efficiently integrate threads. In this paper we demonstrate how to link trigger events with guest thre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal reward-based scheduling of periodic real-time tasks

    Publication Year: 1999, Page(s):79 - 89
    Cited by:  Papers (32)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB)

    Reward-based scheduling refers to the problem in which there is a reward associated with the execution of a task. In our framework, each real-time task comprises a mandatory and an optional part, with which a nondecreasing reward function is associated. Imprecise Computation and Increased-Reward-with-Increased-Service models fall within the scope of this framework. In this paper we address the rew... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient delay computation methods for an ATM network with real-time video traffic

    Publication Year: 1999, Page(s):190 - 199
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB)

    Consider a real time communication application running on top of an ATM network; we require the connection to provide a transmission guarantee for the real time service. Such transmission guarantee can only be possible if there exists an absolute and deterministic worst case delay bound on all the ATM cells within the real time connection. We present our approach in finding this worst case cell de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time based Linux for real-time NOWs and MPI/RT

    Publication Year: 1999, Page(s):220 - 221
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (48 KB)

    The Real-Time Message Passing Interface (MPI/RT) is a communication layer middleware standard that is aimed at providing guaranteed Quality of Service for data transfers on high performance networks. It poses “middleout” requirements both on applications and on the operating system. In this paper, we consider the “middledown” issues by modifying a POSIX compliant operating ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the efficient scheduling of non-periodic tasks in hard real-time systems

    Publication Year: 1999, Page(s):148 - 151
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (84 KB)

    The paper presents linear time, online algorithms which guarantee and jointly schedule firm aperiodic, hard sporadic and periodic tasks in fixed priority real time systems. We develop and capitalize on a methodology which computes the spare capacity Z(a,b) exactly in time Θ(n), for arbitrary schedule intervals (a,b), which, to the best of our knowledge, is the first linear time algorithm rep... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and evaluation of a feedback control EDF scheduling algorithm

    Publication Year: 1999, Page(s):56 - 67
    Cited by:  Papers (87)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (188 KB)

    Despite the significant body of results in real-time scheduling, many real world problems are not easily supported. While algorithms such as Earliest Deadline First, Rate Monotonic, and the Spring scheduling algorithm can support sophisticated task set characteristics (such as deadlines, precedence constraints, shared resources, jitter etc.), they are all “open loop” scheduling algorit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting precedence relations in the schedulability analysis of distributed real-time systems

    Publication Year: 1999, Page(s):328 - 339
    Cited by:  Papers (35)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB)

    In this paper we present improved techniques for the schedulability analysis of tasks with precedence relations in multiprocessor and distributed systems scheduled under a pre-emptive fixed priority scheduler. Recently developed techniques, based on the analysis of tasks with dynamic offsets, take into account the precedence relations between tasks only indirectly, through terms iteratively estima... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and implementation of statistical rate monotonic scheduling in KURT Linux

    Publication Year: 1999, Page(s):272 - 276
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (228 KB)

    We present the design and implementation of statistical rate monotonic scheduling (SRMS) on the KURT Linux operating system. We overview the technical issues we had to address to integrate SRMS into KURT Linux and present the API we have developed for scheduling periodic real-time tasks using SRMS View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A framework for provisioning of temporal QoS in core-based multicast routing

    Publication Year: 1999, Page(s):168 - 178
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (364 KB)

    We develop and evaluate a set of member join/leave and state update/refresh procedures for QoS provisioning in core-based multicast routing with explicit member join and soft state refresh procedures. Specifically, in our prior work (Hung-Ying Tyan et al., 1999), we devised eligibility tests to verify whether or not a new member can join a multicast tree at adequate QoS while not violating the exi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Remote controlled mobile imaging in a high temperature tunnel environment

    Publication Year: 1999, Page(s):212 - 213
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (72 KB)

    A custom remote controlled vehicle was developed and tested for imaging data acquisition in high-temperature environments (up to 300°C.) Through a wireless remote control system, an operator can position the cameras to visually inspect and measure temperature distributions on any surface area of a 50 meter long underground tunnel. Feedback to the operator is provided through three wireless vid... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical scheduling of periodic messages in open system

    Publication Year: 1999, Page(s):350 - 359
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB)

    This paper describes a hierarchical scheme for scheduling periodic messages of distributed real-time applications in a cluster of PCs connected by a Myrinet. The scheme allows the developer of each real-time application to validate the schedulability of the application as if it were running alone on slower dedicated processors and network. A simple acceptance test is provided. According to the tes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High-level modeling and analysis of TCAS

    Publication Year: 1999, Page(s):115 - 125
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (176 KB)

    In this paper we demonstrate a high-level approach to modeling and analyzing complex safety-critical systems through a case study in the area of air traffic management. In particular, we focus our attention on the Traffic Alert and Collision Avoidance System (TCAS); an on-board conflict detection and resolution system which alerts pilots to the presence of nearby aircraft that pose a mid-air colli... View full abstract»

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