• The KIPS Transactions:PartA
• /
• v.8A no.1
• /
• pp.16-26
• /
• 2001

This paper proposes an extended scheduler model that is an extension of the existing model proposed already in [4, 5], which consists of upper layer task scheduler and lower layer scheduling framework. However, in order to support aperiodic task scheduling, the task scheduler has been divided into two parts, such as periodic task control component and aperiodic task control component. Thus, the proposed model can support various bandwidth-preserving servers that can service aperiodic tasks. The model distinctly separates a classic monolithic kernel scheduler into several kernel components according to their functionality. This enables system developers to implement a new scheduling algorithm or aperiodic task server independent of complex low kernel mechanism, and reconfigure the system at need. In Real-Time Linux [6], we implemented the proposed scheduling framework representative scheduling algorithms, and server bandwidth-preserving servers on purpose to test. Throughout these implementations, we confirmed that a new algorithm or server could be developed independently without updates of complex low kernel modules. In order to verify efficiency of the proposed model, we measured the performance of several aperiodic task servers. The results showed this the performance of model, which even consisted of two hierarchical components and several modules, didnt have such high run-time overhead, and could efficiently support reconfiguration and scheduler development.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.9
• /
• pp.1167-1176
• /
• 2002

In a (hard) real-time system, every time-critical task must meet its timing constraint, which is typically specified in terms of its deadline. Many computer systems, such as those for open system environment or multimedia services, need an efficient schedulability test for on-line real-time admission control of new jobs. Although various polynomial time schedulability tests have been proposed, they often fail to decide the schedulability of the system precisely when the system is heavily loaded. Furthermore, the most of previous studies on on-line real-time schedulability tests are concentrated on periodic task applications. Thus, this paper presents an efficient on-line real-time schedulability check algorithm which can be used for imprecise real-time system predictability before dispatching of on-line imprecise real-time task system consisted of aperiodic and preemptive task sets when the system is overloaded.

• Nuclear Engineering and Technology
• /
• v.40 no.7
• /
• pp.615-624
• /
• 2008

In this paper, the contribution of task types and error types involved in the human-related unplanned reactor trip events that have occurred between 1986 and 2006 in Korean nuclear power plants are analysed in order to establish a strategy for reducing the human-related unplanned reactor trips. Classification systems for the task types, error modes, and cognitive functions are developed or adopted from the currently available taxonomies, and the relevant information is extracted from the event reports or judged on the basis of an event description. According to the analyses from this study, the contributions of the task types are as follows: corrective maintenance (25.7%), planned maintenance (22.8%), planned operation (19.8%), periodic preventive maintenance (14.9%), response to a transient (9.9%), and design/manufacturing/installation (6.9%). According to the analysis of the error modes, error modes such as control failure (22.2%), wrong object (18.5%), omission (14.8%), wrong action (11.1 %), and inadequate (8.3%) take up about 75% of the total unplanned trip events. The analysis of the cognitive functions involved in the events indicated that the planning function had the highest contribution (46.7%) to the human actions leading to unplanned reactor trips. This analysis concludes that in order to significantly reduce human-induced or human-related unplanned reactor trips, an aide system (in support of maintenance personnel) for evaluating possible (negative) impacts of planned actions or erroneous actions as well as an appropriate human error prediction technique, should be developed.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.43 no.1
• /
• pp.70-78
• /
• 2020

Under the situation which customer orders are cancelled unless all products in the order are delivered all at once, this paper concentrates on the purchase dependent demands and explores the systematic approach to implant the purchase dependence into the multi-product inventory model. First, by acknowledging that it is a challenging task to formulate a suitable inventory model for the purchase dependence, we derive the optimal solution condition using an EOQ model and extend the optimal solution condition to periodic review models. Then, through the comparison simulation of four inventory policies regarding several degrees of purchase dependence, we demonstrate that the inventory models which consider the purchase dependence generate less total cost than the inventory models which ignore the purchase dependence. In general, the inventory models which consider the purchase dependence reduce the loss of sales by maintaining more inventories, which results in reducing the total cost. Consequently, the simulation result supports the effectiveness of this paper's approach. In addition, this paper uses the individual order period and joint order period obtained from the EOQ model for the multi-product inventory model. Through the in-depth analysis of comparing the two models, we observe that the model of using the joint order period produces less total cost when the degree of purchase dependence is high, but the model of using the individual order period produces less total cost when the degree of purchase dependence is low.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.4
• /
• pp.304-308
• /
• 2009

This paper presents the deadline driven CPU-Power management scheme for the Real-Time Embedded OS: named TMO-eCos. It used the scheduling scenarios generated by a task serialization technique for hard real- time TMO system. The serializer does a off-line analysis at design time with period, deadline and WCET of periodic tasks. Finally, TMO-eCos kernel controls the CPU speed to save the power consumption under the condition that periodic tasks do not violate deadlines. As a result, the system shows a reasonable amount of power saving. This paper presents all of these processes and test results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.4A
• /
• pp.352-360
• /
• 2008

Recently Task Group (TG) 4 of the Institute of Electrical and Electronics Engineers (IEEE) 802.15a has been recommended a system with ranging capability in existence of multiple Simultaneous operating piconets (SOPs) as well as low-cost, low-power. According to the ranging service, coherent and non-coherent based ranging schemes using ternary code have been adopted as a standard. However it is hard to estimate an accurate time of arrival (TOA) in case of using direct sequence based TOA estimation method because pulse repetition interval (PRI) offered by TG is more limited than the maximum excess delay (MED) of channel. To mitigate inter pulse interference (IPI) problem, this paper proposes a non-coherent TOA estimation scheme using non-periodic transmission (NPT) pattern. The proposed receiver is based on a non-coherent energy detection considering with motivation of low rate wireless personal area network (LR-WPAN). TOA information is estimated via proper comparison with a prescribed threshold after the sliding correlation and search back window (SBW) process for reducing TOA error. To verify the performance of proposed ranging scheme, two distinct channel models approved by IEEE 802.15.4a TG are considered. According to the simulation results, we could conclude that the proposed scheme have performed better performance than the conventional method on the existence of multiple SOPs.

• Journal of the Ergonomics Society of Korea
• /
• v.28 no.3
• /
• pp.49-54
• /
• 2009

Visual occlusion method is a visual demand measuring technique which uses periodic vision/occlusion cycle to simulate driving environment. It became one of the most popular techniques for the evaluation of in-vehicle interfaces due to its robustness and cost-effectiveness. However, it has a limitation in that the vision/occlusion cycle forces the user to use the IVIS at a predetermined pace, while a driver decides when to use the device on his/her own in actual driving. This paper proposes a user-driven visual occlusion method for measuring the visual demand of in-vehicle interfaces. An experiment was conducted to examine the visual demand of an in-vehicle interface prototype using both the existing (system-driven) occlusion method and the proposed (user-driven) one. Two in-vehicle tasks were evaluated: address input and radio tuning. The results showed that, for the radio tuning task, there were significant differences in total shutter open time and resumability ratio between the methods. The user-driven visual occlusion method not only allows a better representation of drivers' behavior, but it also seems to provide more information on the chunkability of a task.

• International Journal of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.134-142
• /
• 2021

This paper proposes a probabilistic method in analyzing timing measurements to determine the periodicity of real-time tasks. The proposed method fills a gap in existing techniques, which either concentrate on the estimation of worst-case execution times, or do not consider the stochastic behavior of the real-time scheduler. Our method is based on the Z-test statistical analysis which calculates the probability of the measured period to fall within a user-defined standard deviation limit. The distribution of the measured period should satisfy two conditions: its center (statistical mean) should be equal to the scheduled period of the real-time task, and that it should be symmetrical with most of the samples focused on the center. To ensure that these requirements are met, a data adjustment process, which omits any outliers in the expense of accuracy, is presented. Then, the Z-score of the distribution according to the user-defined deviation limit provides a probability which determines the periodicity of the real-time task. Experiments are conducted to analyze the timing measurements of real-time tasks based on real-time Linux extensions of Xenomai and RT-Preempt. The results indicate that the proposed method is able to provide easier interpretation of the periodicity of real-time tasks which are valuable especially in comparing the performance of various real-time systems.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.11
• /
• pp.573-580
• /
• 2001

When tasks access shared resources in real-time systems, the unbounded priority inversion may occur. In such cases it is impossible to guarantee the schedulability of real-time tasks. Several resource access protocols have been proposed to bound the duration of priority inversion and sufficient conditions are given to guarantee the schedulability of periodic task set. In this paper, we show an improved sufficient condition for schedulability when the dynamic priority ceiling protocol is used. Our approach exploits the fact that a lower priority task can continue to execute as far as the higher priority tasks do not miss their deadlines. This permitting execution time of the higher priority tasks for a lower priority task can be excluded from the worst-case blocking time of the higher priority tasks. Since the worst-case blocking time of tasks can be reduced, the sufficient condition for schedulability of dynamic priority ceiling protocol becomes further tight.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10b
• /
• pp.1150-1155
• /
• 1990

This paper proposes an optimal redundancy resolution of a kinematically redundant manipulator while considering homotopy classes. The necessary condition derived by minimizing an integral cost criterion results in a second-order differential equation. Also boundary conditions as well as the necessary condition are required to uniquely specify the solution. In the case of a cyclic task, we reformulate the periodic boundary value problem as a two point boundary value problem to find an initial joint velocity as many dimensions as the degrees of redundancy for given initial configuration. Initial conditions which provide desirable solutions are obtained by using the basis of the null projection operator. Finally, we show that the method can be used as a topological lifting method of nonhomotopic extremal solutions and also show the optimal solution with considering the manipulator dynamics.