• Journal of Digital Contents Society
• /
• v.14 no.1
• /
• pp.51-57
• /
• 2013

Storage device based on Flash Memory have many attractive features such as high performance, low power consumption, shock resistance, and low weight, so they replace HDDs to a certain extent. An Storage device based on Flash Memory has FTL(Flash Translation Layer) which emulate block storage devices like HDDs. A garbage collection, one of major functions of FTL, effects highly on the performance and the lifetime of devices. However, there is no de facto standard for new garbage collection algorithms. To solve this problem, we propose File Clustering Algorithm. File Clustering Algorithm respect to update page from same file at the same time. So, these are clustered to same block. For this mechanism, We propose Page Allocation Policy in FTL and use MIN-MAX GAP to guarantee wear leveling. To verify the algorithm in this paper, we use TPC Benchmark. So, The performance evaluation reveals that the proposed algorithm has comparable result with the existing algorithms(No wear leveling, Hot/Cold) and shows approximately 690% improvement in terms of the wear leveling.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.6
• /
• pp.57-64
• /
• 2010

Due to the limited storage space in video proxy server, it is often required to replace the old video data which is not serviced for long time with the newly requested video. This replacement causes the service delay and increase of network traffic. To circumvent this problem, we propose the an efficient replacement scheme in a video proxy server. In addition, we present a video data management technique for decreasing the number of replacement in video proxy server. For this purpose, we employ a memory in video proxy server. If the video segment which is loaded in memory is requested once again by a different user, this segment is resided in memory. The video in the memory is stored in the video proxy server depending on the consuming pattern by users. The simulation results show that the proposed algorithm performs better than other algorithms in terms of packet hit rate and number of packet replacement.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.1
• /
• pp.99-113
• /
• 2004

A new architecture called SAN(Storage Area Network) was developed in response to the requirements of high availability of data, scalable growth, and system performance. In order to use SAN more efficiently, most of SAN operating softwares support storage virtualization concepts that allow users to view physical storage devices attached to SAN as a large volume virtually h logical volume manager plays a key role in storage virtualization. It realizes the storage virtualization by mapping logical addresses to physical addresses. A logical volume manager also supports a snapshot that preserves a volume image at certain time and on-line reorganization to allow users to add/remove storage devices to/from SAN even while the system is running. To support the snapshot and the on-line reorganization, most logical volume managers have used table based mapping methods. However, it is very difficult to manage mapping table because the mapping table is large in proportion to a storage capacity. In this paper, we design and implement an efficient and flexible hybrid mapping method based on mathematical equations. The mapping method in this paper supports a snapshot and on-line reorganization. The proposed snapshot and on-line reorganization are performed on the reserved area which is separated from data area of a volume. Due to this strategy normal I/O operations are not affected by snapshot and reorganization. Finally, we show the superiority of our proposed mapping method through various experiments.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2010.06a
• /
• pp.153-154
• /
• 2010

최근 GPS를 이용한 위치기반서비스(LBS)는 일상생활의 큰 변화를 가져왔다. 이러한 LBS 중에서도 가장 흔히 접할 수 있는 것이 차량 항법용 장치인 네비게이션이다. 초창기의 네비게이션이 단순히 목적지까지 가기 위한 가장 짧은 도로를 안내해 주는 것이 목적이었다면 최근에는 TPEG과 같은 실시간 교통 상황 안내, 이용자 선호도를 고려한 경로탐색, 에코 드라이빙과 같은 좀 더 높은 수준의 서비스가 개발되고 있다. 하지만 현재의 차량항법 시스템은 교통상황 안내 이외에는 현실적인 도로상황 반영이 어렵고 시간대별 통행량의 차이가 큰 국내 교통상황에 대한 고려가 미흡하다. 또한 교통정보 수집장치가 설치되지 않은 도로는 교통상황 안내마저도 제공되지 않는다. 본 논문에서는 이러한 문제점을 개선하기 위하여 임베디드 DBMS를 이용하여 과거 통행이력정보를 저장하고 활용할 수 있도록 도로망 DB스키마를 정의하였다. 그리고 이를 탐색경로의 소요 시간 산출에 활용하여 실제적인 도로상황을 고려한 경로안내 방법을 제안한다. 실제주행이력은 네트워크 데이터의 링크단위로 관리되며 저장된 주행이력은 경로탐색에 필요한 정보인 진입시각, 진출시각, 요일, 통행횟수로 관리된다. 이렇게 단말기에 저장된 주행이력은 중앙DB를 통해 사용자간 공유가 가능하고 향후에는 실시간 동기화를 통해 더욱 신뢰도 높은 경로탐색에 활용될 수 있다.

• Journal of Internet Computing and Services
• /
• v.3 no.5
• /
• pp.73-85
• /
• 2002

A new architecture coiled the Storage Area Network(SAN) was developed in response to the requirements of high availability of data, scalable growth, and system performance, In order to use SAN more efficiently, most SAN operating system support storage virtualization concepts that allow users to view physical storage devices attached to SAN as a large volume virtually. A logical volume manager plays a key role in storage virtualization. It realizes the storage virtualization by mapping logical addresses to physical addresses, In this paper, we design and implement an efficient and flexible mapping method for logical volume manager. Additionally, to aid flexible mapping, we also design and implement free space management method, The mapping method in this paper supports a snapshot that preserves a volume image at certain time and on-line reorganization to allow users to add or remove storage devices to SAN even while the system is running.

• Journal of KIISE
• /
• v.41 no.12
• /
• pp.1026-1034
• /
• 2014

Recently, flash storages devices have become popular. Log-structured file systems (LFS) are suitable for flash storages since these can provide high write performance by only generating sequential writes to the flash device. However, LFS should perform garbage collections (GC) in order to reclaim obsolete space. Recently, a slack space recycling (SSR) technique was proposed to reduce the GC overhead. However, since SSR generates random writes, write performance can be negatively impacted if the random write performance is significantly lower than sequential write performance of the target device. This paper proposes a partial garbage collection technique that copies only a part of valid blocks in a victim segment in order to increase the size of the contiguous invalid space to be used by SSR. The experiments performed in this study show that the write performance in an SD card improves significantly as a result of the partial GC technique.

• Journal of KIISE
• /
• v.42 no.4
• /
• pp.427-433
• /
• 2015

The rapid advancement of computing technology has triggered the need for fast data I/O processing and high-performance storage technology. Next generation memory technology, which we refer to as new memory, is anticipated to be used for high-performance storage as they have excellent characteristics as a storage device with non-volatility and latency close to DRAM. This research proposes NTL (New memory Translation layer) as a technology to make use of new memory as storage. With the addition of NTL, conventional I/O is served with existing mature disk-based file systems providing compatibility, while new memory I/O is serviced through the NTL to take advantage of the byte-addressability feature of new memory. In this paper, we describe the design of NTL and provide experiment measurement results that show that our design will bring performance benefits.

• NEWSLETTER 전기공업
• /
• no.93-22 s.95
• /
• pp.12-23
• /
• 1993

• ICROS
• /
• v.6 no.2
• /
• pp.11-16
• /
• 2000

• Photonics industry news
• /
• s.3
• /
• pp.30-34
• /
• 2001