• 제어로봇시스템학회논문지
• /
• 제3권1호
• /
• pp.77-88
• /
• 1997

Fieldbus is the lowest level communication network in factory automation and process control systems. Performance of factory automation and process control systems is directly affected by the data delay induced by network traffic. Data generated from several distributed field devices can be largely divided into three categories: sporadic real-time, periodic real-time and non real-time data. Since these data share one fieldbus network medium, the limited bandwidth of a fieldbus network must be appropriately allocated to the sporadic real-time, periodic real-time and non real-time traffic. This paper introduces a new fieldbus design scheme which allocates the limited bandwidth of fieldbus network to several different kinds of traffic. The design scheme introduced in this study not only satisfies the performance requirements of application systems interconnected into the fieldbus but also fully utilizes the network resources. The design scheme introduced in this study can be applicable to cyclic service protocols operated under single-service discipline. The bandwidth allocation scheme introduced in this study is verified using a discrete-event/continuous-time simulation experiment.

• Journal of Computing Science and Engineering
• /
• 제9권4호
• /
• pp.177-189
• /
• 2015

High-performance processors using Non-Uniform Cache Architecture (NUCA) are increasingly used to deal with the growing wire delays in multicore/manycore processors. Due to the convergence of high-performance computing with embedded computing, NUCA caches are expected to benefit high-end embedded systems as well. However, for real-time systems that use multicore processors with NUCA caches, it is crucial to bound worst-case execution time (WCET) accurately and safely. In this paper, we developed a WCET analysis approach by considering the effect of static NUCA caches on WCET. We compared the WCET in real-time applications with different topologies of static NUCA caches. Our experimental results demonstrated that the static NUCA cache could improve the worst-case performance of realtime applications using multicore processor compared to the cache with uniform access time.

• Journal of Computing Science and Engineering
• /
• 제3권1호
• /
• pp.59-71
• /
• 2009

While the average-case performance is important for general-purpose applications, worst-case performance is crucial for real-time systems to ensure schedulability and reliability. Recent work has shown that simple prefetching techniques such as the Next-N-Line prefetching can benefit both average-case and worst-case performance; however, the improvement on the worstcase execution time (WCET) is rather limited and inefficient. This paper presents two instruction prefetching approaches that are specially designed to enhance the worst-case performance, including the loop-based prefetching and WCET-oriented prefetching. Our experiments indicate that both instruction prefetching techniques can achieve better worst-case execution cycles than the Next-N-Line prefetching while having various impacts on the average-case performance.

• 자동차안전학회지
• /
• 제14권2호
• /
• pp.20-25
• /
• 2022

This paper represents an adaptive Region of Interest (ROI) decision for real-time performance in an autonomous driving perception module. Since the whole automated driving system consists of numerous modules and subdivisions of module occur, it is necessary to consider the characteristics, complexity, and limitations of each module. Furthermore, Light Detection And Ranging (Lidar) sensors require a considerable amount of time. In view of these limitations, division of submodule is inevitable to represent high real-time performance for stable system. This paper proposes ROI to reduce the number of data respect to computation time. ROI is set by a road's design speed and the corresponding ROI is applied differently to each vehicle considering its speed. The simulation model is constructed by ROS, and overall data analysis is conducted by Matlab. The algorithm is validated using real-time driving data in urban environment, and the result shows that ROI provides low computational costs.

• 전자공학회논문지B
• /
• 제33B권12호
• /
• pp.13-23
• /
• 1996

In tis paper we researched the implementation methodology and techniques for the high real-time responsive operating system of an ISDN PABX system. The operating system we developed takes a high role as a dedicated real-time operating system for PABX systems. It provides the functions and synchronization, interprocessor communication, interrupt processing, and data I/O processing. And also it provides lots of real-time processing functions for supproting various real-time applications. Finally, we evaluated the performance by measuring the best, the average, and the worst-case execution time of all functions implemented in this real-time operating system.

• 전자공학회논문지A
• /
• 제31A권10호
• /
• pp.21-30
• /
• 1994

We discussed the Distributed Control System's design on preface and analyzed time of the real-time communication by using designed system. The DCS proposed in this thesis was implemented to network file system having recovery advantage and shared memory method to access file system of a Remote Station with ease. Also, this system minimized the network delay-time by using the real-time VME147 board. In implemented DCS, the performance analysis of real-time process of a Remote Station was done to get the total time for reak-tune communication from a Remote Station to the Central Station after terminating of process. For the analysis of system performance, we experiented by three steps. Firstly, we measuredthe processing the of LOOP function that real-time CPU convertes to-2,500~10.000 values from the input data of the Analog Interface Card. Secondly, we measured the processing time of the LOGIC function and the LOOP function. Lastly, we measured total processing time for communication from a Remote Station to the Centrol Station.

• 제어로봇시스템학회논문지
• /
• 제13권6호
• /
• pp.596-602
• /
• 2007

Recently, many ECUs(Electronic Control Units) have been used to enhance the vehicle safety, which leads to a distributed real-time control system. The distributed real-time control system requires to reduce the network delay for dependable real-time performance. There are two different paradigms by which a network protocol operates: event-triggered and time-triggered. This paper focuses on implementation of a time-triggered protocol. i.e. TTP/C(Time-Triggered Protocol/class C). This paper presents a design method of TTP control network and performance evaluation of distributed real-time control system using TTP protocol.

• 한국자동차공학회논문집
• /
• 제24권2호
• /
• pp.127-136
• /
• 2016

The camera based object detection systems should satisfy the recognition performance as well as real-time constraints. Particularly, in safety-critical systems such as Autonomous Emergency Braking (AEB), the real-time constraints significantly affects the system performance. Recently, multi-core processors and system-on-chip technologies are widely used to accelerate the object detection algorithm by distributing computational loads. However, due to the advanced hardware, the complexity of system architecture is increased even though additional hardwares improve the real-time performance. The increased complexity also cause difficulty in migration of existing algorithms and development of new algorithms. In this paper, to improve real-time performance and design complexity, a task scheduling strategy is proposed for visual object tracking systems. The real-time performance of the vision algorithm is increased by applying pipelining to task scheduling in a multi-core processor. Finally, the proposed task scheduling algorithm is applied to crosswalk detection and tracking system to prove the effectiveness of the proposed strategy.

• 한국IT서비스학회지
• /
• 제16권3호
• /
• pp.103-111
• /
• 2017

The real time scheduling is a key research area in high performance computing and has been a source of challenging problems. A periodic task is an infinite sequence of task instance where each job of a task comes in a regular period. The RMS (Rate Monotonic Scheduling) algorithm has the advantage of a strong theoretical foundation and holds out the promise of reducing the need for exhaustive testing of the scheduling. Many real-time systems built in the past based their scheduling on the Cyclic Executive Model because it produces predictable schedules which facilitate exhaustive testing. In this work we propose hybrid scheduling method which combines features of both of these scheduling algorithms. The original rate monotonic scheduling algorithm didn't consider the uniform sampling tasks in the real time systems. We have enumerated some issues when the RMS is applied to our hybrid scheduling method. We found the scheduling bound for the hard real-time systems which include the uniform sampling tasks. The suggested hybrid scheduling algorithm turns out to have some advantages from the point of view of the real time system designer, and is particularly useful in the context of large critical systems. Our algorithm can be useful for real time system designer who must guarantee the hard real time tasks.

• 한국콘텐츠학회논문지
• /
• 제21권1호
• /
• pp.475-484
• /
• 2021

안드로이드 운영체제는 스마트폰 시장과 함께 빠르게 자리잡으며 네비게이션, 냉장고 패널 등 다양하게 적용하고 있다. 기존 단말은 정확한 수행 시간이 요구되는 RTOS를 사용하면서 높은 정밀도를 요구하는 서비스의 구현이 가능했으나, 안드로이드는 높은 정밀도의 실시간 성능을 제공할 수 없는 단점이 있다. 본 논문에서는 안드로이드 운영체제에서 동작하는 실시간 통신 방법을 제안한다. 실시간 통신은 UDP 프로토콜을 이용하여 부하를 줄이고, 커널 영역에 고정밀 타이머를 통해서 실시간 운영체제의 타임 틱을 구성한다. 안드로이드 응용 레벨의 라이브러리를 작성하여 실시간 통신을 구현하고 실시간 성능 검증을 위해 기존 안드로이드의 라이브러리와 비교하였다.