• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.6
• /
• pp.635-645
• /
• 2003

One of very important features that are necessarily supported by clustered parallel computer systems is a single I/O system image in which users can access both the local and remote I/O resources transparently. In this paper, we propose an efficient disk sharing technique supporting a single disk I/O system image architecture. The design separates the I/O subsystem of a cluster into the file system and a set of virtual hard disk drivers. The virtual hard disk driver deals with a hard disk in the remote node as a local hard disk. All services provided by it are performed in the device driver level without any modification of file systems. Users can, therefore, access all the disks in the cluster regardless of their locations. Our virtual hard disk driver is implemented under the linux, and also tested in a linux cluster system. We find by experiments that it can successfully support a single disk I/O space, and at the same time it shows better performance than NFS. We are sure that this paper can be a guideline for single I/O space of other devices to be easily constructed.

• Annual Conference of KIPS
• /
• 2012.11a
• /
• pp.537-539
• /
• 2012

영상신호처리와 같이 공간적 신호처리를 하는 실시간 신호처리시스템에서는 서로 다른 입출력 순서를 갖는 특정 크기의 블록 단위 신호처리가 요구된다. 다양한 영상압축코덱에 쓰이는 엔트로피 코딩을 위한 데이터 재정렬이 대표적인 예이다. 이 경우 동일 주소에 데이터를 읽고 쓰는 단일 버퍼링 방법이 저장 공간을 최소화 하는 최적의 방법이지만 상이하고 불규칙한 입출력 순서를 갖는 경우 이 방법을 적용할 경우 불규칙한 순서열이 이어지기 때문에 구현하기 어렵고 두 배의 저장 공간을 소모하는 이중 버퍼링 방법을 주로 사용한다. 본 논문에서는 불규칙한 순서열 변화를 보이는 임의의 상이한 입출력 순서를 갖는 동시 입출력 동작에서도 예측가능한 유한한 횟수 안에 규칙적인 반복성이 나타남을 입증하고 자원을 최소화하는 단일 버퍼링 방법이 적용될 수 있음을 보였다.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.4
• /
• pp.73-79
• /
• 2007

In this paper the proposed transactor is customized and a generator which roles of automatically generating the transactor according to DUT(Design Under Test)'s input and output is implemented. The customized transactor is designed by rearranging the signals of depending on DUT and transactor protocol which consists of signals of the PCI interface between host computer and FPGA(Field Programmable Gate Array). The implemented automatic generator of transactor generates a Verilog code of transactor by adding DUT's information about input and output ports. Performance and normal working of the generated transactor has been verified by experiments with some verified hardware IPs. Also, an efficiency of the transactor has been verified by comparing with user's manually designed transactor and generated transactor. Moreover, the generator's flexibility has been verified for DUT's information of variable input and output. In case of using the implemented generator, a design time of transactor is reduced.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.886-888
• /
• 2005

고품질의 확장성 있는 서비스를 제공함으로써 다수의 사용자의 요청을 처리하고 시스템을 견고하게 유지할 수 있는 인터넷 서버를 구현하기 위한 한 가지 방법은 비동기 입출력 기능(AIO)을 이용하는 것이다. 기존의 고전적인 입출력 방식인 poll()/select()에 비해 AIO는 CPU 부하를 비롯한 시스템 자원의 낭비를 줄일 수 있으며, 입출력 완료를 기다리면서 블록되지 않으므로 시스템 부하를 감소할 수 있다. 본 논문에서는 리눅스 커널에 구현되어 있는 파일 기반 AIO기능을 네트워크 소켓 상에서 동작할 수 있도록 확장 구현하였으며, 그 구조에 대하여 자세히 설명하였다. 또한 클라이언트-서버 구조를 모델링한 실험을 통해 기존 메커니즘과의 성능 차이를 비교하였다.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.9
• /
• pp.2294-2304
• /
• 1999

Our research purpose in this paper is to improve the performance of query processing in GIS(Geographic Information System) by enhancing the I/O performance exploiting parallel I/O and efficient disk access. By packing adjacent spatial data, which are very likely to be referenced concurrently, into one block or continuous disk blocks, the number of disk accesses and the disk access overhead for query processing can be decreased, and this eventually leads to the I/O time decrease. So, in this paper, we proposes EPR(Enhanced Parallel R-tree) indexing method which integrates the parallel I/O method of the previous Parallel R-tree method and a packing-based clustering method. The major characteristics of EPR method are as follows. First, EPR method arranges spatial data in the increasing order of proximity by using Hilbert space filling curve, and builds a packed R-tree by bottom-up manner. Second, with packing-based clustering in which arranged spatial data are clustered into continuous disk blocks, EPR method generates spatial data clusters. Third, EPR method distributes EPR index nodes and spatial data clusters on multiple disks through round-robin striping. Experimental results show that EPR method achieves up to 30% or more gains over PR method in query processing speed. In particular, the larger the size of disk blocks is and the smaller the size of spatial data objects is, the better the performance of query processing by EPR method is.

• Annual Conference of KIPS
• /
• 2000.10a
• /
• pp.625-628
• /
• 2000

선반입 및 캐슁에 관한 기법은 병렬 파일 시스템 등의 저장 장치의 입출력 성능을 개선하는 효과적인 방법으로써 현재까지 여러 가지 연구가 많이 이루어져 왔다. 특히 선반입 기법은 응용프로그램에서 사용할 데이터 블록을 디스크로부터 미리 가져옴으로써 실제 필요할 때의 디스크 입출력 횟수를 줄여 실행 시간을 단축시키는 방법이다. 본 논문에서는 리눅스 기반의 병렬 파일 시스템 상에서 선반입 되는 블록의 수를 제한하여 캐쉬의 효율성을 높이고 실행 시간을 단축시키는 선반입 기법을 구현하였다. 특히 순차적인 접근을 하는 대용량 파일에서 그 성능이 개선됨을 보여 준다.

• KIISE Transactions on Computing Practices
• /
• v.22 no.10
• /
• pp.497-503
• /
• 2016

Emerging next-generation storage technologies such as non-volatile memory will help eliminate almost all of the storage latency that has plagued previous storage devices. In conventional storage systems, the latency of slow storage devices dominates access latency; hence, software efficiency is not critical. With low-latency storage, software costs can quickly dominate memory latency. Hence, researchers have proposed the memory mapped file I/O to avoid the software overhead. Mapping a file into the user memory space enables users to access the file directly. Therefore, it is possible to avoid the complicated I/O stack. This minimizes the number of user/kernel mode switchings. In addition, there is no data copy between kernel and user areas. Despite of the benefits in the memory mapped file I/O, its overhead still needs to be addressed, as the existing mechanism for the memory mapped file I/O is designed for slow block devices. In this paper, we identify the overheads of the memory mapped file I/O via experiments.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.7
• /
• pp.657-668
• /
• 2008

Traditional off-the-shelf file server has several potential drawbacks to store data blocks. A first drawback is a lack of practical de-duplication consideration for storing data blocks, which leads to worse storage capacity waste. Second drawback is the requirement for high performance computer system for processing large data blocks. To address these problems, this paper proposes a clustering backup system that exploits file fingerprinting mechanism for block-level de-duplication. Our approach differs from the traditional file server systems in two ways. First, we avoid the data redundancy by multi-level file fingerprints technology which enables us to use storage capacity efficiently. Second, we applied a cluster technology to I/O subsystem, which effectively reduces data I/O time and network bandwidth usage. Experimental results show that the requirement for storage capacity and the I/O performance is noticeably improved.

• Journal of KIISE
• /
• v.44 no.10
• /
• pp.1005-1018
• /
• 2017

Recently, virtualization has become an essential component of cloud computing due to its various strengths, including maximizing server resource utilization, easy-to-maintain software, and enhanced data protection. However, since virtualization allows sharing physical resources among the VMs, the system performance can be deteriorated due to device contentions. In this paper, we first investigate the I/O overhead based on the number of VMs on the same server platform and analyze the block I/O process of the KVM hypervisor. We also propose an in-memory block cache mechanism, called QBic, to overcome I/O virtualization latency. QBic is capable of monitoring the block I/O process of the hypervisor and stores the data with a high access frequency in the cache. As a result, QBic provides a fast response for VMs and reduces the I/O contention to physical devices. Finally, we present a performance measurement of QBic to verify its effectiveness.

• Journal of Korea Society of Industrial Information Systems
• /
• v.14 no.4
• /
• pp.8-15
• /
• 2009

Relay-assisted multi-input multi-output (MIMO) technique has become a promising candidate for next generation broadband wireless communications for high speed access. In this paper, we propose channel selective relay-based MIMO transmission system. The performance of relay-based system can be improved by using the subcarriers selectively based on the channel condition between relay and mobile station. Simulation results show that the proposed relay-based system considerably outperforms the conventional relay-based system.