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

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1387-1391
• /
• 2003

The fundamental aim of this paper is to present a solution algorithm to achieve cooperative contour controlling, under joint acceleration constraint with maximum cooperative speed. Usually, the specifications like maximum velocity of cooperative trajectory are determined by the application itself. In resolving the cooperative trajectory into two complementary trajectories, an optimum task resolving strategy is employed so that the task assignment for each robot is fair under the joint acceleration constraint. The proposed algorithm of being an off-line technique, this could be effectively and conveniently extended to the existing servo control systems irrespective of the computational power of the controller implemented. Further, neither a change in hardware setup nor considerable reconfiguration of the existing system is required in adopting this technique. A simulation study has been carried out to verify that the proposed method can be realized in the generation of complementary trajectories so that they could meet the stipulated constraints in simultaneous maneuvering.

• The Journal of Society for e-Business Studies
• /
• v.16 no.1
• /
• pp.71-100
• /
• 2011

There are expectations about future internet technology with IT development by end-users. Cloud computing is attracted to satisfy those demands. However, adoption of cloud computing is not active that much. Therefore, this study verified how cloud computing environment affects performance of team project. We conducted empirical study on performance of team project with cloud computing as technology tool focusing on Task-Technology Fit Model. We collected samples that were undergraduate and graduate school students and had experience on initial cloud computing such as Google-Docs and Webhard when they conducted team project for assignment. We focused on accessibility and reliability as task-technology fit and those variables treated as first order factor. Result showed that cloud computing is suitable technology tool for team project. This study suggests positive effects of cloud computing for collaboration by proving perceived fit and performance in initial cloud computing.

• The Journal of the Korea Contents Association
• /
• v.4 no.2
• /
• pp.50-60
• /
• 2004

Recently, most of the embedded system is required not only many functions but also real-time characteristics in purpose. In the hard real-time system, especially, strict deadline of periodic task can affect the performance of the system. In this paper, we design and implement the scheduler based on RM(Rate-Monotonic) rule. This scheduler makes feasible patterns based on EDF(Earliest deadline first) rule with extended schedulability inspection before execution, for periodic task-set that has high CPU utilization and then, execute periodic task-set depended on feasible patterns. The feasible pattern formed into EDF rule is capable of the efficiency of CPU up to 100 percentage and by the referenced execution of the feasible pattern is possible of removing the red-time scheduling overhead that is the defect of the order of dynamic assignment rule.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.3 s.303
• /
• pp.1-8
• /
• 2005

At IETF (Internet Engineering Task Force), recently RFC3775, RFC3776 documents about the mobile IPv6 were standardized by IETF (Internet Engineering Task Force). Those specifications propose that during the roaming, the mobile node sends securely the binding update to the home agent and the correspondent node after setting the security association between Mobile Node and Home Agent. But there is no secure bootstrapping method between a mobile node and a home agent at the two RFC documents. This paper proposed a method for the secure bootstrapping between a mobile node and a home agent. This makes the authentication, binding update, home agent assignment, security association distribution through the AAA-based secure channel between mobile node and home agent. And the proposed method was analyzed in the view of the procedure, round trip and security strength.

• Journal of Korea Society of Industrial Information Systems
• /
• v.26 no.5
• /
• pp.11-19
• /
• 2021

In this paper, we proposed an asymmetric multi-core processor scheduling scheme which is based on the mileage of each core. We considered a big-LITTLE multi-core processor structure, which consists of low power consuming LITTLE cores with general performance and high power consuming big cores with high performance. If a task needs to be processed, the processor decides a core type (big or LITTLE) to handle the task, and then investigate the core with the shortest mileage among unoccupied cores. Then assigns the task to the core. We developed a mileage-based balancing algorithm for asymmetric multi-core assignment and showed that the proposed scheduling scheme is more cost-effective compared to the traditional scheme from a management perspective. Simulation is also conducted for the purpose of performance evaluation of our proposed algorithm.

• Journal of Aerospace System Engineering
• /
• v.18 no.2
• /
• pp.56-63
• /
• 2024

As the safety of unmanned vehicles continues to improve, their usage in urban environments, which are full of obstacles such as buildings, is expected to increase. When numerous unmanned vehicles are operated in such environments, an algorithm that takes into account mutual collision avoidance, as well as static and dynamic obstacle avoidance, is necessary. In this paper, we propose an algorithm that handles task assignment and path planning. To efficiently plan paths, we construct a grid-based map and derive the paths from it. To enable quick re-planning in dynamic environments, we focus on reducing computational time. Through simulation, we explain obstacle avoidance and mutual collision avoidance in small-scale problems and confirm their performance by observing the entire mission completion time (Makespan) in large-scale problems.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.995-998
• /
• 2005

A task in imprecise computation consists of mandatory part and optional part. The optional part can be executed partially and the quality of service is measured by the amount of the execution. Many paper showed that multimedia systems are good applications of imprecise computation. It is important to guarantee QoS which is a critical factor in multimedia systems. Previous works didn't consider QoS and processor slack were assigned randomly to tasks. This paper presented a systemic slack assignment method according to QoS levels of tasks. A simulation result showed that our method can be a good choice for multimedia systems with QoS requirement.

• Journal of the Korean Society for Precision Engineering
• /
• v.19 no.11
• /
• pp.192-199
• /
• 2002

This paper demonstrates that hybrid neural-genetic multimodel parameter estimation algorithm can be applied to structured system Identification of electro-hydraulic servo system. This algorithm are consist of a recurrent incremental credit assignment (ICRA) neural network and a genetic algorithm. The ICRA neural network evaluates each member of a generation of model and genetic algorithm produces new generation of model. We manufactured electro-hydraulic servo system and the hybrid neural-genetic multimodel parameter estimation algorithm is applied to the task to find the parameter values(mass, damping coefficient, bulk modulus, spring coefficient) which minimize total square error.

• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.6
• /
• pp.442-447
• /
• 2003

This paper demonstrates that a modified hybrid neural-genetic multimodel parameter estimation algorithm can be applied to structured system identification of an electro-hydraulic servo system. This algorithm is consists of a recurrent incremental credit assignment(ICRA) neural network and a genetic algorithm. The ICRA neural network evaluates each member of a generation of model and genetic algorithm produces new generation of model. The modified hybrid neural-genetic multimodel parameter estimation algorithm is applied to an electro-hydraulic servo system the task to find the parameter values such as mass, damping coefficient, bulk modulus, spring coefficient and disturbance, which minimizes the total square error.