• The KIPS Transactions:PartA
• /
• v.9A no.2
• /
• pp.163-170
• /
• 2002

Previous buffer cache schemes for continuous media file system only exploited the sequentiality of continuous media accesses and didn't consider looping references. However, in some video applications like foreign language learning, users mark the scene as loop area and then application automatically playbacks the scene several times. In this paper, we propose a novel buffer cache scheme for continuous media file system that sequential and looping references exist together. Proposed scheme increases the cache hit ratio by detecting reference pattern of files and appling an appropriate replacement policy to each file.

• Journal of Korea Multimedia Society
• /
• v.5 no.3
• /
• pp.316-322
• /
• 2002

In this paper we consider continuous block allocation scheme of UNIX file system to support real time retrieval service. The proposed block allocation scheme is designed to place real time data at appropriate disk block location in considering the consume-rate that is given with real time data. To effectively determine the disk block location we analyze the relationship between consume-rate and the two variable factors that are the number of continuous blocks and the cylinder distance of logically consecutive data. In traditional UNIX block allocation scheme it is in fact impossible to find continuous free disk blocks in a specific cylinder location. Thus we propose new bitmap-based free block allocation scheme that enables to determine whether a block in specific cylinder location is free state, or not.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.8
• /
• pp.1743-1749
• /
• 2011

The multimedia data for video-on-demand(VOD) service has large, continuous and real time characteristics. The frequent disk I/O operations takes much time and decrease the system performance in multimedia services. Therefore the efficient buffer management is needed in order to reduce the disk accesses to multimedia data. This paper addresses how to increase the buffer hit ratio and the number of users in a multimedia service like VOD by increasing the utility of buffer. This paper also simulated various resource management algorithms and strategies and evaluated, compared and analyzed their performances.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.59-61
• /
• 2000

멀티미디어 데이터의 크기가 커짐에 따라, 파일 시스템에 대량의 데이터를 저장하는 것이 필요하다. 기존의 파일 시스템이 대용량의 데이터를 저장하는 면에서 우수한 성과를 얻기 어려움에 따라, SAN(Storage Area Network)을 이용한 새로운 파일 시스템이 최근에 연구되고 있다. SAN을 이용한 파일 시스템인 GFS는 기존 파일시스템들에 비해 대량의 데이터를 저장할 수 있도록 설계되었지만, inode와 빈 공간의 관리가 효율적이지 못하였다. 본 논문에서는 이러한 문제점을 해결하기 위해서 GFS의 inode 구조, 데이터 블록 할당 기법, 그리고 빈 공간 관리 기법에 중점을 두어 메타데이터 구조를 개선한다. 그 결과 데이터 블록 접근 시간을 줄이는 새로운 inode 구조를 설계하고, 큰 파일에는 연속된 블록으로 된 익스텐트로 할당하고 작은 파일에는 블록들로 할당하는 새로운 데이터 할당 기법을 제시한다. 또한, 빈 공간을 신속히 할당 회수할 수 있도록 빈 익스텐트들과 블록들의 주소를 저장하여 두는 독창적인 빈 공간 지갑을 사용한다. 성능 분석 결과 이러한 개선 방안들이 기존의 다른 시스템들보다 효율적임을 알 수 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.181-183
• /
• 2003

본 논문에서는 적응적인 스트리밍 시스템 환경에서 계층적으로 압축된 멀티미디어 데이터의 저장구조와 자료인출 원리를 분석한다. 또한 네트워크 시뮬레이션을 이용, 네트워크 상에서 다양한 멀티미디어 스트리밍 부하의 특성을 분석한다. 두 가지 분석을 통해 기존의 멀티미디어 저장방식이 다양한 네트워크 환경과 시간에 따라 전송율이 변화하는 적응적 스트리밍 시스템의 요구를 충족시키지 못한다는 것을 확인한다. 이를 개선하기 위해 제안된 하모닉 인터리빙은 하모닉 인터리빙 방식은 전송비율이 높은 멀티미디어 데이터 블록의 위치를 연속적으로 배치하기 위해서 전송비율이 높은 계층과 그렇지 않은 계층을 별도의 그룹으로 나누어서 저장하는 방식이다. 실험을 통해서 네트워크 상황이 전송하고자 하는 영화의 대역폭을 보장하지 못하는 환경에서는 기존의 저장방식보다 새로 제안된 저장방식이 디스크 사용율에 있어 우수한 성능을 나타냄을 보인다.

• Journal of Broadcast Engineering
• /
• v.16 no.1
• /
• pp.155-173
• /
• 2011

Recently, with the digitalization of a broadcasting system and the development of a communication technology, the existing trend of consuming media contents throughout the fixed-displayer and the dedicated channel is being changed. The existing user only could consume media contents under limited time and places because of the fixed-displayer and the dedicated channel. However, with advent of the IP-based terminals and HTTP adaptive streaming which transfer the media sequence according to the user's transmission condition, users become possible to enjoy the media content anytime anywhere. As the result of the alteration of the broadcasting surrounding, users can enjoy the media content while changing his terminals according to their preferences and circumstances. However, in case that users try to consume consecutively the content from last view-point ended in the previous terminal under current HTTP adaptive streaming environment, a user has to remember the last view-point, and then has to apply the view-point to the changed terminal. Thus, for solving this problem, this paper defines "User Profile" for describing the metadata for the chained content consume environment between the terminals. Also, for proving the proposed method, this paper try to demonstrate the proposed method throughout the realization of the system based on Smooth Streaming from Microsoft.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.3
• /
• pp.811-820
• /
• 1997

Disk arrays are using to enhance data trandfer rate and I/O performance in multimedia applications which need a high-performance storage device with large storage capacity and high-speed network.As performance varies with configuration and data layout scheme,disk array characteristic variables must be approrpriately deter-mined in desibning disk array archetecture for a speciffic applicatoin. In this paper,in order to design a disk array architecturte as a storage server of a small-scale VOD system,we evaluate performance of a disk array to chose the number of disks in the array,disk array cinfiguration,a degree of declustering for a given data block size of continous media file system and I/D request size through simulation.Simulation result shows that RAID level 5 with 5 disks ios a suitable candidate for the disk array architecture which privides MPEG-2 files with a rate of 6 Mbps,Moreover,we whow that stripe unit is 64 KB and a layout scheme is contigous placement.

• Journal of Korea Multimedia Society
• /
• v.2 no.3
• /
• pp.265-276
• /
• 1999

Video on Demand (VOD) system is definitely one of main applications in upcoming multimedia era. In this research, we have designed and implemented a host-based scalable VOD system (SVOD) which is composed of low cost PC servers and runs on Linux kernel that is currently spotlighted in enterprise and research domains. Our contribution is as follows: first, the previous Ext2 file system was modified to efficiently support continuous media like MPEG stream. Second, the storage server features a host-based scalable architecture. Third, a software MPEG decoder was implemented using Microsoft's DirectShow$\circledR$COM. Finally, flow control between client and server is provided to suppress overflow and underflow of client circular buffer and supports FF VCR operation. We have known that it is possible to develop a thread-based and scalable VOD system on low cost PC servers and free Linux kernel.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.4
• /
• pp.2784-2790
• /
• 2015

The column-oriented database storage is a very advanced model for large-volume data transactions because of its superior I/O performance. Traditional data storages exploit row-oriented storage where the attributes of a record are placed contiguously in hard disk for fast write operations. However, for search-mostly data warehouse systems, column-oriented storage has become a more proper model because of its superior read performance. Recently, solid state drive using flash memory is largely recognized as the preferred storage media for high-speed data analysis systems. In this research, we propose a new transaction recovery scheme for a column-oriented database environment which is based on a flash media file system. We improved traditional shadow paging schemes by reusing old data pages which are supposed to be invalidated in the course of writing a new data page in the flash file system environment. In order to reuse these data pages, we exploit reused shadow list structure in our column-oriented shadow recovery(CoSR) scheme. CoSR scheme minimizes the additional storage overhead for keeping shadow pages and minimizes the I/O performance degradation caused by column data compression of traditional recovery schemes. Based on the results of the performance evaluation, we conclude that CoSR outperforms the traditional schemes by 17%.