• The Journal of the Korea Contents Association
• /
• v.10 no.7
• /
• pp.81-87
• /
• 2010

This paper proposes a G-BLAST(BLAST using Grid Computing) system, an integrated software package for BLAST searches operated in heterogeneous distributed environment. G-BLAST employed 'database splicing' method to improve the performance of BLAST searches using exists computing resources. G-BLAST is a basic local alignment search tool of DNA Sequence using grid computing in heterogeneous distributed environment. The G-BLAST improved the existing BLAST search performance in gene sequence analysis. Also G-BLAST implemented the pipeline and data management method for users to easily manage and analyze the BLAST search results. The proposed G-BLAST system has been confirmed the speed and efficiency of BLAST search performance in heterogeneous distributed computing.

• Journal of Internet Computing and Services
• /
• v.4 no.6
• /
• pp.13-24
• /
• 2003

Grid technology requires use of geographically distributed resources from multiple domains. Resource monitoring services or tools consisting sensors or agents will run on many systems to find static resource information (such as architecture vendor, OS name and version, MIPS rate, memory size, CPU capacity, disk size, and NIC information) and dynamic resource information (CPU usage, network usage(bandwidth, latency), memory usage, etc.). Thus monitoring itself may cause system overhead. This paper proposes the optimal monitoring interval to reduce the cost of monitoring services and the dynamic monitoring interval to measure monitoring events accurately. By employing two features, we find out unnecessary system overhead is significantly reduced and accuracy of events is still acquired.

• The Journal of the Convergence on Culture Technology
• /
• v.6 no.1
• /
• pp.441-448
• /
• 2020

With help of Vehicle-to-Grid(V2G) technology battery in electric vehicle can be used as distributed energy resource and energy storage in a smart grid environment. Several problems of security vulnerability and privacy preservation can be occurred because V2G network supports 2 way communication among all components. This paper explains and makes analysis of architecture, privacy sensitive data, security vulnerability and security requirement of V2G system. Furthermore efficient architecture and operating scheme for V2G system are proposed. This scheme uses symmetric cryptosystem and hash algorithm to support privacy preservation and mutual authentication.

• The KIPS Transactions:PartC
• /
• v.12C no.7 s.103
• /
• pp.1015-1024
• /
• 2005

A delegation of privileges is one of important processes that empower authority to relevant node to process job that user wants in large-stale distributed environment such as Grid Computing. However, existing delegation methods do not give suitable privilege about Job, and do not atomize range of delegation and exists delegation of access privilege for only resources itself that is not delegation about executing process of job itself. Also, they do not apply about process that needs delegation before and after. execution of job such as reservation of system resources or host access before and after execution. Therefore, this paper proposes a method and specification for restricted delegation in distributed environment. Proposed method separates delegation for job side and privilege side, and express specification and procedure of delegation using XML schema and UML and present restricted delegation scenario in distributed computing environment.

• Journal of the Korea Society for Simulation
• /
• v.15 no.3
• /
• pp.11-21
• /
• 2006

Importance of and need for grid resource management have accelerated in accordance with increasing development of grid computing. However, it is very complex to distribute and utilize resources efficiently in geographically dispersed environments. This is due to the different access policies and constraints of grid resource owners. Users request resources according to their needs. Operators of a grid computing system need to be able to monitor the system states for reflecting these demands. So, a grid computing system needs a resource management policy that monitors states of resources and then allocates resources. This paper proposes a user demand-based grid trade management model that provides an efficient resource management by the trade allocation based on a users' demand and providers' supply strategy. To evaluate performance, this paper measures increasing rate of resource trades, average response time of trades, and processing time utilization. Firstly, the average increasing rates of trade are 585.7% and 322.6% higher than an auction model and a double auction model. Secondly, the average response time of the user demand-based grid trade management model is maintained between 3 and 5 simulation time. Finally, it is found that the processing time utilization is an average of 145.4% and 118.0% higher than an auction model and a double auction model. These empirical results demonstrate the usefulness of the user demand-based grid trade management model.

• Journal of Korea Society of Industrial Information Systems
• /
• v.9 no.1
• /
• pp.77-84
• /
• 2004

Recently, as the number of entities participating in the Grid system increased, the response time of LDAP system became inadequate. Consequently, we have to design new LDAP that suitable for high performance Grid environments. For this, researches about analysis of performance LDAP system are needed firstly. However, because researches are focused mostly on read operation optimized environments, so these result of researches are not directly applied to high performance Grid environments that write operation occupies most. In this paper, we provide overall results of analysis of performance of LDAP system with respect to number of node, query arrival rate, probability of read and so on. The analysis is based on in analytic performance model by applying the M/M/1 queuing model. Finally, based on the results, we suggest the direction for the design of high performance LDAP system and this research results can be applied as basic materials to design of GIS in high performance Grid environments as well as.

• The Journal of the Korea Contents Association
• /
• v.5 no.1
• /
• pp.189-199
• /
• 2005

The grid computing is a technique to solve big problems such as a field of scientific technique by sharing the computing power and a big storage space of the numerous computers on the distributed network. The environment of the grid computing is composed with the WAN which has a different performance and a heterogeneous network condition. Therefore, it is more important to reflect heterogeneous performance elements to calculation work. In this paper, we propose an efficient method that decides work process number of each node by considering a network state information. The network state information considers the latency, the bandwidth and latency-bandwidth mixture information. First, using information which was measured, we compute the performance ratio and decide work process number of each node. Finally, RSL file was created automatically based on work process number which was decided, and then accomplishes a work. The network performance information is collected by the NWS. According to experimental results, the method which was considered of network performance information is improved respectively 23%, 31%, and 57%, compared to the methods of existing in a viewpoint of work amount, work process number, and node number.

• Journal of Internet Computing and Services
• /
• v.8 no.3
• /
• pp.57-63
• /
• 2007

Providing the sufficient energy to the mobile device is essential to process the job in distributed wireless network. To solve the restrained conditions of energy problems of mobile devices, this paper suggests the efficient method of processing the distributed job using mobility management in wireless network. Energy consumption can be analyzed using the statistical model and required energy of processing the distributed job in mobile device can be predicted using the mobility management. Therefore, this paper suggests the reliable algorithm to process distributed job through the mobile devices with regular mobility and shows the efficiency of the suggested algorithm.

• Journal of Digital Convergence
• /
• v.14 no.4
• /
• pp.251-258
• /
• 2016

Big data processing is a broad term for processing data sets so large or complex that traditional data processing applications are inadequate. Widespread use of smart devices results in a huge impact on the way we process data. Many organizations are contemplating how to incorporate or integrate those devices into their enterprise data systems. We have proposed a way to process big data by way of integrating Raspberry Pi into a Hadoop cluster as a computational grid. We have then shown the efficiency through several experiments and the ease of scaling of the proposed system.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.767-770
• /
• 2014

대용량 데이터를 분석하기 위한 맵리듀스 기반 k-NN 조인 질의처리 알고리즘은 최근 데이터 마이닝 및 분석을 기반으로 하는 응용 분야에서 매우 중요하게 활용되고 있다. 그러나, 대표적인 연구인 보로노이 기반 k-NN 조인 질의처리 알고리즘은 보로노이 인덱스 구축 비용이 매우 크기 때문에 대용량 데이터에 적합하지 못하다. 아울러 보로노이 셀 정보를 저장하기 위해 사용하는 R-트리는 맵리듀스 환경의 분산 병렬 처리에 적합하지 않다. 따라서 본 논문에서는 새로운 그리드 인덱스 기반의 k-NN 조인 질의 처리 알고리즘을 제안한다. 첫째, 높은 인덱스 구축 비용 문제를 해결하기 위해, 데이터 분포를 고려한 동적 그리드 인덱스 생성 기법을 제안한다. 둘째, 맵리듀스 환경에서 효율적으로 k-NN 조인 질의를 수행하기 위해, 인접셀 정보를 시그니처로 활용하는 후보영역 탐색 및 필터링 알고리즘을 제안한다. 마지막으로 성능 평가를 통해 제안하는 기법이 질의 처리 시간 측면에서 기존 기법에 비해 최대 3배 높은 질의 처리 성능을 나타냄을 보인다.