By Topic

Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279)

4-4 Dec. 1998

Filter Results

Displaying Results 1 - 25 of 50
  • Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279)

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

    Publication Year: 1998, Page(s):492 - 493
    Request permission for commercial reuse | PDF file iconPDF (182 KB)
    Freely Available from IEEE
  • A worst case timing analysis technique for multiple-issue machines

    Publication Year: 1998, Page(s):334 - 345
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (228 KB)

    We propose a worst case timing analysis technique for in-order multiple-issue machines. In the proposed technique, timing information for each program construct is represented by a directed acyclic graph (DAG) that shows dependences among instructions in the program construct. From this information, we derive for each pair of instructions the distance bounds between their issue times. Using these ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic testing of reactive systems

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

    The paper addresses the problem of automatizing the production of test sequences for reactive systems. We particularly focus on two points: (1) generating relevant inputs, with respect to some knowledge about the environment in which the system is intended to run; (2) checking the correctness of the test results, according to the expected behavior of the system. We propose to use synchronous obser... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Practical solutions for QoS-based resource allocation problems

    Publication Year: 1998, Page(s):296 - 306
    Cited by:  Papers (77)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB)

    The QoS based Resource Allocation Model (Q-RAM) proposed by R. Rajkumar et al. (1998) presented an analytical approach for satisfying multiple quality of service dimensions in a resource constrained environment. Using this model, available system resources can be apportioned across multiple applications such that the net utility that accrues to the end users of those applications is maximized. We ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Task period selection and schedulability in real-time systems

    Publication Year: 1998, Page(s):188 - 198
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (204 KB)

    In many real time applications, especially those involving computer controlled systems, the application tasks often have a maximal acceptable latency, and small latency is preferred to large. The interaction between choosing task periods to meet the individual latency requirements and scheduling the resulting task set was investigated by D. Seto et al. (1996) using dynamic priority scheduling meth... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved response-time analysis calculations

    Publication Year: 1998, Page(s):399 - 408
    Cited by:  Papers (32)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB)

    Schedulability analysis of fixed priority preemptive scheduled systems can be performed by calculating the worst-case response-time of the involved processes. The system is deemed schedulable if the calculated response-time for each process is less than its corresponding deadline. It is desirable that the Response-Time Analysis (RTA) can be efficiently performed. This is particularly important in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Elastic task model for adaptive rate control

    Publication Year: 1998, Page(s):286 - 295
    Cited by:  Papers (103)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (156 KB)

    An increasing number of real time applications, related to multimedia and adaptive control systems, require greater flexibility than classical real time theory usually permits. We present a novel periodic task model, in which tasks' periods are treated as springs, with given elastic coefficients. Under this framework, periodic tasks can intentionally change their execution rate to provide differen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-tolerant clock synchronization in CAN

    Publication Year: 1998, Page(s):420 - 429
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (176 KB)

    This paper presents a new fault-tolerant clock synchronization algorithm designed for the Controller Area Network (CAN). The algorithm provides all correct processes of the system with a global timebase, despite the occurrence of faults in the network or in a minority of processes. Such global time-frame is a requirement of many distributed real-time control systems. Designing protocols for CAN is... View full abstract»

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

    Publication Year: 1998, Page(s):440 - 448
    Cited by:  Papers (14)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (88 KB)

    The rate of innovations in technologies has far exceeded the rate of adopting them in at least the past 20 years. To fully realize the potential of innovations, a paradigm shift is needed, from a focus on enabling technologies for completely new installations to one which is designed to mitigate the risk and cost of bringing new technologies into functioning systems. In this paper, we show that re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detailed design of avionics control software

    Publication Year: 1998, Page(s):82 - 91
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (84 KB)

    Avionics control systems are typical real time systems-automatic control algorithms are realized as periodic computations where strict requirements on the timing can be derived by a control analysis. The requirements are effectively end to end timing requirements on the computation-from sensory input to actuator output-and have to be transformed into a detailed control software design. This analys... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synthesis techniques for low-power hard real-time systems on variable voltage processors

    Publication Year: 1998, Page(s):178 - 187
    Cited by:  Papers (66)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB)

    The energy efficiency of systems-on-a-chip can be much improved if one were to vary the supply voltage dynamically at run time. We describe the synthesis of systems-on-a-chip based on core processors, while treating voltage (and correspondingly the clock frequency) as a variable to be scheduled along with the computation tasks during the static scheduling step. In addition to describing the comple... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Real-time scheduling in a generic fault-tolerant architecture

    Publication Year: 1998, Page(s):390 - 398
    Cited by:  Papers (5)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (88 KB)

    Previous ultra-dependable real-time computing architectures have been specialised to meet the requirements of a particular application domain. Over the last two years, a consortium of European companies and academic institutions has been investigating the design and development of a Generic Upgradable Architecture for Real-time Dependable Systems (GUARDS). The architecture aims to be tolerant of p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Schedulability analysis of acyclic processes

    Publication Year: 1998, Page(s):274 - 284
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB)

    The paper describes the analysis of worst case execution times for a class of acyclic processes that can express precedence constraints and internal computational delays. The motivation for our work comes from hardware designs where a scheduler allocates exclusive access to a memory bus. Blocks that execute concurrently generate read and write requests. The timing of these requests may depend on f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maintaining temporal coherency of virtual data warehouses

    Publication Year: 1998, Page(s):60 - 70
    Cited by:  Papers (16)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (196 KB)

    In electronic commerce applications such as stock trading, there is a need to consult sources available on the web for informed decision making. Because information such as stock prices keep changing, the web sources must be queried continually to maintain temporal coherency of the collected data, thereby avoiding decisions based on stale information. However because network infrastructure has fai... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Animated Structures: Real-Time, Objects, and the UML

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

    First Page of the Article
    View full abstract»

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

    Publication Year: 1998, Page(s):368 - 378
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB)

    We propose a toolset for designing real-time systems. The toolset is based on a design methodology for real-time systems. The purpose of a design methodology is to provide a set of procedures and guidelines that, with human intervention and interaction, allow designers to systematically obtain implementations of systems that conform precisely to their design specifications. Our methodology is desi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Membership questions for timed and hybrid automata

    Publication Year: 1998, Page(s):254 - 263
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (204 KB)

    Timed and hybrid automata are extensions of finite state machines for formal modeling of embedded systems with both discrete and continuous components. Reachability problems for these automata are well studied and have been implemented in verification tools. For the purpose of effective error reporting and testing, we consider the membership problems for such automata. We consider different types ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deadline-modification-SCAN with maximum-scannable-groups for multimedia real-time disk scheduling

    Publication Year: 1998, Page(s):40 - 49
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (140 KB)

    Real-time disk scheduling is important to multimedia systems support for digital audio and video. In these years, various approaches are presented to use the seek-optimizing scheme to improve the disk throughput of a real-time guaranteed schedule. However, as these conventional approaches apply SCAN only to the requests with the same deadline or within the same constant-sized group, their improvem... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combining abstract interpretation and ILP for microarchitecture modelling and program path analysis

    Publication Year: 1998, Page(s):144 - 153
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB)

    Abstract interpretation (AI) and integer linear programming (ILP) are two techniques which were used independently from each other for worst case execution time (WCET) approximation. With AI one can compute interesting properties of programs. It can be implemented efficiently and yields provably correct results. Previous work has shown that it is suitable for cache behaviour prediction of memory r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analyzing non-deterministic real-time systems with (max,+) algebra

    Publication Year: 1998, Page(s):210 - 219
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (172 KB)

    We describe a hierarchical technique that allows a class of non deterministic timed Petri nets to be analyzed using the (max,+) algebra (F. Baccelli et al., 1992; G. Brat and V.K. Garg, 1998) of periodic signals. We show that the timing and controllability analysis of such systems is possible via the use of sup- and inf-convolution operations within the (max,+) framework. We apply this technique t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A dynamic quality of service middleware agent for mediating application resource usage

    Publication Year: 1998, Page(s):307 - 317
    Cited by:  Papers (47)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (88 KB)

    High bandwidth applications with time-dependent resource requirements demand certain resource level assurances in order to operate correctly. Quality of service resource management techniques are being successfully developed that allow network systems to provide such assurances. These solutions generally assume that the operating system at either end of the network is capable of handling the throu... View full abstract»

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

    Publication Year: 1998, Page(s):409 - 418
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (236 KB)

    We propose a unifying method for analysis of scheduling problems in real-time systems. The method is based on ACSR-VP, a real-time process algebra with value-passing capabilities. We use ACSR-VP to describe an instance of a scheduling problem as a process that has parameters of the problem as free variables. The specification is analyzed by means of a symbolic algorithm. The outcome of the analysi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using light-weight groups to handle timing failures in quasi-synchronous systems

    Publication Year: 1998, Page(s):430 - 439
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (244 KB)

    In a quasi-synchronous environment worst-case times associated with a given activity are usually much higher than the average time needed for that activity. Using always those worst-case times can make a system useless. However not using them may lend to timing failures. On the other hand, fully synchronous behavior is usually restricted to small parts of the global system. In a previously defined... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Statistical delay guarantee of virtual clock

    Publication Year: 1998, Page(s):450 - 459
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB)

    In this paper we derive a statistical delay guarantee of the generalized virtual clock scheduling algorithm. We define the concept of an equivalent fluid and packet source and prove a theorem that relates the departure time of a packet in a fluid FCFS multiplexor to its departure time in a packet multiplexor that uses generalized Virtual Clock algorithm for scheduling packets. This theorem enables... View full abstract»

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