By Topic

Real-Time Computing Systems and Applications, 1996. Proceedings., Third International Workshop on

Date Oct. 30 1996-Nov. 1 1996

Filter Results

Displaying Results 1 - 25 of 42
  • Proceedings Third International Workshop on Real-Time Computing Systems and Applications [front matter]

    Publication Year: 1996, Page(s):i - vii
    Request permission for commercial reuse | PDF file iconPDF (180 KB)
    Freely Available from IEEE
  • New architecture of industrial systems with real-time ATM middleware

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

    We propose a programming model, a real-time client-server model, for distributed real-time systems for monitoring and controlling plant. With the model we can make a system scalable in a flat architecture with an ATM network. The system can be scalable because it has no bottlenecks in plant data transmission as traditional systems has with their cyclic transmissions. On-demand transmission of plan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proceedings of 3rd International Workshop on Real-Time Computing Systems and Applications

    Publication Year: 1996
    Request permission for commercial reuse | PDF file iconPDF (82 KB)
    Freely Available from IEEE
  • Elimination of data copying for multimedia communication

    Publication Year: 1996, Page(s):4 - 9
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (412 KB)

    UDP is a reasonable alternative for multimedia communication. Although UDP provides unreliable service, it fits well with the characteristics of multimedia communication. The goal of this paper is to minimize the overhead of UDP for multimedia communication. The overhead of UDP is dominated by per-byte overhead. This paper investigates how to reduce the number of data copying, which is a major com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Worst-case timing prediction of relay ladder logic by constraint analysis

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

    In this paper, we propose a technique of predicting the execution time of PLC application programs written in relay ladder logic. The proposed technique divides an RLL program into several RLL blocks and then transforms them into boolean logic equations. The internal states of an RLL program is analyzed and their dependencies are used as constraints when we solve the boolean logic equations. The p... View full abstract»

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

    Publication Year: 1996, Page(s):170 - 175
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (572 KB)

    A distributed real-time computer system consists of several processing nodes which are interconnected by communication channel. For a safety critical application the real-time computer system should maintains timely and dependable services despite component failures or environmental changes. In this paper we present a framework of an adaptable distributed real-time computer system which can adjust... View full abstract»

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

    Publication Year: 1996, Page(s):270 - 277
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 KB)

    Reactive scripts are designed to get a flexible approach for responsive systems; they are based on the reactive/synchronous approach, well suited to real time programming. A reactive script interpretor is a broadcast event-driven interpreter which can react to several commands in parallel. Generating events and waiting for occurrence of events are the basic commands which are composed in several w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling of hard-aperiodic requests in dynamic priority systems

    Publication Year: 1996, Page(s):314 - 319
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (468 KB)

    In this paper, we discuss the problem of jointly scheduling both hard deadline of periodic and aperiodic tasks in dynamic priority systems. The proposed scheduling scheme has extended the APS (Alternative Priority Scheduling) algorithm which is developed by the authors. The APS algorithm has a simple slack calculation method which in consequence makes it be practical. The paper develops an efficie... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using harmonic task-sets to increase the schedulable utilization of cache-based preemptive real-time systems

    Publication Year: 1996, Page(s):195 - 202
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB)

    Cache memories have been traditionally precluded in real-time systems because of their unpredictable behavior. The needs of better performance have motivated the development of tools to obtain tighter bounds on the worst-case execution time (WCET) of cached programs. However, they do not allow preemption, because from the point of view of program analysis, the number of preemptions is unknown. To ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An error control scheme for Ethernet-based real-time communication

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

    This paper describes a low-cost error control scheme for transmission control based real-time communication, especially for TDMA-implemented Ethernet. As the bandwidth allocation scheme decides the capacity vector (or slot time) based on the worst case condition, there is usually extra available transmission time for each message stream. The proposed error control scheme uses this extra bandwidth ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • μITRON bus: a real-time control LAN for open network environment

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

    The μITRON bus is a real-time control LAN standard, which is based on the bitwise arbitration CSMA protocol, for connecting low-cost network nodes. This paper presents the three novel mechanisms that are adopted to the μITRON bus for solving the deficiencies of the original bitwise arbitration CSMA protocol: the dual-rate bitwise arbitration CSMA protocol, the priority-reservation bit, and p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Designing a real-time recoverable action

    Publication Year: 1996, Page(s):162 - 169
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    There is a clear and urgent need for mechanisms that are able to integrate the real-time and the reliability requirements. So, it would be possible to address the real-time and fault-tolerance requirements together during the design of the system. This would make the development of reliable real-time systems simple and efficient. This paper presents the development of a fault-tolerant mechanism, o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A multiversion locking protocol for real-time databases with multilevel security

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

    In this paper, we propose a new multiversion locking protocol for real-time database systems for providing multilevel security. Real-Time DBMS (RTDBMS) is a system that processes transactions with explicit timing constraints. Thus, it must satisfy not only logical data consistency but also timing constraints associated with transactions. There are increasing needs for security in many applications... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Continuous media storage system supporting VBR streams

    Publication Year: 1996, Page(s):26 - 33
    Cited by:  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    In this paper, we describe a continuous media storage system that supports the constant frame rate retrieval with variable bit rate streams. The novel characteristics of our storage system is as follows: The utilization of disk bandwidth is higher than traditional continuous media storage systems since the admission test of our storage system adopts average bandwidth usages of respective streams b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Experiences with adaptive QOS mapping scheme

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

    In multimedia computing, guaranteeing Quality of Service (QOS) is one of the most important topics. If QOS values specified by users are not ensured, the users may not put up with the degraded quality of media streams. However, operating systems cannot understand QOS values specified by users directly, then the QOS values should be mapped to the CPU capacity that is required for guaranteeing the Q... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scalable compositional verification of high-level real-time concurrent systems from 107 to 1085 states

    Publication Year: 1996, Page(s):106 - 114
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (836 KB)

    A compositional CTL mode-checking algorithm for real-time concurrent systems with a discrete global clock is presented based on a new high-level description model. We implement the algorithm in a system called VERIFAST-2 which has passed the extended General Session Setup Control protocols with concurrency from 5 to 51 threads all in one minute and demonstrated truly scalable performance with resp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A heuristic scheduling algorithm of imprecise multiprocessor system with 0/1 constraint

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

    The scheduling problem to satisfy both 0/1 constraint and timing constraints with minimizing the total error is NP-complete when the optional parts have arbitrary processing times. In this paper, we present a heuristic scheduling algorithm of imprecise systems with 0/1 constraint which consist of the communicating tasks running on several processors. The algorithm is based on the program graph whi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficiently supporting hard/soft deadline transactions in real-time database systems

    Publication Year: 1996, Page(s):74 - 80
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (540 KB)

    As in other application areas, there is an increasing need for managing a large amount of data in the real-time area. This need gave birth to a system called a real-time database system (RTDBS) that provides database operations with timing constraints. One typical timing constraint in an RTDBS is temporal consistency that states that a transaction must read temporally valid data objects. This requ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A study on transmitting MPEG-I video over a FDDI network

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

    This paper presents two schemes to improve the transmission of real-time MPEG-I video over a FDDI network. Multiple classes of MPEG-I video will be used in the study and what makes this simulation study different from the others is the different kinds of MPEG-I video data we used. These data are captured from real video programmes and we categorized these video clips according to their workload ch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Safe and efficient elimination of infeasible execution paths in WCET estimation

    Publication Year: 1996, Page(s):187 - 194
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (764 KB)

    Reasoning about the timing properties of a program is indispensable in the development of time critical systems where failure to meet deadlines can result in loss of life or material. To this end having tools to calculate safe and tight Worst Case Execution Time (WCET) bounds can be very valuable. In most of the approaches to date a lot of pessimism is attributed to the fact that many paths that a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gnass: a Gnat-based allocation and scheduling system

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

    The Ada 95 programming language is designed for programming large systems and for concurrent programming. However, it does not provide facilities in the areas of processor allocation to tasks while its support for flexible task scheduling is limited. In this paper we describe some experiments, resulting in Gnass, in which we extend Ada facilities for real-time multiprocessor applications. As envir... View full abstract»

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

    Publication Year: 1996, Page(s):320 - 326
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB)

    Real-time process control systems require hard real-time data logging tasks to access all of the data sampled from plants and monitoring tasks to analyze the status of the plants. This paper presents an integrated scheduling scheme for hard real-time data logging tasks and soft real-time monitoring tasks, both types of which require disk I/Os. Conventional disk scheduling policies like Shortest-Se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Static scheduling of hard real-time code with instruction-level timing accuracy

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

    In hard real-time systems, a timing fault may yield catastrophic results. Dynamic scheduling provides the flexibility to compensate for unexpected events at runtime; however, scheduling overhead at runtime is relatively large, constraining both the accuracy of the timing and the complexity of the scheduling analysis. In contrast, static scheduling need not have any runtime overhead. Thus, it has t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The cyclic services in an industrial network

    Publication Year: 1996, Page(s):220 - 226
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB)

    In Profibus master stations poll data from slave stations using the cyclic service-CSRD (Cyclic Send and Request Data with Reply). Because the polling-interval determines the data sampling interval, it is important for the Profibus user to be able to know the maximum polling-interval of a cyclic service. In this paper we develop a formula for determining the maximum polling-interval of a cyclic se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Priority inversion handling in microkernel-based Real-Time Mike

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

    We propose a resource management model to avoid priority inversion problem that may occur when two tasks attempt to send service requests to a server task, and then the server task sends a request to another server task in a nested fashion. In this model we introduce two new concepts: job identifier inheritance and priority ceiling inheritance. We also suggest a new resource locking condition of t... View full abstract»

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