By Topic

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

Date 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
  • 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.
  • Space efficient wait-free buffer sharing in multiprocessor real-time systems based on timing information

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

    A space-efficient wait-free algorithm for implementing a shared buffer for real-time multiprocessor systems is presented in this paper. The commonly used method to implement shared buffers in real-time systems is based on mutual exclusion. Mutual exclusion is penalised by blocking that typically leads to difficulties in guaranteeing deadlines in real-time systems. Researchers have introduced nonbl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Real-time multiple video player systems

    Publication Year: 2000, Page(s):172 - 176
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (472 KB)

    In previous years, various real-time scheduling techniques have been proposed to improve the performance of a distributed multimedia system. However, not much work has been done on how a client player can play multiple videos concurrently. In this paper, we have designed a distributed multimedia system where a client player can play different videos at the same time. We introduce two mechanisms: p... 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.
  • ProtEx: a toolkit for the analysis of distributed real-time systems

    Publication Year: 2000, Page(s):183 - 188
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (540 KB)

    Large-scale distributed real-time systems are increasingly difficult to analyze within the Rate Monotonic Analysis framework. This is due partly to their heterogeneity, complex interaction between components, and variety of scheduling and queuing policies present in the system. We present a methodology to extend the traditional RMA approach by allowing general characterization of workload and flex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probabilistic approach to switched Ethernet for real-time control applications

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

    Switched Ethernet combines Ethernet and ATM switching technology. The authors propose a probability based admission control algorithm over switched Ethernet to provide real time capability for control applications. The main contribution of the paper is providing an efficient means of estimating the queuing possibilities and the corresponding queuing delays inside the switch for periodic control sy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DC2 scheduling for aperiodic tasks in strongly partitioned real-time systems

    Publication Year: 2000, Page(s):368 - 375
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (772 KB)

    The strongly partitioned real time system (SP-RTS) provides temporal and spatial partitioning for its integrated real time applications. The SP-RTS architecture adopts a two-level hierarchical scheduling mechanism. In the lower level, multiple partitions (applications) are dispatched under a cyclic scheduling, whereas, in the higher level, multiple periodic tasks of each partition are scheduled ac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Eliminating annotations by automatic flow analysis of real-time programs

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

    There is an increasing demand for methods that calculate the worst case execution time (WCET) of real time programs. The calculations are typically based on path information for the program, such as the maximum number of iterations in loops and identification of infeasible paths. Most often, this information is given as manual annotations by the programmer. Our method calculates path information a... 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 (5)
    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.
  • Optimal scheduling of imprecise computation tasks in the presence of multiple faults

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

    With the advance of applications such as multimedia, image/speech processing and real-time AI, real-time computing models allowing to express the “timeliness versus precision” trade-off are becoming increasingly popular. In the imprecise computation model, a task is divided into a mandatory part and an optional part. The mandatory part should be completed by the deadline even under wor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A multi-server design for a distributed MPEG video system with streaming support and QoS control

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

    In this paper, we propose a new transmission scheme suitable for a multi-server video system. The proposed transmission scheme is priority-driven and assigns priorities to the video data according to the urgency and the nature of the MPEG video. With the software feedback mechanism, and according to the feedback, the system changes the feeding pattern or skips some unrecognizable frames in order t... 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.
  • On the verification of Wireless Transaction Protocol using SGM and RED

    Publication Year: 2000, Page(s):379 - 383
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    The exponentially large sizes of state spaces have been a major obstacle in formal verification, which are due to high process concurrency, and large constants that are compared to clock variables and to discrete variables. We show how an intelligent permutation of reduction techniques and a good selection of data structures can be used to decrease the effect of the above explosion factors. First,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finding the critical path in a time-constrained workflow

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

    The concept of the critical path has not been much addressed in a workflow even though it has been studied in many areas of computer engineering such as directed acyclic graphs. The authors first specify workflow control constructs which create workflow control structures used to describe business processes. They then propose a method to find out the critical path in a time-constrained workflow bu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Another formal proof for Deadline Driven Scheduler

    Publication Year: 2000, Page(s):481 - 485
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB)

    The paper presents another formal proof for the correctness of the Deadline Driven Scheduler (DDS). This proof is different from Zheng Yuhua and Zhou Chaochen's, although both are given in terms of duration calculus (DC) which provides abstraction for random preemption of processor. In the proof of Zheng and Zhou, the induction rules of the duration calculus are heavily applied, but the intuition ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parametric verification of the IEEE 1394a Root Contention protocol using LPMC

    Publication Year: 2000, Page(s):207 - 214
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (604 KB)

    This paper presents an application of mechanical verification using LPMC, a new version of the PMC model checker tool. The focus is on the modeling and the automatic verification of a protocol contained in the IEEE 1394a standard, the Root Contention protocol. The Root Contention protocol involves both real-time and randomization. As is shown, the study demonstrates the power of the new LPMC capab... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new method for testing real time systems

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

    In this article, we present a framework for testing real-time systems. More precisely, (1) we propose a method for generating test sequences, (2) we determine constraints which guarantee the executability of test sequences, and (3) we propose a procedure and a test architecture for executing test sequences. Contrary to other test methods for real-time systems, our method avoids state explosion 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 (6)
    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.
  • Deadline dependent coding-a framework for wireless real-time communication

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

    A framework for real-time communication over a wireless channel is proposed. The concept of deadline dependent coding (DDC), previously suggested by the authors, is further developed using soft decision decoding of block codes to maximize the probability of delivering information before a given deadline. The strategy of DDC is to combine different coding and decoding methods with automatic repeat ... View full abstract»

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

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

    Presents wait-free algorithms for implementing multi-writer read/write pure-buffers in multiprocessor real-time systems. Such buffers are commonly used when existing data is overwritten as newly-produced data becomes available. Pure-buffer algorithms share several buffers between client processes and use handshaking mechanisms to ensure the safety of concurrent read and write operations. We presen... 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.
  • Imprecise task scheduling and overload management using OR-ULD

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

    This paper evaluates the OR-ULD (Overload Resolution using Utility Loss Density) algorithm for imprecise computation workloads, where tasks are decomposed into one mandatory task and one optional task. OR-ULD is a value-driven overload resolution algorithm running in O(n log n) time, where n is the number of tasks. The algorithm is invoked only in case of transient overloads. By representing error... 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 (10)
    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.