• Journal of Institute of Control, Robotics and Systems
• /
• v.5 no.1
• /
• pp.115-121
• /
• 1999

Advanced digital computer technology enables the computer-based controllers to replace the traditional analog controllers used in factory automations. This replacement, however, brings up the side effects caused by the quantization error and non-real-time execution of control software. This paper describes the structure of real-time simulator and controller that can be used for design and verification of real-time digital controllers. The virtual machine concept adopted by the proposed real-time simulator makes the proposed simulator be independent from the specific hardware platforms. The proposed system can also be used in the loosely coupled distributed environments connected through local area network using real-time message passing algorithm and virtual data table based on the shared memory mechanism.

• Journal of Biomedical Engineering Research
• /
• v.16 no.3
• /
• pp.317-324
• /
• 1995

A need exists for the accurate identification of time series models having time varying parameters, as is important in the case of real time identification of nonstationary EMG signal. Thls paper describes real time identification and muscle fatigue monitoring method of nonstationary EMG signal. The method is composed of the efficient identifier which estimates the autoregressive parameters of nonstationary EMG signal model, and its real time implementation by using T805 parallel processing computer. The method is verified through experiment with real EMG signals which are obtained from surface electrode. As a result, the proposed method provides a new approach for real time Implementation of muscle fatigue monitoring and the execution time is 0.894ms/sample for 1024Hz EMG signal.

• Journal of Computing Science and Engineering
• /
• v.1 no.1
• /
• pp.56-73
• /
• 2007

Demands have been growing in safety-critical application fields for producing networked real-time embedded computing (NREC) systems together with acceptable assurances of tight service time bounds (STBs). Here a service time can be defined as the amount of time that the NREC system could take in accepting a request, executing an appropriate service method, and returning a valid result. Enabling systematic composition of large-scale NREC systems with STB certifications has been recognized as a highly desirable goal by the research community for many years. An appealing approach for pursuing such a goal is to establish a hard-real-time (HRT) component model that contains its own STB as an integral part. The TMO (Time-Triggered Message-Triggered Object) programming scheme is one HRT distributed computing (DC) component model established by the first co-author and his collaborators over the past 15 years. The TMO programming scheme has been intended to be an advanced high-level RT DC programming scheme that enables development of NREC systems and validation of tight STBs of such systems with efforts far smaller than those required when any existing lower-level RT DC programming scheme is used. An additional goal is to enable maximum exploitation of concurrency without damaging any major structuring and execution approaches adopted for meeting the first two goals. A number of previously untried program structuring approaches and execution rules were adopted from the early development stage of the TMO scheme. This paper presents new concrete justifications for those approaches and rules, and also discusses new extensions of the TMO scheme intended to enable further exploitation of concurrency in NREC system design and programming.

• The KIPS Transactions:PartA
• /
• v.16A no.6
• /
• pp.489-500
• /
• 2009

Robots have limited computing resources and robot services have different requirement such as sensors, actuators, computational capabilities and timeliness. In this paper, we propose a dynamic management method of service execution contexts to perform various services efficiently and to meet the time constraint of service in network-based robots. The proposed method is tested in the real network-based robot system. The results show that the real-time requirement for services is satisfied and the resource utilization is improved. The proposed method provides the extendability and flexibility of sensors and services by aptly modifying service execution contexts and increases the reusability of service.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.9
• /
• pp.2533-2539
• /
• 1999

Two scheme are widely used for fault-tolerant systems : one is the duplex system that has a physical redundancy, and the other one is the checkpointing scheme that rolls back to the last checkpoint at a failure. The average execution time and availability are important factors for measuring the performance of the fault-tolerant systems. However, in fault-tolerant real-time systems with a time constraint, meeting the time constrain instead of reducing the average execution time is the most important factor in the performance evaluation. We analyze and compare the performance of two fault-tolerant scheme (the duplex system and the checkpointing scheme) for real-time applications.

• Journal of Computing Science and Engineering
• /
• v.5 no.1
• /
• pp.1-18
• /
• 2011

As the first step toward real-time multi-core computing, this paper presents a novel approach to bounding the worst-case performance for threads running on multi-core processors with shared L2 instruction caches. The idea of our approach is to compute the worst-case instruction access interferences between different threads based on the program control flow information of each thread, which can be statically analyzed. Our experiments indicate that the proposed approach can reasonably estimate the worst-case shared L2 instruction cache misses by considering the inter-thread instruction conflicts. Also, the worst-case execution time (WCET) of applications running on multi-core processors estimated by our approach is much better than the estimation by simply assuming all L2 instruction accesses are misses.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.5 no.4
• /
• pp.243-248
• /
• 2005

The UAV (Unmanned Aerial Vehicle) systems like unmanned autonomous helicopters are used in various missions of flight navigation and used to collect the environmental information of the surroundings. To realize the full functionalities of the UAV, the software part becomes a challenging problem. In this paper embedded real-time software architecture for unmanned autonomous helicopter is proposed that guarantee real-time performance of hard-real time tasks and re-configurability of soft-real time and non-real time tasks. The proposed software architecture has four layers: hardware, execution, service agent and remote user interface layer according to the reactiveness level for external events. In addition, the layered separation of concurrent tasks makes different kinds of mission reconfiguration possible in the system. An Unmanned autonomous helicopter system was implemented (Kyosho RC Helicopter) in our lab to test and evaluate the performance of the proposed system.

• ETRI Journal
• /
• v.29 no.3
• /
• pp.270-280
• /
• 2007

In Linux, real-time tasks are supported by separating real-time task priorities from non-real-time task priorities. However, this separation of priority ranges may not be effective when real-time tasks make the system calls that are taken care of by the kernel threads. Thus, Linux is considered a soft real-time system. Moreover, kernel threads are configured to have static priorities for throughputs. The static assignment of priorities to kernel threads causes trouble for real-time tasks when real-time tasks require kernel threads to be invoked to handle the system calls because kernel threads do not discriminate between real-time and non-real-time tasks. We present a dynamic kernel thread scheduling mechanism with weighted average priority inheritance protocol (PIP), a variation of the PIP. The scheduling algorithm assigns proper priorities to kernel threads at runtime by monitoring the activities of user-level real-time tasks. Experimental results show that the algorithms can greatly improve the unexpected execution latency of real-time tasks.

• Journal of Computing Science and Engineering
• /
• v.9 no.2
• /
• pp.51-72
• /
• 2015

Time predictability is crucial in hard real-time and safety-critical systems. Cache memories, while useful for improving the average-case memory performance, are not time predictable, especially when they are shared in multicore processors. To achieve time predictability while minimizing the impact on performance, this paper explores several time-predictable scratch-pad memory (SPM) based architectures for multicore processors. To support these architectures, we propose the dynamic memory objects allocation based partition, the static allocation based partition, and the static allocation based priority L2 SPM strategy to retain the characteristic of time predictability while attempting to maximize the performance and energy efficiency. The SPM based multicore architectural design and the related allocation methods thus form a comprehensive solution to hard real-time multicore based computing. Our experimental results indicate the strengths and weaknesses of each proposed architecture and the allocation method, which offers interesting on-chip memory design options to enable multicore platforms for hard real-time systems.

• Journal of IKEEE
• /
• v.22 no.1
• /
• pp.6-13
• /
• 2018

To develop highly dependable CPS, M&S(modeling and simulation) is very important. It is not easy to model any CPS whole system in a single simulation tool because each simulation tool is optimized for modeling each different part of the CPS. The FMI is the standard for M&S between different simulation tools. The DDS is a communication middleware suitable for large-scale real-time data transmission. In this paper, we proposed FMI based CPS real-time distributed simulaton framework using DDS. To evaluate the performance of the proposed framework, we performed distributed simulation using IEEE HLA/RTI and OMG DDS middleware and measured and compared the execution time of the entire simulation. From the simulation results, we can confirm that the simulation execution time using DDS is at least 1.14 times faster compared to execution time using HLA/RTI.