• Journal of IKEEE
• /
• v.5 no.2 s.9
• /
• pp.164-173
• /
• 2001

In this paper, we have designed and implemented a new hard embedded real-time system to satisfy hard real-time constraints in moving independently. Real-time kernel should be small size, fast and predictable. Because of the great variety of demands on real time scheduling, a real time kernel should also include a flexible and re-programmable task scheduling discipline. In this paper, we present that real-time applications should be split into small and simple parts with hard real-time constraints. To satisfy these properties, we designed real-time kernel and general kernel, that have their different properties. In real-time tasks, interrupt processing should be run. In general kernel, non real time tasks or general tasks are run. The efficiency of the proposed hard embedded real-time system is shown by comparison results for performance of the proposal real time kernel with both RT-Linux and QNX.

• 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.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.8 no.6
• /
• pp.295-301
• /
• 2013

In this paper, we propose a real-time centralized soft motion control system for high speed and precision robot control. The system engages EtherCAT as high speed industrial motion network to enable force based motion control in real-time and is composed of software-based master controller with PC and slave interface modules. Hard real-time control capacity is essential for high speed and precision robot control. To implement soft based real time control, The soft based master controller is designed using a real time kernel (RTX) and EtherCAT network, and servo processes are located in the master controller for centralized motion control. In the proposed system, slave interface modules just collect and transfer all sensor information of robot to the master controller via the EtherCAT network. It is proven by experimental results that the proposed soft motion control system has real time controllability enough to apply for various robot control systems.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.8
• /
• pp.594-601
• /
• 2004

We analyze checkpoint strategy for multiple real-time periodic tasks with hard deadlines. Real-time tasks usually have deadlines associated with them. For multiple real-time tasks, checkpoint strategy considering deadlines of all tasks is very difficult to derive. We analyze the problem of checkpoint placement for such multiple periodic tasks. In our strategy, the interval between checkpoints is determined for each task considering its deadline. An approximated failure probability over a specified interval is derived. Then the number of checkpoints for each task is selected to minimize the approximated failure probability. To show the usefulness of our strategy, error bound between the exact and the approximated failure probability is estimated, which is revealed to be quite small.

• Journal of Information Technology Services
• /
• v.16 no.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.

• The KIPS Transactions:PartA
• /
• v.9A no.1
• /
• pp.9-18
• /
• 2002

In this paper, we propose scalable scheduling techniques based on EDF to efficiently integrate hard real-time and multimedia soft real-time tasks in the distributed real-time multimedia database system. Hard tasks are guarangteed based on worst case execution times, whereas multimedia soft tasks are served based on mean execution times. This paper describes a served-based scheme for partitioning the CPU bandwidth among different task classes that coexist in the same system. To handle the problem of class overloads characterized by varying number of tasks and varying task arrival rates, thus scheme shows how to adjust the fraction of the CPU bandwidth assigned to each class. This scheme fixes the maximum time that each hard task can execute in the period of the server, whereas it can dynamically change the bandwidth reserved to each multimedia task. The proposed method is capable of minimizing the mean tardiness of multimedia tasks, without jeopardizing the schedulability of the hard tasks. The performance of this scheduling method is compared with that of similar mechanisms through simulation experiments.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.11
• /
• pp.21-27
• /
• 2019

Recently, embedded systems have been introduced in various fields such as smart factories, industrial drones, and medical robots. Since sensor data collection and IoT functions for machine learning and big data processing are essential in embedded systems, it is essential to port the operating system that is suitable for the function requirements. However, in embedded systems, it is necessary to separate the hard real-time system, which must process within a fixed time according to service characteristics, and the flexible real-time system, which is more flexible in processing time. It is difficult to port the operating system to a low-performance embedded device such as 8BIT MCU to perform simultaneous real-time. When porting a real-time OS (RTOS) to a low-specification MCU and performing a number of tasks, the performance of the real-time and general processing greatly deteriorates, causing a problem of re-designing the hardware and software if a hard real-time system is required for an operating system ported to a low-performance MCU such as an 8BIT MCU. Research on the technology that can process real-time processing system requirements on RTOS (ported in low-performance MCU) is needed.

• Journal of Korea Multimedia Society
• /
• v.7 no.7
• /
• pp.886-895
• /
• 2004

In this paper, we propose the dynamic allocation scheme of the CPU bandwidth to efficiently integrate and schedule these tasks in the same system, where multimedia tasks and hard real-time tasks can coexist simultaneously. Hard real-time tasks are guaranteed based on worst case execution times, whereas multimedia tasks modeled as soft real-time tasks are served based on mean parameters. This paper describes a server-based allocation scheme for assigning the CPU resource to two types of tasks. Especially for MPEG video streams, we show how to dynamically control the fraction of the CPU bandwidth allocated to each multimedia task. The primary purpose of the proposed method is to minimize the mean tardiness of multimedia tasks while satisfying the timing constraints of hard real-time tasks present in the system. We showed through simulations that the tardiness experienced by multimedia tasks under the proposed allocation scheme is much smaller than that experienced by using other scheme.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1655-1658
• /
• 2004

In this paper, we design and implement remote servo motor control system with real-time micro embedded operating system. The system, where controller and camera image grabber are mounted, handles control commands transmitted from a remote PC web browser. A hard real-time servo motor driver running on the real-time micro embedded OS and then a digital control application which confirms precise sampling time intervals is constructed. Frame grabber images transmitted from camera are saved in a image data format to view on remote PC web browser.

• Journal of Institute of Control, Robotics and Systems
• /
• v.5 no.2
• /
• pp.145-150
• /
• 1999

A real-time control system, composed of the controlled processor and the controller computer(s), may have a variety of task types, some of which have tight timing-constraints in generating the correct control input. The maximum period of those task failures tolerable by the system is called the hard deadline, which depends on not only fault characteristics but also task characteristics. In the paper, we extend a method deriving the hard deadline in LTI system executing single task. An algorithm to combine the deadlines of all the elementary tasks in the same operation-mode is proposed to derive the hard deadline of the entire system. For the end, we modify the state equation for the task to capture the effects of task failures (delays in producing correct values) and inter-correlation. We also classify the type of executing the tasks according to operation modes associated with relative importance of correlated levels among tasks, into series, parallel, and cascade modes. Some examples are presented to demonstrate the effectiveness of the proposed methods.