• The Journal of the Korea Contents Association
• /
• v.11 no.3
• /
• pp.26-35
• /
• 2011

In these days, internet environment are very quickly development as well on-line service have been using a online for the mission critical business around the world. As the amount of information to be processed by computers has recently been increased there has been cluster computing systems developed by connecting workstations server using high speed networks for high availability. but cluster computing technology are limited for a lot of IT resources. So, grid computing is an expanded technology of distributed computing technology to use low-cost and high-performance computing power in various fields. Although the purpose of Grid computing focuses on large-scale resource sharing, innovative applications, and in some case, high-performance orientation, it has been used as conventional distributed computing environment like clustered computer until now because grid middleware does not have common sharable information system. In order to use grid computing environment efficiently which consists of various grid middleware, it is necessary to have application-independent information system which can share information description and services, and expand them easily. This paper proposed new database architecture and load balancing for high availability through Grid technology.

• Journal of KIISE:Software and Applications
• /
• v.30 no.5_6
• /
• pp.529-539
• /
• 2003

Due to the emersion of J2EE (Java 2, Enterprise Edition), many enterprises inside and outside of the country have been developing the enterprise applications appropriate to the J2EE model. With the help of the component model of Enterprise JavaBeans (EJB) which is the J2EE core technology, we can develop the distributed object applications quite simple. EJB application can be implemented by using the component-oriented object transaction middleware and the most applications utilize the distributed transaction. Due to these characteristics, EJB technology became popular and then the study for EJB based application has been done quite actively. However, the research of techniques for the performance monitoring during run-time of the EJB applications has not been done enough. In this paper, we propose the techniques for monitoring the performance of EJB Application on the run time. First, we explore the workflow for the EJB application service and classily the internal operation into several elements. The proposed techniques provide monitoring the performance elements between the classified elements. We can also monitor by extracting the performance information like state transition and process time of the bean which is related to the lifetime occurred during one workflow, and the resource utilization rate.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.5
• /
• pp.799-806
• /
• 2020

The rapid growth of smartphone-to-Internet of Things (IoT) connections and the explosive demand for data usage centered on mobile video are increasing day by day, and this increase in data usage creates many problems in the IP system. In a full-based environment, in which information requesters focus on information providers to receive information from specific servers, problems arise with bottlenecks and large data processing. To address this problem, CCN networking technology, a future network technology, has emerged as an alternative to CCN networking technology, which reduces bottlenecks that occur when requesting popular content through caching of intermediate nodes and increases network efficiency, and can be applied to military information and communication networks to address the problem of traffic concentration and the use of various surveillance equipment in full-based networks, such as scientific monitoring systems, and to provide more efficient content.

• Journal of KIISE
• /
• v.44 no.1
• /
• pp.13-20
• /
• 2017

A message processor is server software that receives various message formats from clients, creates the corresponding threads to process them, and lastly delivers the results to the destination. Considering that each function of an SEDA-based message processor has its own characteristics such as CPU-bound or IO-bound, this paper proposes a thread-mapping strategy called "FC-TM" (function-characteristic aware thread mapping) that schedules the threads to the cores based on the function characteristics in multi-core environments. This paper assumes that message-processor functions are static in the sense that they are pre-defined when the message processor is built; therefore, we profile each function in advance and map each thread to a core using the information in order to maximize the throughput. The benchmarking results show that the throughput increased by up to a maximum of 72 % compared with the previous studies when the ratio of the IO-bound functions to the CPU-bound functions exceeds a certain percentage.

• The KIPS Transactions:PartA
• /
• v.10A no.6
• /
• pp.635-642
• /
• 2003

The radical development of recent network technology provides the basic foundation which can establish a high speed and cheap cluster system. It is a general trend that conventional cluster systems are built as the system over a fixed level based on stabilized and high speed local networks. A multi-distributed web cluster group is a web cluster model which can obtain high performance, high efficiency and high availability through mutual cooperative works between effective job division and system nodes through parallel performance of a given work and shared memory of SC-Server with low price and low speed system nodes on networks. For this, multi-distributed web cluster group builds a sub-cluster group bound with single imaginary networks of multiple system nodes and uses the web distributed shared memory of system nodes for the effective data transmission within sub-cluster groups. Since the presented model uses a load balancing and parallel computing method of large-scale work required from users, it can maximize the processing efficiency.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.367-374
• /
• 2001

Recently, LINUX cluster file systems based on the storage area network (SAN) have been developed. In those systems, without using a central file server, multiple clients sharing the whole disk storage through Fibre Channel can freely access disk storage and act as file servers. Accordingly, they can offer advantages such as availability, load balancing, and scalability. In this paper, we describe metadata management schemes designed for a new SAN-based LINUX cluster file system. First, we present a new inode structure which is better than previous ones in disk block access time. Second, a new directory structure which uses extendible hashing is described. Third, we describe a novel scheme to manage free disk blocks, which is suitable for very large file systems. Finally, we present how we handle metadata journaling. Through performance evaluation, we show that our proposed schemes have better performance than previous ones.

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.12
• /
• pp.497-504
• /
• 2018

This paper studies about the Oriental Medical Expert System, based on Open Source Drools for rule engine processing, which contains scalability, availability, and modifiability. The system is developed with the Spring MVC framework and Ajax for stable services of the Web-based Medical Expert System. The diagnosis and treatment process of this Medical Expert system provides a service that provides the general users to accesses the web with a series of questionnaires. In order to compensate for the asynchronous communication between clients and services, and also for the complicated JDBC weaknesses, we applied the data handling in JSON to reduce the servers' loads, and also the Mybatis framework to improve the performance of the RDBMS, respectively. In addition, as the number of users increases to cope with the maximum available services of the web-based system, the load balancing structure using Nginx has been developed to solve the server traffic problems and the service availability has been increased. The experimental results show the stable services by approving the scalability test.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.04a
• /
• pp.210-213
• /
• 2010

최근 사용자의 멀티미디어에 대한 요구의 증가가 VOD (Video-on-Demand) 서비스를 발전시키게 되었다. VOD는 엔터테인먼트나 원격 교육, 광고 및 정보 등 많은 분야에서 사용되고 있다. 이러한 VOD 서비스는 많은 디스크 I/O와 네트워크 I/O를 요구하며 기존 웹 서버 시스템과 비교했을 때 오랜 시간동안 서비스를 해야 하는 특징을 가지고 있다. 또한 VOD 서비스는 많은 네트워크와 디스크의 대역폭을 요구하며, 서비스의 QoS에 민감해서 사용자 응답시간이 길어지면 사용자 요청의 취소율이 높아지게 된다. 따라서 불만족스러운 서비스의 증가로 네트워크 부하만 증가하게 된다. 이러한 기존 웹 서버 환경과는 다른 부하의 패턴이 있는 VOD 서비스 환경에서는 부하를 균형적으로 분배하여 서비스의 QoS를 높이는 것이 매우 중요하다. 본 논문에서는 분산 VOD 시스템 환경에서 부하를 효율적으로 분산하기 위해 계층형 분산 VOD 시스템 모델과 사용자 요청 패턴의 히스토리와 유전 알고리즘을 기반으로 한 스케줄러를 제안한다. 본 논문에서 제안한 계층형 분산 VOD 시스템 모델은 서버들을 지역적으로 분산하고 제어 서버를 지역마다 설치하여 지역에 있는 VOD 서버들을 관리하도록 구성한다. 사용자 요청을 지역 서버군 내에서 분산시키기 위해서 히스토리를 기반으로 한 유전 알고리즘을 사용한다. 이러한 히스토리 정보를 기반으로 유전 알고리즘의 적합도 함수에 적용하여 VOD 시스템을 위한 유전 알고리즘과 유전 연산을 구현한다. 본 논문에서 제안한 부하 분산 알고리즘은 VOD 서비스 환경에서 사용자 요구에 대한 부하를 보다 정확하게 예측하여 부하를 분산할 수 있다. 본 논문에서 제안한 계층형 분산 VOD 시스템의 부하 분산 알고리즘의 성능을 테스트하기 위해 OPNET 기반 시뮬레이터를 구현한다. 라운드로빈(round-robin) 방식과 랜덤(random) 방식과의 비교 실험을 통해 본 논문에서 제안한 부하 분산 알고리즘의 성능을 평가한다. 비교 실험을 통해 본 논문에서 제안한 알고리즘이 보다 안정적인 QoS를 제공하는 것을 보여준다.

• Journal of KIISE:Software and Applications
• /
• v.29 no.12
• /
• pp.907-925
• /
• 2002

Due to the emersion of J2EE(Java 2, Enterprise Edition), many enterprises inside and outside of the country have been developing the enterprise applications appropriate to the J2EE model. With the help of the component model of Enterprise Java Beans(EJH) which is the J2EE core technology, we can develop the distributed object applications quite simple. EJB application can be implemented by using the component-oriented object transaction middleware and the most applications utilize the distributed transaction. EJB developers can concentrate on the business logic because the EJB server covers the middleware service. Due to these characteristics, EJB technology became popular and then the study for EJB based application has been done quite actively However, the research of metrics for measuring the performance during run-time of the EJB applications has not been done enough. Tn this paper, we explore the workflow for the EJB application service on the run-time and classify the internal operation into several elements. We propose the metrics for evaluating the performance up to the bean level by using the classified elements. First, we analyze the lifecycle according to the bean types which comes from the EJB application on the run-time as to extract each factor used in performance measurement. We also find factors related to a performance and allocate the Performance factors to the metrics as the bean types. We also consider the characteristics like the bean's activation and message passing which happens during bean message call and then analyze the relations of the beans participating in the workflow of the application to make the workflow performance measurement possible. And we devise means to bring performance enhancement of the EJB application using the propose.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.11
• /
• pp.2251-2259
• /
• 2009

We propose an algorithm and system which generates 3D stereo image by composition of 2D image from 4 multiple clusters which 1 cluster was composed of 4 multiple cameras based on network. Proposed Schemes have a network-based client-server architecture for load balancing of system caused to process a large amounts of data with real-time as well as multiple cluster environments. In addition, we make use of JPEG compression and RAM disk method for better performance. Our scheme first converts input images from 4 channel, 16 cameras to binary image. And then we generate 3D stereo images after applying edge detection algorithm such as Sobel algorithm and Prewiit algorithm used to get disparities from images of 16 multiple cameras. With respect of performance results, the proposed scheme takes about 0.05 sec. to transfer image from client to server as well as 0.84 to generate 3D stereo images after composing 2D images from 16 multiple cameras. We finally confirm that our scheme is efficient to generate 3D stereo images in multiple view and multiple clusters environments with real-time.