• KIISE Transactions on Computing Practices
• /
• v.21 no.1
• /
• pp.58-63
• /
• 2015

In this work, we present a novel fountain code-based hybrid P2P storage system that combines cloud storage with P2P storage. The proposed hybrid storage system minimizes data transmission time while guaranteeing high data retrieval and data privacy. In order to guarantee data privacy and storage efficiency, the user transmits encoded data after performing fountain code-based encoding. Also, the proposed algorithm guarantees the user's data retrieval by storing the data while considering each peer's survival probability. The simulation results show that the proposed algorithm enables fast completion of the upload transmission while satisfying the required data retrieval and supporting the privacy of user data under the system parameters.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06b
• /
• pp.419-424
• /
• 2010

기존의 스토리지 클래스 메모리와 플래시 메모리를 결합한 하이브리드 스토리지는 고정적인 공간의 스토리지 클래스 메모리를 사용하여서 I/O 패턴에 따라 공간적인 비효율성을 보여주었다. 본 논문에서는 데이터 패턴과, 데이터 접근 지역성에 따라 스토리지 클래스 메모리의 영역들이 적응적으로 변화하는 스토리지를 제시하고 있다. 시뮬레이션 결과 적응적 스토리지 클래스는 고정적 스토리지 클래스 메모리와 비교하여 iozone같은 경우 15.3%, postmark의 경우 13.1%의 공간 절감 효과를 보였다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2012.05a
• /
• pp.270-271
• /
• 2012

일반적인 네트워크 디지털 사이니지의 경우 모든 콘텐츠를 WAN상에 있는 대용량 스토리지에 보관을 하고 있으며, 필요한 멀티미디어 콘텐츠가 있을 경우 제한적인 로컬디스크에 다운로드 한 후에 재생 작업을 수행한다. 필요한 멀티미디어 콘텐츠의 신속한 확보를 위해 기존의 로컬디스크와 WAN 스토리지 사이에 콘텐츠 캐싱 기법을 포함하는 iSCSI 스토리지 계층이 추가된 하이브리드 스토리지 구조를 제안한다.

• Journal of Korea Multimedia Society
• /
• v.15 no.5
• /
• pp.651-663
• /
• 2012

Networked digital signage downloads necessary multimedia contents from a large-sized storage on WAN to its local disk of a limited size before starting their playback. If the required time to download the entire contents gets longer, a start time to play the contents at the digital signage could be delayed. In this paper, we propose a hybrid storage architecture that not only inserts an iSCSI storage layer between the existing local disk and the WAN storage, but offers a contents caching scheme in order to obtain all the necessary contents in digital signage rapidly. The proposed caching scheme determines how to place the downloaded contents both in the local disk and the iSCSI storage. Uniquely, the proposed caching scheme manages the iSCSI storage space by dividing it into two regions: (1) in one region, the digital signage can play the contents directly without downloading them into the local disk; (2) in the other region, the digital signage cannot. Performance evaluations on a simulator and an actual system with workloads of various contents show that a contents-downloading time of the hybrid storage architecture is at maximum three times shorter than that of the existing storage architecture.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.11 no.6
• /
• pp.611-618
• /
• 2016

The suggested paper studies communications network and system technology, designing data to sync to both USB memories and cloud storages at the same time, which would allow users to safely keep and manage data even in case of network troubles, affecting cloud storages, and/or loss of physical USB memories, resulting in lost data in the physical memory. The need of secure data management policy for cloud storage users form the basis of this study, offering solutions to network failures and loss of physical storage by creating hybrid cloud system. To provide convenience to windows users, the UI design should integrate that of windows explorer to maximize security and convenience.

• Proceedings of the Korea Contents Association Conference
• /
• 2016.05a
• /
• pp.485-486
• /
• 2016

이 논문에서는 비휘발성 메모리 (NVRAM)과 DRAM을 결합하여 고속의 신뢰성 있는 하이브리드 블록 스토리지를 개발한다. 기존의 DRAM을 기반으로 하는 리눅스의 RAM 디스크는 고속의 입출력성능을 제공하지만, 시스템 고장이 발행할 경우 모든 데이터를 잃어버리게 된다. 일부에서 DRAM과 하드디스크를 결합하여 시스템 고장에도 안정적으로 데이터를 유지하기 위한 방법이 제안된바 있지만, 입출력 성능이 RAM 디스크에 비해 상당히 저하된다. 이 논문에서는 DRAM, NVRAM, 하드디스크를 결합하여 DRAM의 입출력 성능에 가까우면서 안정적으로 데이터를 저장할수 있는 블록 스토리지를 개발한다.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.7
• /
• pp.113-130
• /
• 2014

In this paper, we propose BLOCS algorithm to find sequence of data that should be saved in cache device of hybrid storage system which uses SSD as a cache device. BLOCS algorithm which uses a sequence pattern mining scheme, creates a set of frequently requested sectors with respect to requested order of sectors. To compare the performance of the proposed scheme, we introduce Distance (DIST) based scheme, Request Frequency (FREQ) based scheme, and Frequency times Size (F-S) based scheme. We measure the hit ratio and I/O latency of different caching schemes using hybrid storage caching simulator. We acquired booting workload along with ten scenarios of launching applications and use the workloads as input to the cache simulator. After experiment with booting workload, we find that BLOCS scheme gives hit ratio of 61% which is about 15% higher than the least performing DIST scheme.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.16 no.1
• /
• pp.109-116
• /
• 2021

Since RDF (Resource Description Framework) triples are modeled as graph, we cannot directly adopt existing solutions in relational databases and XML technology. In order to store, index, and query Linked Data more efficiently, we propose a convergence indexing method combined R*-tree and K-dimensional trees. This method uses a hybrid storage system based on HDD (Hard Disk Drive) and SSD (Solid State Drive) devices, and a separated filter and refinement index structure to filter unnecessary data and further refine the immediate result. We perform performance comparisons based on three standard join retrieval algorithms. The experimental results demonstrate that our method has achieved remarkable performance compared to other existing methods such as Quad and Darq.

• Journal of KIISE
• /
• v.42 no.8
• /
• pp.947-953
• /
• 2015

PRAM is being considered as a potential successor to DRAM because of its characteristics such as byte-addressability, non-volatility, and high density. To gain its benefits, buffer cache replacement algorithm based on PRAM has been actively studied. However, most of the previous studies on buffer cache replacement algorithm limitedly exploit the byte-level performance of PRAM by focusing its limited lifetime and slower access latency compared to DRAM. In this paper, we propose a novel buffer cache replacement algorithm that fully considers the byte-level performance of PRAM and the performance of secondary storage. To take advantage of small size write on PRAM, proposed scheme keeps pages, which are frequently accessed with a small size write, on PRAM and allows the selective page migration from DRAM to PRAM. As a result, our scheme significantly reduces the number of PRAM writes. Our experimental results indicate for real workloads that our scheme reduces the number of PRAM writes by up to 92% and improves its performance by up to 62% compared to CLOCK.

• Proceedings of the KAIS Fall Conference
• /
• 2010.05a
• /
• pp.176-178
• /
• 2010

본 논문에서는 전통적인 RAID-1 미러링에 기반을 둔 헤테로-미러링이라는 하는 새로운 저장 장치 관리 기법을 제안한다. 헤테로-미러링 기반의 스토리지 관리는 SSD에서 발생 가능한 프리징 현상을 피하기 위한 쓰기-부하 밸런싱과 쓰기 지연 연산을 통하여 RAID-1 처리 성능을 개선한다.