By Topic

# Real-Time Computing Systems and Applications, 1999. RTCSA '99. Sixth International Conference on

## Filter Results

Displaying Results 1 - 25 of 77
• ### Proceedings Sixth International Conference on Real-Time Computing Systems and Applications. RTCSA'99 (Cat. No.PR00306)

Publication Year: 1999
| PDF (336 KB)
• ### Implementation and evaluation of video transfer system over Internet with congestion control based on two level rate control

Publication Year: 1999, Page(s):141 - 148
Cited by:  Papers (2)
| | PDF (791 KB)

Recently, video data transfer is one of the major types of traffic over the Internet. However, it is impossible for the current Internet to guarantee the quality of service (QoS) for video transfer and an influx of a large amount of video data into the Internet may cause serious network congestion. To resolve these problems, we previously proposed a protocol using congestion control based on rate ... View full abstract»

• ### Author index

Publication Year: 1999, Page(s):508 - 509
| PDF (106 KB)
• ### On-chip multimedia real-time OS and its MPEG-2 applications

Publication Year: 1999, Page(s):200 - 203
Cited by:  Papers (1)
| | PDF (352 KB)

Proposes a very small on-chip multimedia real-time operating system (OS) for embedded system LSIs and demonstrates its usefulness on MPEG-2 multimedia applications. The real-time OS, which has a new cyclic task with suspend' and resume' for the interacting hardware/software of embedded system LSIs, implements the minimum set of task, interrupt and semaphore management on the basis of an analysis... View full abstract»

• ### Bounds on test effort for event-triggered real-time systems

Publication Year: 1999, Page(s):212 - 215
Cited by:  Papers (3)
| | PDF (340 KB)

The test effort required for full test coverage is much higher in event-triggered than in time-triggered real-time systems. Thus, it is hard to attain sufficient confidence in the correctness of event-triggered real-time applications by testing. We present a general upper bound on the test effort of constrained event-triggered real-time systems, assuming multiple resources (a refinement of previou... View full abstract»

• ### Handling interrupts in testing of distributed real-time systems

Publication Year: 1999, Page(s):450 - 457
Cited by:  Papers (2)
| | PDF (544 KB)

Testing techniques for sequential software are well established. Unfortunately, these testing techniques are not directly applicable to distributed real-time systems. In previous work we have proposed a method for reproducible and deterministic testing of distributed real-time systems. This method identifies all possible orderings of task starts, preemptions and completions. Each ordering is regar... View full abstract»

• ### Utilization bound re-visited

Publication Year: 1999, Page(s):295 - 302
Cited by:  Papers (5)
| | PDF (560 KB)

Utilization bound is a well-known concept first introduced in the seminal paper of Liu and Layland (1973) which provides a simple and practical way to test the schedulability of a real-time task set. The original utilization bound for the fixed-priority scheduler was given as a function of the number of tasks in the periodic task set. We define the utilization bound as a function of the informatio... View full abstract»

• ### Formal description of real-time systems using SDL

Publication Year: 1999, Page(s):190 - 197
Cited by:  Papers (2)
| | PDF (676 KB)

The Specification and Description Language (SDL) promises to be a good formal language to describe real-time systems, since it has time constructs and supports modeling of distributed systems. The problem with SDL is that it does not have a clear interpretation of time and does not provide a solid description of how the model is supposed to execute in time. This poses a problem for developing tool... View full abstract»

• ### Scheduling periodic task systems to minimize output jitter

Publication Year: 1999, Page(s):62 - 69
Cited by:  Papers (38)  |  Patents (3)
| | PDF (604 KB)

Output jitter-the variation in the intercompletion times of successive jobs of the same task is studied in the context of the preemptive uniprocessor scheduling of periodic real-time tasks. A formal quantitative model for output jitter is proposed. A list of properties that are desirable in any jitter-minimization schedule is enumerated. Algorithms are presented for generating such schedules, and ... View full abstract»

• ### Scalable Architecture for Real-time Applications and use of bus-monitoring

Publication Year: 1999, Page(s):208 - 211
Cited by:  Papers (3)
| | PDF (316 KB)

The lifecycles for industrial applications are becoming shorter, the application complexity is increasing, performance is too low, fault tolerance is required, reuse of components is desired and developers require strong verification tools to cut down the verification phase. As the problem increases with respect to longer development times and higher quality requirements from the customer, it is b... View full abstract»

• ### Dynamic adjustment of serialization order using time-stamp intervals in real-time databases

Publication Year: 1999, Page(s):13 - 20
Cited by:  Papers (5)
| | PDF (628 KB)

Although an optimistic approach has been shown to be better than locking protocols for real-time database systems (RTDBS), it has the problems of unnecessary restarts and heavy restart overhead. In this paper we propose a new optimistic concurrency control protocol called OCC-DATI. In OCC-DATI the number of transaction restarts is minimized by dynamic adjustment of the serialization order of the c... View full abstract»

• ### Pipeline timing analysis using a trace-driven simulator

Publication Year: 1999, Page(s):88 - 95
Cited by:  Papers (15)
| | PDF (736 KB)

We present a technique for worst-case execution time (WCET) analysis for pipelined processors. Our technique uses a standard simulator instead of special-purpose pipeline modeling. Our technique handles CPUs that execute multiple shorter instructions in parallel with long-running instructions. The results of other machine analyses, like cache analysis, can be used in our pipeline analysis. Also, r... View full abstract»

• ### Scheduling fixed-priority tasks with preemption threshold

Publication Year: 1999, Page(s):328 - 335
Cited by:  Papers (51)  |  Patents (2)
| | PDF (624 KB)

In the context of fixed-priority scheduling, feasibility of a task set with non-preemptive scheduling does not imply the feasibility with preemptive scheduling and vice versa. We use the notion of preemption threshold, first introduced by Express Logic, in their ThreadX real-time operating system, to develop a scheduling model that subsumes both preemptive and non-preemptive fixed priority schedul... View full abstract»

• ### A Matlab toolbox for real-time and control systems co-design

Publication Year: 1999, Page(s):320 - 327
Cited by:  Papers (22)  |  Patents (2)
| | PDF (552 KB)

The paper presents a Matlab toolbox for simulation of real-time control systems. The basic idea is to simulate a real-time kernel in parallel with continuous plant dynamics. The toolbox allows the user to explore the timely behavior of control algorithms, and to study the interaction between the control tasks and the scheduler. From a research perspective, it also becomes possible to experiment wi... View full abstract»

• ### Making worst case execution time analysis for hard real-time tasks on state of the art processors feasible

Publication Year: 1999, Page(s):442 - 449
Cited by:  Papers (14)
| | PDF (656 KB)

In the development of embedded hard real-time systems the ability to guarantee worst case execution times is gaining importance and complexity. The fast evolving processor acceleration techniques constantly increase the gap between a processor which uses the accelerations and one which does not. Modeling cache, pipelines and other parts of the processor gets increasingly difficult and time consumi... View full abstract»

• ### Fault-tolerant real-time scheduling under execution time constraints

Publication Year: 1999, Page(s):392 - 395
Cited by:  Papers (6)
| | PDF (344 KB)

The primary/backup with deallocation approach of S. Ghosh et al. (1997) is a strategy for the fault-tolerant online scheduling of hard realtime tasks. In this scheme, tasks are either rejected within a short time after the request or guaranteed to be executed even in case of a processor failure. In this paper several heuristics for the guarantee algorithm are investigated. For the first time diffe... View full abstract»

• ### Efficient global allocation of synchronous bandwidths for hard real-time communication with the timed token MAC protocol

Publication Year: 1999, Page(s):120 - 127
| | PDF (768 KB)

This paper presents an efficient global synchronous bandwidth allocation (SBA) scheme for guaranteeing synchronous message deadlines in a timed token network (such as FDDI) where the timed token medium access control (MAC) protocol is used. A local SBA scheme allocates synchronous bandwidth to a node using only information available locally to that node while a global scheme uses network wide info... View full abstract»

• ### A method to improve the estimated worst-case performance of data caching

Publication Year: 1999, Page(s):255 - 262
Cited by:  Papers (12)
| | PDF (664 KB)

The paper presents a method for tight prediction of worst case performance of data caches in high performance real time systems. Our approach is to distinguish between data structures that exhibit a predictable versus unpredictable cache behavior. Cache performance of accesses to predictable data structures can be automatically and accurately determined by our method, whereas we let accesses to un... View full abstract»

• ### Feasibility intervals for the deadline driven scheduler with arbitrary deadlines

Publication Year: 1999, Page(s):54 - 61
Cited by:  Papers (4)
| | PDF (608 KB)

In this paper, we extend the determination of feasibility intervals to task sets with arbitrary deadlines, both in the synchronous and the asynchronous case. Meanwhile we also improve the arguments and results generally found in the literature View full abstract»

• ### A fault tolerant real-time publisher/subscriber inter-process communication architecture

Publication Year: 1999, Page(s):204 - 207
| | PDF (252 KB)

Real-time publication and subscription (P/S) is an important communication paradigm that can be used to support the flexible integration and upgrading of distributed real-time systems. In this paper, we present a fault-tolerant extension of a real-time P/S service in the context of a duplex architecture. We also present the rationale for the key design decisions and show how to improve the respons... View full abstract»

• ### State restoration in real-time systems

Publication Year: 1999, Page(s):4 - 12
Cited by:  Papers (1)  |  Patents (1)
| | PDF (664 KB)

Fault-tolerant techniques are often employed to provide predictable performance in the presence of malfunction of embedded real-time systems. Our research addresses the problem of restoring real-time systems to a prior state when a fault generates errors. In this paper, we first define the state restoration problem in real-time systems, explaining when is necessary to restore a real-time system to... View full abstract»

• ### Adaptive channel allocation methods for distributed MPEG player system over a cellular radio network

Publication Year: 1999, Page(s):220 - 223
Cited by:  Papers (2)
| | PDF (296 KB)

The growing importance of mobile networks has stimulated active research into how multimedia information can be distributed over a slow and reliable network. In this paper, we propose a multi-channel approach for transmitting video frames over a GSM network. A number of strategies are proposed for channel allocation so that sufficient bandwidth can be provided to satisfy the timing requirements of... View full abstract»

• ### An efficient optimal task allocation and scheduling algorithm for cyclic synchronous applications

Publication Year: 1999, Page(s):78 - 85
Cited by:  Papers (1)
| | PDF (528 KB)

We present an efficient optimal algorithm that allocates and schedules cyclic synchronous tasks into fully connected processors. We consider applications with cyclic synchronous tasks with heavy communication traffic, which run on multiprocessors with a fully connected communication network. We suggest the computing period as the performance measure to minimize the overall computation time. We use... View full abstract»

• ### A symbolic model checker for testing ASTRAL real-time specifications

Publication Year: 1999, Page(s):174 - 181
Cited by:  Papers (1)
| | PDF (708 KB)

ASTRAL is a high-level formal specification language for real-time (infinite state) systems. It is provided with structuring mechanisms that allow one to build modularized specifications of complex real-time systems with layering. In this paper, the methods and techniques used in the prototype implementation of the ASTRAL symbolic model checker, which is a component of the ASTRAL software developm... View full abstract»

• ### Statistical delay analysis with self-similar input traffic in ATM networks

Publication Year: 1999, Page(s):133 - 140
| | PDF (624 KB)

ATM is a connection-oriented technology. Before two hosts can communicate, a connection has to be established between them. Consider a real-time communication application running on top of an ATM network. In order to provide the real-time service, we require the connection to provide a performance guarantee. There are two types of performance guarantees: deterministic and statistical guarantees. W... View full abstract»