By Topic

17th IEEE Real-Time Systems Symposium

4-6 Dec. 1996

Filter Results

Displaying Results 1 - 25 of 33
  • 17th IEEE Real-Time Systems Symposium

    Publication Year: 1996, Page(s):iii - vii
    Request permission for commercial reuse | PDF file iconPDF (360 KB)
    Freely Available from IEEE
  • Reducing the number of clock variables of timed automata

    Publication Year: 1996, Page(s):73 - 81
    Cited by:  Papers (26)
    Request permission for commercial reuse | PDF file iconPDF (642 KB)
    Freely Available from IEEE
  • Proceedings 1996 Asia-Pacific Software Engineering Conference

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

    Publication Year: 1996, Page(s): 321
    Request permission for commercial reuse | PDF file iconPDF (60 KB)
    Freely Available from IEEE
  • An optimal pinwheel scheduler using the single-number reduction technique

    Publication Year: 1996, Page(s):196 - 205
    Cited by:  Papers (15)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    Several pinwheel schedulers have been reported previously for scheduling real-time systems in which the temporal distances between consecutive executions of tasks must be less than their respective distance constraints. The scheduler Sr has been used for task sets with real number distance constraints and execution times. Sr transforms the distance constraints in a system into harmonic values with... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High availability in the real-time publisher/subscriber inter-process communication model

    Publication Year: 1996, Page(s):136 - 141
    Cited by:  Papers (4)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

    The real time publisher/subscriber (RT P/S) communications model has been proposed as a flexible and powerful interprocess communication model for distributed real time systems (R. Rajkumar et al., 1995). It can also be used as the underlying framework for supporting building blocks such as extensible cells and replaceable software units far building evolvable distributed real time systems. Howeve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Real-time queueing theory

    Publication Year: 1996, Page(s):186 - 195
    Cited by:  Papers (59)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (932 KB)

    The paper presents an approach to real time system scheduling. The approach, called real time queueing theory, includes customer timing requirements into queueing models. With real time queueing models, one is able to explicitly characterize the dynamic behavior of the customer lead time profile process where lead time=deadline minus current time. In spite of the infinite dimensionality of these p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tool support for the construction of statically analysable hard real-time Ada systems

    Publication Year: 1996, Page(s):129 - 135
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    The paper maintains that fixed priority process based preemptive scheduling is, arguably, more convenient, flexible and responsive than conventional cyclic scheduling for the construction of new generation software intensive satellite control systems. Predictable usage of preemptive priority based scheduling, however, demands the support of mature static analysis techniques. Worst case response ti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On supporting time-constrained communications in WDMA-based star-coupled optical networks

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

    We devise a preallocation based single hop wavelength division multiple access (WDMA) scheme to support time constrained communication in star coupled optical networks. We consider a star coupled broadcast and select network architecture in which N stations are connected to a star coupler with W different wavelength channels. Each of the W wavelength channels is slotted and shared by the N station... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The MSP.RTL real-time scheduler synthesis tool

    Publication Year: 1996, Page(s):118 - 128
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (936 KB)

    MSP.RTL is a tool for producing real time schedulers for a wide variety of timing constraints. The input to MSP.RTL can be customized for different application domains, as long as their timing semantics can be expressed in RTL (real time logic). The scheduler synthesis algorithm treats the real time scheduling problem as a temporal constraint satisfaction problem with additional resource constrain... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Commit processing in distributed real-time database systems

    Publication Year: 1996, Page(s):220 - 229
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (884 KB)

    We investigate the performance implications of supporting transaction atomicity in a distributed real-time database system. Using a detailed simulation model of a firm-deadline distributed real-time database system, we profile the real-time performance of a representative set of commit protocols. A new commit protocol that is designed for the real-time domain and allows transactions to “opti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling transactions with temporal constraints: exploiting data semantics

    Publication Year: 1996, Page(s):240 - 251
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (916 KB)

    In this paper, issues involved in the design of a real-time database which maintains data temporal consistency are discussed. The concept of data-deadline is introduced and time cognizant non-waiting transaction scheduling policies are proposed. Further, two time cognizant forced wait policies which improve performance significantly by forcing a transaction to delay further execution until a new v... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of cache-related preemption delay in fixed-priority preemptive scheduling

    Publication Year: 1996, Page(s):264 - 274
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (984 KB)

    We propose a technique for analyzing cache-related preemption delays of tasks that cause unpredictable variation in task execution time in the context of fixed-priority preemptive scheduling. The proposed technique consists of two steps. The first step performs a per-task analysis to estimate cache-related preemption cost for each execution point in a given task from the number of useful cache blo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A multiframe model for real-time tasks

    Publication Year: 1996, Page(s):22 - 29
    Cited by:  Papers (46)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    The well-known periodic task model of Liu and Layland (1973) assumes a worst-case execution time bound for every task and may be too pessimistic if the worst-case execution time of a task is much longer than the average. We give a multiframe real-time task model which allows the execution time of a task to vary from one instance to another by specifying the execution time of a task in terms of a s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Message transmission with timing constraints in ring networks

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

    We consider the message transmission problem in unidirectional slotted ring networks. We consider two operation modes: 1) the evacuation mode, in which all messages arrive before system initialization and no new message arrives during system operation; and 2) the continuation mode, in which new messages may arrive after system initialization. We study the performance of several message scheduling ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounding completion times of jobs with arbitrary release times and variable execution times

    Publication Year: 1996, Page(s):2 - 12
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1016 KB)

    In many real-time systems, the workload can be characterized as a set of jobs with linear precedence constraints among them. Jobs often have variable execution times and arbitrary release times. We describe three algorithms that can be used to compute upper bounds on completion times of such jobs scheduled on a priority-driven basis. The algorithms have different performance and complexity. Simula... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing a FIFO, scalable spin lock using consistent memory

    Publication Year: 1996, Page(s):106 - 114
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    The paper presents a FIFO queue based, scalable spin lock (FSSL) that: (1) uses only one atomic swap operation; (2) is scalable as it requires a constant amount of communication; (3) runs without a coherent cache support; and (4) provides a timing guarantee suitable for real time applications. The algorithm is optimal in the number of atomic operations required to solve the scalable mutual exclusi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrated scheduling of multimedia and hard real-time tasks

    Publication Year: 1996, Page(s):206 - 217
    Cited by:  Papers (23)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1120 KB)

    An integrated platform which is capable of meeting the requirements of both traditional real-time control processing and multimedia processing has enormous potential for accommodating various kinds of new applications. However, except for the simplest of situations, few, if any, research or commercial systems successfully provide architectural and OS mechanisms which can efficiently support both h... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structuring communication software for quality-of-service guarantees

    Publication Year: 1996, Page(s):144 - 154
    Cited by:  Papers (15)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1252 KB)

    We propose architectural mechanisms for structuring host communication software to provide QoS guarantees. In particular, we present and evaluate a QoS sensitive communication subsystems architecture for end hosts that provides real time communication support for generic network hardware. This architecture provides services for managing communication resources for guaranteed QoS (real time) connec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Value-cognizant admission control for RTDB systems

    Publication Year: 1996, Page(s):230 - 239
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1044 KB)

    Admission control and overload management techniques are central to the design and implementation of real-time database systems. We motivate the need for these mechanisms and present protocols for adding such capabilities to real-time databases. In particular, we present a novel admission control paradigm, we describe a number of admission control strategies and contrast (through simulations) thei... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cache modeling for real-time software: beyond direct mapped instruction caches

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

    We present a method for determining a tight bound on the worst case execution time of a program when running on a given hardware system with cache memory. Caches are used to improve the average memory performance, however, their presence complicates the worst case timing analysis. Any pessimistic predictions on cache hits/misses will result in loose estimation. In our previous research in this are... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A method for bounding the effect of DMA I/O interference on program execution time

    Publication Year: 1996, Page(s):275 - 285
    Cited by:  Papers (5)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (984 KB)

    A DMA controller that operates in the cycle-stealing mode transfers data by “stealing” bus cycles from an executing program. This cycle stealing operation retards the progress of the executing program and extends its execution time. We first present a method that bounds the worst-case execution time of a program executing concurrently with a cycle-stealing DMA I/O operation in the simp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Middleware for distributed industrial real-time systems on ATM networks

    Publication Year: 1996, Page(s):32 - 38
    Cited by:  Papers (12)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    We address the problem of middleware design for constructing ATM LAN based distributed industrial plant monitoring and control systems. In particular, we present a real-time client-server programming model based on a uniform ATM network. This model is being realized in our middleware called MidART. The middleware provides a set of industrial application specific but network transparent programming... View full abstract»

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

    Publication Year: 1996, Page(s):13 - 21
    Cited by:  Papers (183)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (748 KB)

    Most real-time computer-controlled systems are built in two separate steps, each in isolation: controller design and its digital implementation. Computational tasks that realize the control algorithms are usually scheduled by treating their execution times and periods as unchangeable parameters. Task scheduling therefore depends only on the limited computing resources available. On the other hand,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Predictability of real-time systems: a process-algebraic approach

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

    This paper presents a testing-based semantic preorder that relates real-time systems given in the process description language TPL on the basis of the predictability of their timing behavior. This predictability is measured in terms of the amount of variability present in processes' “activity-completion times”. The semantic preorder is shown to coincide with an already existing, well-i... View full abstract»

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