• Proceedings of the KAIS Fall Conference
• /
• 2009.05a
• /
• pp.796-799
• /
• 2009

NGS(Next Generation Storage) 시스템은 전형적인 분산파일 시스템 구조의 병목 현상을 제거하고 입출력 대역폭을 늘려 성능을 최대화 하기 위한 차세대 저장시스템으로 기존의 저장시스템과는 달리 DRAM을 기반으로 스토리지를 구성하고 있다. NGS 시스템의 대용량 지원 및 기업 내부에서의 활용을 위해서는 SAN 기반에서 활용할 수 있도록 설계되어야 하며, SAN 환경에서 성능 향상을 위한 연구가 필요하다. 본 논문에서는 NGS 시스템에 대한 성능평가 및 분산 환경에서 NGS 를 활용하기 위한 성능평가도구 개발을 기술한다. 성능 도구의 활용은 전형적인 전체 시스템 아키텍처 내의 병목 현상을 제거하고 입출력 대역폭을 늘려 성능을 최대화 할 수 있어야 한다.

• Communications of the Korean Institute of Information Scientists and Engineers
• /
• v.27 no.5
• /
• pp.86-94
• /
• 2009

• Communications of the Korean Institute of Information Scientists and Engineers
• /
• v.27 no.5
• /
• pp.77-85
• /
• 2009

• The KIPS Transactions:PartC
• /
• v.16C no.5
• /
• pp.597-604
• /
• 2009

An SMTP(Simple Mail Transfer Protocol) server was designed for delivering and storing user's email across a network. An SMTP server can be distributed as multiple servers for large service, huge users or massive emails. An SMTP server can be constructed by multiple servers with separating file system as email storing space, and each SMTP server can usually share each file system by using the NFS(Network File system). However the NFS is originally designed for sharing each file system across a network, and contains all attributes and features of regular file system. Using this NFS for email storing space of SMTP servers, it makes overhead due to unnecessary work of regular file system. In this paper, we propose a method to do directly operation with socket for reducing work overhead caused by the NFS. For doing directly operation with socket, this paper defines information based storing space structure and a protocol for storing emails. We performed experiments using Mailstone made by Netscape. The experimental results show the performance improvement of the proposed method compared to the existing method.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10a
• /
• pp.346-348
• /
• 2000

클라이언트 서버 환경에서 발생하는 많은 문제점, 특히 유지 보수의 기하급수적인 증가와 네트웍 트래픽의 증가 그리고 클라이언트와 서버 연동의 비표준화 등으로 인하여 최근 컴퓨터 패러다임은 분산 객체 클라이언트 서버 환경으로 바뀌고 있다. 이러한 분산 객체 시스템에서는 클라이언트와 서버 사이에 미들웨어를 둠으로써 클라이언트 서버 환경에서 발생하는 많은 문제점을 해결하였다. 본 논문에서는 이러한 분산 객체 시스템 하에서 최근 각광받고 있는 에이전트 기술을 이용하여 네트웍 상의 자원을 효율적으로 사용할 수 있도록 자원 공유 모델을 설계하였으며, 실제 구현은 CORBA를 기반으로한 지능형 에이전트를 이용한 원격 컴파일링을 프로토타입으로 구현하였다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.3
• /
• pp.193-204
• /
• 2006

In most existing distributed Web systems, incoming requests are distributed to servers via Domain Name System (DNS). Although such systems are simple to implement, the address caching mechanism easily results in load unbalancing among servers. Moreover, modification of the DNS is necessary to load considering the server's state. In this paper, we propose a new dynamic load balancing method using dynamic DNS update and round-robin mechanism. The proposed method performs effective load balancing without modification of the DNS. In this method, a server can dynamically be added to or removed from the DNS list according to the server's load. By removing the overloaded server from the DNS list, the response time becomes faster. For dynamic scheduling, we propose a scheduling algorithm that considers the CPU, memory, and network usage. We can select a scheduling policy based on resources usage. The proposed system can easily be managed by a GUI-based management tool. Experiments show that modules implemented in this paper have low impact on the proposed system. Furthermore, experiments show that both the response time and the file transfer rate of the proposed system are faster than those of a pure Round-Robin DNS.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.3
• /
• pp.691-699
• /
• 2011

Recently, diverse approaches retrieval services based on social network are suggested. Although existing recommendation systems can retrieve experts of specific fields, profiles and evaluations about experts that users want to be recommended are in a system. The proposed expert recommendation system can automatize collection of evaluation to evaluate experts and experts' profiles in separate systems by using the Knowledge Base and XMDR. We also attempt to construct system which can recommend a number of experts by dynamically constructing Social Network by using diverse resources distributed 로컬ly and composed of heterogeneous data sources. To resolve these problems efficiently, there is a need to provide constructed resources between heterogeneous systems with transparency and independence and provide users with a singular interface. Therefore, the proposed system in this paper uses Knowledge Base and XMDR for extracting distributed experts' profiles and designs expert recommendation system connecting Knowledge Base with Social Network.

• The KIPS Transactions:PartA
• /
• v.10A no.1
• /
• pp.15-24
• /
• 2003

In this paper, an optimization model for the clustered node allocation systems in the distributed computing environment is presented. In the presented model with a distributed file system framework, the dynamics of system behavior over times is carefully thought over the nodes and hence the functionality of the cluster monitor node to check the feasibility of the current set of clustered node allocation is given. The cluster monitor node of the node allocation system capable of distributing the parallel modules to clustered nodes provides a good allocation solution using Genetic Algorithms (GA). As a part of the experimental studies, the solution quality and computation time effects of varying GA experimental parameters, such as the encoding scheme, the genetic operators (crossover, mutations), the population size, and the number of node modules, and the comparative findings are presented.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.3
• /
• pp.421-429
• /
• 2006

Recently, DHT-based Structured P2P System have a attention to scalability and providing efficient lookup by routing. Retrieving content of DHT-based P2P require knowledge of the exact identifier of sharing file. But user may wish to search for sharing file using descriptive keyword or content. To resolve the problem, this paper propose Extended-CAN mechanism to support keyword search. We defined content-based keyword and identifier of sharing file, and PLS extended to KID and CKD for keyword, common keyword processing. As a result, Extended-CAN mechanism provide efficient keyword search for DHT-based Structured P2P System.

• Journal of KIISE:Software and Applications
• /
• v.30 no.1_2
• /
• pp.73-80
• /
• 2003

The Java programming language is designed for developing effective applications in a heterogeneous network environment. Major problem in Java is its performance. many attractive features of Java make the development of software easy, but also make it expensive to support ; applications written in Java are often much slower than their counterparts written in C or C++. To use Java`s attractive features without the performance penalty, sophisticated optimizations and runtime systems are required. Optimising Java bytecode has several advantages. First, the bytecode is independent of any compiler that is used to generate it. Second, the bytecode optimization can be performed as a pre=pass to Just-In-Time(JIT) compilation. Many attractive features of Java make the development of software easy, but also make it expensive to support. The goal of this work is to develop automatic construction of code optimizer for Java bytecode. We`ve designed and implemented a Bytecode Optimizer that performs the peephole optimization, bytecode-specific optimization, and method-inlining techniques. Using the Classfile optimizer, we see up to 9% improvement in speed and about 20% size reduction in Java class files, when compared to average code using the interpreter alone.