By Topic

Proceedings Seventh International Conference on Real-Time Computing Systems and Applications

12-14 Dec. 2000

Filter Results

Displaying Results 1 - 25 of 72
  • Proceedings Seventh International Conference on Real-Time Computing Systems and Applications

    Publication Year: 2000
    Request permission for commercial reuse | PDF file iconPDF (340 KB)
    Freely Available from IEEE
  • Testing embedded real-time systems

    Publication Year: 2000, Page(s):417 - 424
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (715 KB)

    An embedded real-time system consists of a number of components (processes) that run concurrently and communicate with each other under predefined timing constraints. The correctness of such systems is important, since they are used in an increasingly number of safety-critical systems. To improve the quality of these systems, two techniques can be used, namely verification of the specification and... View full abstract»

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

    Publication Year: 2000, Page(s):527 - 528
    Request permission for commercial reuse | PDF file iconPDF (113 KB)
    Freely Available from IEEE
  • Dragon: soft real-time event delivering architecture for networked sensors and appliances

    Publication Year: 2000, Page(s):425 - 432
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB)

    Presents a new framework for constructing flexible event-driven systems for distributed networked devices and appliances, referred to as Dragon. Dragon enables constructing and modifying an event-driven system easily by visualizing distributed services which are handled in an integrated manner. The updating of the system is conducted immediately following a modification by Dragon. Dragon is built ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probabilistic analysis of causal message ordering

    Publication Year: 2000, Page(s):409 - 413
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (380 KB)

    Causal message ordering (CMO) demands that messages directed to the same destinations must be delivered in an order consistent with their potential causality. In this paper, we present a modular decomposition of CMO, and evaluate the probability of breaking CMO by assuming two probabilistic models on message delays: exponential distribution and uniform distribution. These models represent the cont... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conformance testing of priority inheritance protocols

    Publication Year: 2000, Page(s):404 - 408
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB)

    The priority inversion problem was detected two decades ago (B.W. Lampson and D.D. Redell, 1980). The decisive ideas to cope with this problem were published one decade ago (1990). In the meantime, the vendors of operating systems and run-time systems have occupied this topic in providing certain protocols in order to avoid priority inversion. However, on closer inspection, there are considerable ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An example of performance evaluation by using the stochastic process algebra: ROSA

    Publication Year: 2000, Page(s):271 - 278
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    We present an algebraic language for the description of probabilistic and non-deterministic processes, which allows us to evaluate performance indexes as well as to check some temporal requirements: ROSA (Reasoning On Stochastic Algebras). As an application, we analyse the Alternating Bit Protocol obtaining the average time to send a message, considering that channels may fail with a known probabi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Frame packing in real-time communication

    Publication Year: 2000, Page(s):399 - 403
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (412 KB)

    A common computational model in distributed embedded systems is that the nodes exchange signals via a network. Most often, a signal represents the state of some physical device and has a signal size ranging from a single bit up to a few bytes. Furthermore, each signal typically has a deadline requirement. The communication networks used are often based on a broadcast bus where fixed or variable si... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Verifying temporal constraints on data in multi-rate transactions using timed automata

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

    Transactions involving multiple tasks, possibly with different period times, are common constructs used in the design of real-time systems. Data flowing through a transaction is usually subject to temporal constraints, such as maximum time from input to output or a maximum time difference between inputs. Such constraints are of great importance to guarantee the correct functioning of the designed ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic memory management for real-time embedded Java chips

    Publication Year: 2000, Page(s):49 - 56
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    Java chips have been widely accepted in real-time embedded systems. Those embedded applications usually impose resource and real-time constraints on the design of the CPU. In this paper, we seek a hardware-assisted scheme to support runtime memory management and thus to provide a real-time capability for embedded Java devices. We propose a dynamic garbage collection mechanism to guarantee a predic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Debugging protocol for remote cross development environment

    Publication Year: 2000, Page(s):394 - 398
    Cited by:  Papers (2)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB)

    To develop the applications for Internet appliances, embedded software development tools need various host tools such as cross compilers and binary utilities as well as a remote debugger, an interactive shell, and real time resource monitors. The heavy host-target communication overhead and inconsistency caused by various host tools make target monitor programs more complex. The authors propose a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Including user-defined timing exception support in FRTL

    Publication Year: 2000, Page(s):255 - 262
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    In previous papers, we have presented both a new framework for building flexible hard real-time systems (FRTS) and a corresponding run-time support system, called Flexible Real-Time Linux (FRTL). This paper presents how timing exception support can be integrated in both the framework and the run-time system. In particular, the paper proposes detecting and handling two types of timing exceptions: t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Low-level analysis of a portable Java byte code WCET analysis framework

    Publication Year: 2000, Page(s):39 - 46
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB)

    To support portability, worst-case execution time (WCET) analysis of Java byte code is performed at two levels - machine-independent program flow analysis at a higher level and machine-dependent timing analysis of individual program constructs at a lower level. This paper contributes a WCET analysis that computes worst-case execution frequencies of Java byte codes within the software being analyse... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A concurrency control protocol for read-only transactions in real-time secure database systems

    Publication Year: 2000, Page(s):458 - 462
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (692 KB)

    A read-only transaction (ROT) or a query is a transaction that only reads data items, without modifying them. When we use a protocol that takes care of ROTs distinctively from update transactions, the number of conflicts between ROTs and update transactions can be reduced. As a result, a database system can schedule many more transactions within a given deadline, and it improves the degree of conc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Task attribute assignment of fixed priority scheduled tasks to reenact off-line schedules

    Publication Year: 2000, Page(s):150 - 154
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (396 KB)

    A number of industrial applications advocate the use of time triggered approaches for reasons of predictability, distribution, and particular constraints such as jitter or end-to-end deadlines. The rigid offline scheduling schemes used for time triggered systems however, do not provide for flexibility. Fixed priority scheduling can provide more flexibility, but is limited with respect to predictab... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient resource management for hard real-time communication over differentiated services architectures

    Publication Year: 2000, Page(s):119 - 126
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    We propose an efficient strategy for resource management for scalable QoS guaranteed real-time communication services. This strategy is based on sink trees, and is particularly well suited for differentiated-services based architectures. We first show that finding a set of sink-trees in a given network is NP-complete. Then we propose a heuristic algorithm that always efficiently produces a set of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE1394 OHCI device driver architecture for guarantee real-time requirement

    Publication Year: 2000, Page(s):389 - 393
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (540 KB)

    The paper proposes the architecture of an IEEE1394 device driver that supports the priority based queueing of packets and reduces the interrupt latency time in ISR (Interrupt Service Routine), thereby guaranteeing device driver level support for real time characteristics and improving the predictability of high priority applications. This architecture can accommodate the real time requirements of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards a mechanical verification of real-time reactive systems modeled in UML

    Publication Year: 2000, Page(s):245 - 254
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    This paper provides a verification methodology for UML-based real-time reactive system models. The verification process can be mechanized in PVS (Prototype Verification System). The motivation for this work comes from the wide acceptance of UML in industry, as a unified notation applicable to the development of object-based systems in a broad spectrum of domains, and the use of PVS for design anal... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A framework to model dependable real-time systems based on real-time object model

    Publication Year: 2000, Page(s):31 - 38
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    Proposes a framework to model fault-tolerant real-time systems consisting of RobustRTOs (Robust Real-Time Objects) and RMOs (Region Monitor real-time Objects). A RobustRTO is an object which is capable of tolerating faults in itself. Many existing fault-tolerant mechanisms, such as RB (recovery blocks) and NVP (N-version programming), are modeled as RobustRTOs. An RMO is an object which is capable... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two-step backup mechanism for real-time main memory database recovery

    Publication Year: 2000, Page(s):453 - 457
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (468 KB)

    Proposes a recovery mechanism for real-time main-memory database systems (RT-MMDBSs) which aims at reducing the system recovery time, as well as ensuring a fast response time and predictability. Conventional main-memory database (MMDB) recovery schemes usually use logging with checkpointing, which involves many disk I/Os during transaction processing. Consequently, it not only ensures the predicta... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pfair scheduling: beyond periodic task systems

    Publication Year: 2000, Page(s):297 - 306
    Cited by:  Papers (35)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (788 KB)

    We consider variants of Pfair and ER-fair scheduling in which subtasks may be released late, i.e., there may be separation between consecutive windows of the same task. We call such tasks intra-sporadic tasks. There are two main contributions. First, we show the existence of a Pfair (and hence ER-fair) schedule for any intra-sporadic task system whose utilization is at most the number of available... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On accepting aperiodic transactions in distributed systems

    Publication Year: 2000, Page(s):145 - 149
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (388 KB)

    In this paper we present algorithms for jointly scheduling periodic tasks and hard aperiodic tasks with precedence relations in a distributed systems under the earliest deadline first algorithm. The periodic distributed processes are assumed to be guaranteed off-line and decomposed into a set of independent tasks by means of release time and deadline modifications. This paper proposes a similar on... View full abstract»

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

    Publication Year: 2000, Page(s):517 - 521
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (340 KB)

    We analyze a checkpointing strategy for multiple real time tasks with deadlines. Real time tasks usually have deadlines associated with them. For multiple real time tasks, a checkpointing strategy considering deadlines of all tasks is very difficult to derive. We analyze the problem of checkpoint placement for such multiple tasks. In our strategy, the interval between checkpoints are determined fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparative study of the realization of rate-based computing services in general purpose operating systems

    Publication Year: 2000, Page(s):81 - 90
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1036 KB)

    Scheduling architectures that support a late abstraction are becoming increasingly popular for realizing real-time services in general-purpose operating systems. While many rate-based schemes have been proposed, there has been little discussion of the relative merits of each approach. We study the performance of a set of multimedia applications under three different late-based scheduling schemes i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extensions to optimistic concurrency control with time intervals

    Publication Year: 2000, Page(s):108 - 115
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    Although an optimistic approach has been shown to be better suited than locking protocols for real time database systems (RTDBS), it has the problems of unnecessary restarts and heavy restart overhead. The article identifies the unnecessary restart problem in OCC-TI (Optimistic Concurrency Control with Time Intervals), proposes a solution to this problem and demonstrates that the solution will pro... View full abstract»

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