• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1997.10a
• /
• pp.193-196
• /
• 1997

A mobile computing environment has many difference in character from conventional communication over wired network. These include very presents distributed design system based the mobile agent for mobile computing environment. To integrate design resource, we presented ISA(Integration Service Agent, which allows a designer to build integrated application using distributed resources, and to collaborative by exchanging service. Also we propose ICM(XML based Intelligent Connection Manger) using mobile agent. And suggested new intelligent data and process transfer architecture using ICM to implement an agent based design system in mobile environment.

• 한국전산유체공학회:학술대회논문집
• /
• 2006.05a
• /
• pp.121-125
• /
• 2006

CFD has been used in aircraft development and broaden its influence in various fields of industries. This paper briefly introduces the historical trends of computing system, the overview of CFD applications in Korean Supersonic Trainer Development Program and the demand for CFD software in industry points of view.

• Journal of Digital Contents Society
• /
• v.14 no.4
• /
• pp.505-511
• /
• 2013

Recently, cloud computing is being emerged paradigm that a support computing resource flexible and scalable to users as the want in distributed computing environment. Actually, cloud computing can be implemented and provided by virtualization technology. In this paper, we studied open source based cloud computing and built a educational practice system through cloud computing. Virtualization-based cloud computing provides optimized computing resources, as well as easy to manage practical resource and result. Therefore, we can save the time for configuration of practice environment. In the view of faculty, they can easily handle the practice result. Also, those practice condition reuse comfortably and apply to various configuration simply. And then we can increase capabilities and availabilities of limited resources.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.39 no.4
• /
• pp.19-31
• /
• 2014

We study parallel processing techniques for the R programming language of high performance computing technology. In this study, we used massively parallel computing system which has 25,408 cpu cores. We conducted a performance evaluation of a distributed memory system using MPI and of a the shared memory system using OpenMP. Our findings are summarized as follows. First, For some particular algorithms, parallel processing is about 150 times faster than serial processing in R. Second, the distributed memory system gets faster as the number of nodes increases while shared memory system is limited in the improvement of performance, due to the limit of the number of cpus in a single system.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.4 s.32
• /
• pp.221-231
• /
• 2004

Ubiquitous computing is not radical as Mark Weiser argues and includes things. The status of each nation is as follows. Project of America or Europe are practice for computing infra. intelligence of things and space and man-computer co-relation study, otherwise Japan centers the studying of network ubiquity utilizing computing competence. In this thesis I analyzed real status on the ubiquitous computing case study of each nation. and I proposed computing development model. factor, structured value system. five type business and technology model.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2019.01a
• /
• pp.5-6
• /
• 2019

Edge Computing에서 발생하는 데이터 분석에 대한 알고리즘의 성능 평가나 검증은 필수적이다. 이러한 평가 및 검증을 위해서는 비교 가능한 데이터가 필요하다. 본 논문에서는 Edge Computing에서 발생하는 데이터에 대한 분석 결과 및 Computing Resource에 대한 성능평가를 위해 Cloud 기반의 빅 데이터 분석시스템을 구축한다. Edge Computing 비교분석 빅 데이터 시스템은 실제 IoT 노드에서 Edge Computing을 수행할 때와 유사한 환경을 Cloud 상에 구축하고 연구되는 Edge Computing 알고리즘을 Data Analysis Cluster Container에 탑재해 분석을 시행한다. 그리고 분석 결과와 Computing Resource 사용률 데이터를 기존 IoT 노드 Edge Computing 데이터와 비교하여 개선점을 도출하는 것이 본 논문의 목표이다.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.2429-2432
• /
• 2000

Adaptive filter algorithm has been used for plant identifier and noise cancellation. This algorithm has been researched for performance enhancement of filtering. The design and development of a reliable system has been becoming a key issue in industry field because the reliability of a system is considered as an important factor to perform the system's function successfully. And the computing with reliability and fault tolerance is a important factor in the case of aviation and nuclear plant. This paper presents design of reliable adaptive filter with fault tolerance. Generally, redundancy is used for reliability. In this case it needs computing or circuit for voting mechanism or computing for fault detection or switching part. But this presented Filter is not in need of computing for voting mechanism, or fault detection. Therefore it has simple computing, and practicality for application. And in this paper, reliability of adaptive filter is analyzed. The effectiveness of the proposed adaptive filter is demonstrated to the case studies of plant identifier and noise cancellation by using DSP.

• International Journal of Computer Science & Network Security
• /
• v.21 no.2
• /
• pp.158-170
• /
• 2021

Virtualization technologies are being adopted and broadly utilized in many fields and at different levels. In cloud computing, achieving load balancing across large distributed virtual machines is considered a complex optimization problem with an essential importance in cloud computing systems and data centers as the overloading or underloading of tasks on VMs may cause multiple issues in the cloud system like longer execution time, machine failure, high power consumption, etc. Therefore, load balancing mechanism is an important aspect in cloud computing that assist in overcoming different performance issues. In this research, we propose a new approach that combines the advantages of different task allocation algorithms like Round robin algorithm, and Random allocation with different threshold techniques like the VM utilization and the number of allocation counts using least connection mechanism. We performed extensive simulations and experiments that augment different scheduling policies to overcome the resource utilization problem without compromising other performance measures like makespan and execution time of the tasks. The proposed system provided better results compared to the original round robin as it takes into consideration the dynamic state of the system.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06a
• /
• pp.317-318
• /
• 2008

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06a
• /
• pp.70-71
• /
• 2010