• Journal of the Korea Society of Computer and Information
• /
• v.5 no.4
• /
• pp.106-111
• /
• 2000

Real-time applications as multimedia file transfer, it is necessary to use a disk array as a system. For Providing requested service to much more clients at the same time in a multimedia storage server considerable varied strategies in a several parts. But especially it is important to various parameters for disk array such as relation of striping block size as a system environmental characteristics of video data. In this paper we evaluated the suitable storage system architecture implementing them applying synthetically generated workloads that varied in the parameters interest in real environment of multimedia server.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.11
• /
• pp.2662-2670
• /
• 1997

High speed network makes possible to transfer not only the test data but also multimedia data such as audio, image, and moving pictures and etc. In a multimedia applications, as a multimedia storage system, it is necessary to use a disk array to store and retrieve data by real time. It is important feature to various disk array parameters as a storage system on a real VOD system, such as configuration method of each disks and allocation method of multimedia data. In this paper, various parameters for the disk array are decided to be used for the video-on-demand system application by simulations in two ways. The real and simulation measurement are compared and analyzed on the performance. Simulation results shows that RAID level 5 and 256KB as striping unit and 185KB as data requests size per seconds are suitable parameter for the disk array architecture which provides MPEG-1 files with a rate of 1.5Mbps in two measurements of real and simulation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.763-767
• /
• 2005

RAID were proposed to stored double data or used to parity logging methode for error recovery. We describe a technique for automating the execution of redundant disk array operation, including recovery from errors, independent of array architecture. RAID5 provide highly reliable cost effective secondary storage with high performance for read access and large write accessed. It discusses the two architectural techniques used in disk arrays, striping across multiple disks to improve performance and redundancy to improve reliability. In this paper we compare with performance and reliability in RAID5 real/write to file and stripe size. than suggest to algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.10
• /
• pp.2608-2617
• /
• 1999

One of the most important functionality that commercial video storage servers should provide is to maximize the number of concurrent streams and to minimize the initial latency of new requests. In this paper, we propose a data placement scheme whose disk read unit size can be twice large than that of conventional striping methods. The proposed scheme can significantly increase the number of concurrent streams, since the ratio of rotational latency time is decreased and the disks are effectively utilized. The disk scheduling scheme we propose guarantees constant initial latency time. We also propose a procedural design method for a storage server by introducing the concept of allowed initial latency. The comparison with previous research shows that the proposed scheme provides better performance.

• The KIPS Transactions:PartB
• /
• v.9B no.2
• /
• pp.191-198
• /
• 2002

Recently, Usage of multimedia server is rapidly increased with expansion of internet that real-time displaying service for multimedia data, MPEG and etc. For these multimedia real-time applications, it is necessary to use a disk array as a storage system. For providing requested service to much more clients at the same time in a multimedia data storage server, considerable varied strategies in a several parts. But especially it is important feature to various parameters for disk array such as relation of striping block size as a system environment and characteristics of video data. In this paper, we implemented real environment of multimedia server which provides MPEG-1 files and evaluated the suitable storage system architectures by applying synthetically generated workloads in the various parameters for disk array.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.12
• /
• pp.2971-2984
• /
• 1997

In this paper, we propose an efficient video block Placement scheme that utilize the current disk product that has MZR disk characteristic and users' skewed access pattern on VOD. Also, we evaluate its performance through simulation and modeling of VOD server. The basic placement rule is to place on MZR disks by LP, SHP methods according to the Zipf distribution of popularity. To verify the proposed scheme, we examined its performance on workstation with 2 MZR disks under varied skewed factors. The proposed placement scheme showed better response time than the random method. To extend proposed placement scheme to disk group, we analyzed the theoretical maximum numbers of concurrent users and the required buffer size per user. For performance parameters for the proposed scheme, we considered the disk head scheduling methods, the placement methods and the striping unit. The result of experiments showed that the proposed scheme was effective.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06a
• /
• pp.260-264
• /
• 2010

최근 낸드 플래시 메모리를 이용한 SSD(Solid State Disk)는 차세대 저장 매체로서 주목받고 있다. SSD의 성능을 높이기 위해 다양한 기술이 연구되고 있지만, 그 중 병렬성 향상 기법이 성능에 가장 큰 영향을 미치고 있다. 이에 따라 SSD에서는 병렬성 향상을 위해 논리 주소 스트라이핑(Striping)을 사용하고 있다. 논리 주소 스트라이핑을 이용하면 병렬성이 크게 증가되지만 매핑 기법에 따라 블록 활용률에 문제점이 발생할 수 있다. 본 논문에서는 논리 주소 스트라이핑 기법과 하이브리드 매핑 기법이 동시에 SSD에 적용되었을 때 발생하는 블록 파편화 문제를 확인하고, 블록 파편화 문제가 블록 활용률과 성능에 미치는 영향을 분석하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.04a
• /
• pp.353-356
• /
• 2002

RAID 레벨 중에서 스트라이핑을 하는 시스템에서는 운영중에 디스크를 추가하려면, 기존의 디스크에 저장되어 있는 데이터들은 새로 추가된 디스크를 고려하여 스트라이핑 하기 위해 재구성하는 과정이 필요하다. 이러한 동적디스크 수의 변화에 유연하게 적응할 수 있도록 매핑 테이블을 사용하는 방법들이 제안되고 있으나 관리해야 할 데이터의 양이 디스크 용량에 비례하여 증가하고 메인 메모리에서 모두 관리할 수 없기 때문에 성능이 떨어지는 문제가 발생한다. 이 논문에서는 스트라이핑을 하는 RAID 시스템에서 적은 양의 메타데이터(SZIT)를 관리함으로써 동적 디스크 수를 지원하는 계산에 의한 매핑 방법을 제안한다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2004.05a
• /
• pp.306-309
• /
• 2004

MPEG 비디오 스트림의 시간적 차원과 색상적 차원을 고려하여 모두 4 단계의 해상도가 구성되는 엔코딩 기법과 디스크 배열에 대한 스트라이핑 기법이 본 논문에서 제시된다 먼저 MPEG-1 스트림은 I 프레임과 P 프레임으로 구성된 서브스트림과 B 프레임만으로 구성된 서브스트림으로 분할된다. 분할된 서브스트림의 각 프레임은 색상 차원에서 저해상도용 컴포넌트와 고해상도용 컴포넌트로 다시 분리된다 따라서 한 MPEG 비디오 스트림은 4 개의 컴포넌트로 구성되며 각 컴포넌트를 구성하는 블록들이 디스크 배열에 연속적으로 저장되는 스트라이핑 기법이 기술된다. 즉 4 개의 컴포넌트가 모두 재생될 경우 해상도가 가장 높게 나타나며 재생되는 컴포넌트의 수가 1 개씩 감소될수록 1 단계씩 낮은 해상도가 유지된다. 4 단계의 해상도를 구성하는 본 논문의 엔코딩 기법과 디스크 배열을 위한 스트라이핑 기법은 멀티미디어 서버의 성능을 향상시킬 수 있으며 이에 대한 시뮬레이션 결과가 기술된다.

• 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.