By Topic

Real-Time Systems, 1999. Proceedings of the 11th Euromicro Conference on

Date 9-11 June 1999

Filter Results

Displaying Results 1 - 25 of 35
  • Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99

    Publication Year: 1999
    Request permission for commercial reuse | PDF file iconPDF (238 KB)
    Freely Available from IEEE
  • Index of authors

    Publication Year: 1999, Page(s): 297
    Request permission for commercial reuse | PDF file iconPDF (2238 KB)
    Freely Available from IEEE
  • Distributed real-time task monitoring in the safety-critical system Melody

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

    Safety-critical systems typically operate in unpredictable environments. Requirements for safety and reliability are in conflict with those for real-time responsiveness. Due to unpredictable environmental needs there is no static trade-off between measures to accommodate the conflicting objectives. Instead every feature or operating system service has to be adaptive. The distributed operating syst... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • QoS guarantee using probabilistic deadlines

    Publication Year: 1999, Page(s):242 - 249
    Cited by:  Papers (36)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (140 KB)

    This paper presents a probabilistic approach to guarantee the performance of a real-time system. While traditional real-time system analysis tends to guarantee that each task instance will complete its execution before its absolute deadline (hard guarantee), our approach permits to estimate the probability that it will happen. Such a statistical guarantee is performed based on inter-arrival and ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cluster simulation-support for distributed development of hard real-time systems using TDMA-based communication

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

    In the field of safety-critical real-time systems the development of distributed applications for fault tolerance reasons is a common practice. Hereby the whole application is divided into several distinct sub-systems, which are afterwards mapped onto a set of associated processors cabled nodes. Cluster simulation provides a cheap and useful technique to test single nodes of a distributed applicat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rate modulation of soft real-time tasks in autonomous robot control systems

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

    Due to the high number of sensors managed and need to perform complex reasoning activities, real-time control systems of autonomous robots exhibit a high potential for overload, i.e., real-time tasks missing their deadlines. In these systems overload should be regarded as a likely occurrence and hence managed accordingly. In this paper we illustrate a novel scheduling technique for adaptation of s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling real-time multi-task applications in an open system

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

    This paper focuses on the problem of providing isolation and real-time execution in scheduling multi-thread applications on a single processor. The proposed scheduling algorithm can be applied in a wide range of different situations, such as in a multimedia real-time systems, where applications may require a guaranteed level of Quality of Service, or in a network link, where different flows of pac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparison of fixed-priority and static cyclic scheduling for distributed automotive control applications

    Publication Year: 1999, Page(s):142 - 149
    Cited by:  Papers (19)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (72 KB)

    This paper compares different scheduling policies applied to distributed systems intended for automotive real-time control applications. We describe the characteristics of systems using fixed priority (FP) and static cyclic (SC) scheduling of processors and bus communication, with combinations ranging from FP bus-FP processors to SC bus-SC processors. FP bus is represented by the Controller Area N... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finding the minimum available transmission time for the timed token medium access control protocol

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

    Exactly capturing the minimum available time for a network node to transmit its synchronous messages during any given length of time is important for guaranteeing the transmission of synchronous messages before their deadlines in a timed token ring network (such as FDDI) where the timed token medium access control protocol is used. Previous results which only give a lower bound on the minimum tran... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The case for feedback control real-time scheduling

    Publication Year: 1999, Page(s):11 - 20
    Cited by:  Papers (80)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 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 algori... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the correctness of multimedia applications

    Publication Year: 1999, Page(s):226 - 233
    Cited by:  Papers (1)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (244 KB)

    This paper provides a method to verify that the properties we consider critical to build a correct multimedia application are met. These properties are the compatibility of the protocols employed by the computing elements to interact with each other and the timeliness of the application. The method relies on (i) an original model that enables a software architect to specify the basic elements of i... View full abstract»

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

    Publication Year: 1999, Page(s):132 - 140
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (44 KB)

    One of the challenging application domains of dependable real-time computer technology is the field of automotive electronics. In this paper we describe the characteristics of this exciting field, investigate the present state of the art of computer applications onboard vehicles and speculate about upcoming computer applications, such as intelligent cruise control, and vehicle dynamics control. Th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adding local priority-based dispatching mechanisms to P-NET networks: a fixed priority approach

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

    In this paper we address the real-time capabilities of P-NET, which is a multi-master fieldbus standard based on a virtual token passing scheme. We show how P-NET's medium access control (MAC) protocol is able to guarantee a bounded access time to message requests. We then propose a model for implementing fixed priority-based dispatching mechanisms at each master's application level. In this way, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shadowing-based crash recovery schemes for real-time database systems

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

    Predictable performance in the event of failures is of paramount importance in most safety critical real-time database systems. Our research addresses new crash recovery techniques that accommodate pre-run-time timing analysis and utilize design-time information about transactions' data access patterns to improve performance at run time and system restart time. The schemes we will propose are base... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Static-priority scheduling of multiframe tasks

    Publication Year: 1999, Page(s):38 - 45
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (260 KB)

    The multiframe model of hard-real-time tasks is a generalization of the well-known periodic task model of C. Liu and J. Layland (1973). The feasibility analysis of systems of multiframe tasks which are assigned priorities according to the rate-monotonic priority assignment scheme is studied. An efficient sufficient feasibility test for such systems of multiframe tasks is presented and proved corre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved scheduling of control tasks

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

    The paper considers the implementation of digital controllers as real-time tasks in priority-preemptive systems. The performance of a digital feedback control system depends critically on the timing of its sampling and control actions. It is desirable to minimize the computational delay in the controller as well as the sampling jitter and the control jitter. It is shown that by scheduling the two ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Splitting reachability analysis in hybrid automata

    Publication Year: 1999, Page(s):98 - 105
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB)

    Within the framework of time verification of real time systems, we present a new technique for the reachability analysis of hybrid automata. We call this technique the “Splitting Reachability Analysis”. It is applied to a synchronized product of hybrid automata. The basic idea is to compute separately and simultaneously states sets in each component of a synchronized product of hybrid ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time-constrained sorting-a comparison of different algorithms

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

    The designers of real-time systems try to avoid an under-utilization of hardware by assigning only the absolutely necessary time budget to each task. In certain cases it is also acceptable to cut the time quantum assigned to a task below its worst-case needs, provided (a) a high percentage of executions complete within this quantum and (b) the quality of the aborted computations is sufficient for ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hardware-software coverification of concurrent embedded real-time systems

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

    The results of hardware-software codesign of concurrent embedded real-time systems are often not verified or not easily verifiable. This has serious consequences when high-assurance systems are codesigned. The main difficulty lies in the different time-scales of the embedded hardware, of the embedded software, and of the environment. This difference makes hardware-software coverification not only ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Handling sporadic tasks in off-line scheduled distributed real-time systems

    Publication Year: 1999, Page(s):60 - 67
    Cited by:  Papers (5)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB)

    Many industrial applications mandate the use of a time-triggered paradigm and consequently the use of off-line scheduling for reasons such as predictability, certification, cost, or product reuse. The construction of an off-line schedule requires complete knowledge about all temporal aspects of the application. The acquisition of this information may involve unacceptable cost or be impossible. Oft... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Experiments with parametric verification of real-time systems

    Publication Year: 1999, Page(s):123 - 130
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB)

    The paper addresses experiments with parametric verification of real-time systems based on model-checking of models of these systems. We apply a model checking a algorithm that implements the partition refinement approach. The models itself are based on the timed automata model of Alur and Dill (1994). The model specification language XTG enables the specification of constant parameters, which are... View full abstract»

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

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

    A protocol and a communication mechanism intended for time and safety critical applications using a radio channel for information transport are considered jointly. The protocol is based on a scheme of retransmissions done on demand within a given time window. Each retransmission is coded with a varying number of redundant symbols. The set of blocks used for retransmission is controlled by two qual... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault tolerant real-time global scheduling on multiprocessors

    Publication Year: 1999, Page(s):252 - 259
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (136 KB)

    Many real-time multiprocessor scheduling techniques have been proposed to guarantee the timely execution of periodic preemptive real-time tasks. However timeliness is usually only guaranteed in the absence of faults, which may be unacceptable for some critical systems. We therefore address the problem of multiprocessor scheduling for preemptive real-time tasks so that the timeliness of the system ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptation and graceful degradation of control system performance by task reallocation and period adjustment

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

    In this paper, we consider resource adaptation in multiprocessor real-time control systems running periodic control tasks, where the main resource is processor utilization, and the measure of utility is control performance. Processor utilization of a periodic task can be changed by changing the task's period. To estimate the reward rates for running a task at different periods we will use a well-u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive dissemination of data in time-critical asymmetric communication environments

    Publication Year: 1999, Page(s):195 - 203
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (72 KB)

    The proliferation of new data-intensive applications in asymmetric communication environments has led to an increasing interest in the development of push-based techniques, in which the information is broadcast to a large population of clients in order to achieve the most efficient use of the limited server and communication resources. Nevertheless, none of the existing schemes integrates all the ... View full abstract»

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