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

• The Journal of Information Technology
• /
• v.4 no.2
• /
• pp.25-36
• /
• 2001

In this paper, we present the development of distributed dual real-time kernel system. This paper proposed that real-time applications should be split into small and simple parts with real-time constraints, Following this concept we have designed to preserve the properties of both hard real-time kernel and general kernel. 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 un. In general kernel, non real-time tasks or general tasks are run. We compared the results of this study for performance of the proposal real-time kernel with both RT Linux 0.5a and QNX 4.23A, that is, of interrupt latency scheduling precision and message passing.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.6 no.4
• /
• pp.369-375
• /
• 2001

This paper proposes a dual real-time scheduling design under real-time constraints kernel environments. In this paper, we have designed both the real-time kernel and the general kernel that have their different properties to satisfy these properties, that is, interrupt latency, scheduling precision, and message passing. In real-time tasks, interrupt processing should be run. In general kernel, non real-time tasks or general tasks are run. Also, when tasks conflict, it executed the mixed priority scheduling that non real-time kernel executed static scheduling and real-time kernel executed dynamic priority transformation scheduling, that is, least-laxity-first/minimization preemption scheduling. We have compared the results of this study for performance of the proposal real-time kernel with both RT Linux 0.5a and QNX 4.23A, that is, of interrupt latency scheduling precision and message passing.

• The Journal of the Korea Contents Association
• /
• v.17 no.10
• /
• pp.587-597
• /
• 2017

Recently, the demand for real-time performance in mobile environment is increasing due to the improvement of hardware performance, however a GPOS(General-Purpose Operating System) such as Android and Linux do not provide real-time performance. We developed RTiK(Real-Time implant Kernel) for this problem, but it has the disadvantage of supporting only x86 Architecture. In this paper, we designed and implemented a RTiKA(Real-Time implanted Kernel for ARM) to support real-time in ARM Linux. We used MCT(Multi-Core Timer) timer which replaces Local APIC Timer for real-time support, and we measured the period of generated real-time task for performance verification and evaluation. As the recent the RTiKA can guarantee the operating of several real-time tasks based on the cycle of 1ms.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.414-414
• /
• 2000

This paper presents a method for building a real-time kernel of autonomous mobile robot control systems. Until now, most of robots have their own operation softwares dedicated only for their use. Sometimes, operation softwares were developed based on MS-DOS or other real -time kernel based on UNIX. However, MS-DOS has many restrictions for use as a robot operation system. Also, mix based real-time kernel has some Limitations for use with mobile robots. So, in this paper, we focus on building a real-time kernel based on Linux. The in this paper, the software modules of Task Management, Memory Management, Intertask Communication, and Synchronization are redesigned. To show the efficiency of the paper, it was applied to run Nomad Super Scout II avoiding obstacles detected by sonar sensor array.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.489-492
• /
• 2000

Because of the great variety of demands on real-time scheduling, real-time kernel should be small, fast and predictable. In this paper, we present that Real-time applications should be split into small and simple parts with hard real-time constraints. Following this concept, we have designed and implemented to have the properties of both hard real-time kernel and general kernel. And, to prove be useful the proposal kernel, we compare and analyze the performance with RT-Linux 0.5a

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.4
• /
• pp.337-342
• /
• 2012

This paper presents performance evaluation of real-time mechanisms for real-time embedded linux. First, we presents process for implementing open-source real-time embedded linux namely RTAI and Xenomai. These are real-time extensions to linux kernel and we implemented real-time embedded linux over the latest linux kernel. Measurements of executions of real-time mechanisms for each distribution are performed to give a quantitative comparison. Performance evaluations are conducted in kernel space about repeatability of periodic task, response time of Semaphore, FIFO, Mailbox and Message queue in terms of inter-task communication for each distribution. These rules can be helpful for deciding which real-time linux extension should be used with respect to the requirements of the real-time applications.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.3
• /
• pp.182-187
• /
• 2004

In this paper, we propose a PC based distributed controller for a two axis convey table using real-time micro-kernel. PC, Windows program, gives an easy way to implement wealthy GUI and micro-kernel, ${\mu}$C/OS-II, provides a real-time capability to control devices. We built a real-time distributed control system using ${\mu}$C/OS-II kernel which needs to process the tasks for two motors within the desired time to synchronize the motion. We used both semaphore and message mail box for synchronization. Unlike the previous study where we used step motors for the actuator of two axes convey table, we rebuilt the convey table with DC motors and the dedicated position servo which had built in out lab, and then we implemented a realtime distributed control system by putting the micro-kernel into between PC and position servo. Moreover we developed the PC based graphic user interfaces for generating planar drawing image control. Experimental results also presented to show the Proposed control system is useful.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.12 no.4
• /
• pp.205-212
• /
• 2017

Linux Foundation has announced a real-time kernel, called Zephyr, for IoT applications recently. Zephyr kernel provides synchronous and asynchronous IPC for data communication between threads. Synchronous IPC is useful for programming multi-threads that need to be executed synchronously, since the sender thread is blocked until the data is delivered to the receiver thread and the completion of data transfer can be known to two threads. In general, 'IPC execution time' is defined as the time duration between the sender thread sends data and the receiver thread receives the data sent. Especially, it is important that 'IPC execution time' in the synchronous IPC should be fixed in real-time kernel like Zephyr. However, we have found that the execution time of the synchronous IPC in Zephyr kernel increases in proportion to the number of threads executing in the kernel. In this paper, we propose a method to implement a fixed time synchronous IPC in Zephyr kernel using Direct Thread Switching(DTS) technique. Using the technique, the receiver thread executes directly after the sender thread sends a data during the remaining time slice of the sender thread and we can archive a fixed IPC execution time even when the number of threads executing in the kernel increases. In this paper, we implemented synchronous IPC using DTS in the Zephyr kernel and found the IPC execution time of the IPC is always 389 cycle that is relatively small and fixed.