• Journal of the Korea Computer Industry Society
• /
• v.7 no.3
• /
• pp.217-226
• /
• 2006

Intensive studies have been made in the area of N-VOD server Multimedia files in the N-VOD sever are characterized with the large volume of data, the requirements of synchronization and real-time playback of streams. The basic goal of the study is to find an efficient mechanism to allow maximum number of users under the limited resources such as Buffer size and disk bandwidth. we propose a efficient VCR-LIKE operations and buffer, disk scheduling policy for multimedia services with management of VOD sever resources. Simulation results show that the rate of buffer usage and service time of proposed scheme are about 18% performance improved than that of traditional methods. This implies that our method can allow much more users for given resources.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.3
• /
• pp.41-49
• /
• 2009

Flash memory has become increasingly requestion for the importance and the demand as a storage due to its low power consumption, cheap prices and large capacity medium. This research is to design a high performance flash memory structure for the substitution of a hard-disk by dynamic prefetching of aggressive spatial locality from the spatial smart buffer system. The proposed buffer system in a NAND flash memory consists of three parts, i.e., a fully associative victim buffer for temporal locality, a fully associative spatial buffer for spatial locality, and a dynamic fetching unit. We proposed new dynamic prefetching algorithm for aggressive spatial locality. That is to use the flash memory instead of the hard disk, the proposed flash system can achieve better performance gain by overcoming many drawbacks of the flash memory by the new structure and the new algorithm. According to the simulation results, compared with the smart buffer system, the average miss ratio is reduced about 26% for Mediabench applications. The average memory access times are improved about 35% for Mediabench applications, over 30% for Spec2000 applications.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.18 no.6
• /
• pp.1299-1306
• /
• 2023

In this paper, we present a system for undesignated cultural heritage management and real-time theft chase, which uses flash-based large-capacity storage. The proposed system is composed of 3 parts, such as a cultural management device, a flash-based server, and a monitoring service for managing cultural heritages and chasing thefts using IoT technologies. However flash-based storage needs methods to overcome the limited lifespan. Therefore, in this paper, we present a system, which uses the disk buffer in flash-based storage to overcome the disadvantage, and evaluate the system performance in various environments. In our experiments, LRU policy shows the number of direct writes in the flash-based storage by 10.7% on average compared with CLOCK and FCFS.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2021.05a
• /
• pp.22-24
• /
• 2021

본 논문은 원격 서버에 저장 내용을 백업하는 RAM 기반 디스크 시스템인 NBRD의 프로토타입 구현을 위한 블록 장치 구동기와 이를 이용한 디스크 입출력 성능을 평가한다. 또, SSD의 성능 평가를 실시하여 향후 NBRD의 이점 및 향후 성능 향상 목표값을 설정한다.

• KSBB Journal
• /
• v.15 no.6
• /
• pp.605-608
• /
• 2000

Oligodeoxynucleotides (ODNs) were separated by high-performance membrane chromatography (HPMC), a combined system of chromatography and membrane. The separation mechanism involved anion-exchange, and the stationary phase was cation CIM (Convective Interaction Media) DEAE disk (16${\times}$3 mm). Two types of mobile phase were used, buffer A (20mM Tris-HCl, pH 7.4) and buffer B (buffer A + 1M NaCl). As the amount of NaCl dissolved in buffer linearly increased, the retention time shortened, which enabled a gradient elution mode. Based on the number of theoretical plates and resolution observed, the optimum mobile phase and operating condition (Buffer A/Buffer B=50/50 - 20/80 vol%, gradient time 2 min) were experimentally determined. In this experimental condition, ODNs were separated within 2 min at a mobile phase flow rate of 6 ml/min.

• Proceedings of the KIEE Conference
• /
• 1991.11a
• /
• pp.185-188
• /
• 1991

In this paper we have designed and implemented a method of using extended memory and hard disk space as a data buffer for application programs to allow handling of large data files in DOS environment. We use a part of the conventional DOS memory as a buffer cache which allows the application program to use extended memory and hard disks transparently. Using buffer cache also allows some speed improvement for the application program. We have also implemented a number of functions to allow easier handling of pointer operations used by application programs.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.1
• /
• pp.57-64
• /
• 2004

The speed gap between processors and disks is a serious problem. So, I/O sub-system limits the performance of computer system. To overcome the speed gap, caches have been used in computer system. By using cache, the access times to disk blocks can be reduced and the performance of computer system can be improved. In this paper, we proposed an efficient cache management algorithm for computer system which have buffer cache and disk cache. The proposed algorithm can minimize the duplicated blocks between buffet cache and disk cache. We evaluate the proposed algorithm by trace-driven simulation. The simulation results show that the proposed algorithm can reduce the mean access time to disk blocks.

• The KIPS Transactions:PartA
• /
• v.18A no.4
• /
• pp.135-142
• /
• 2011

This research is to design an effective buffer structure and its management for flash memory based high performance SSDs (Solid State Disks). Specifically conventional SSDs tend to show asymmetrical performance in read and /write operations, in addition to a limited number of erase operations. To minimize the number of erase operations and write latency, the degree of interleaving levels over multiple flash memory chips should be maximized. Thus, to increase the interleaving effect, an effective buffer structure is proposed for the SSD with a hybrid address mapping scheme and super-block management. The proposed buffer operation is designed to provide performance improvement and enhanced flash memory life cycle. Also its management is based on a new selection scheme to determine random and sequential accesses, depending on execution characteristics, and a method to enhance the size of sequential access unit by aggressive merging. Experiments show that a newly developed mapping table under the MBA is more efficient than the basic simple management in terms of maintenance and performance. The overall performance is increased by around 35% in comparison with the basic simple management.

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

In this paper, we present a new buffer pool management scheme designed for video type news objects to build a cost-effective News On Demand storage server for serving users requests beyond the limitation of disk bandwidth. In a News On Demand Server where many of users request for video type news objects have to be serviced keeping their playback deadline, the maximum numbers of concurrent users are limited by the maximum disk bandwidth the server provides. With our proposed buffer cache management scheme, a requested data is checked to see whether or not it is worthy of caching by checking its average arrival interval and current disk traffic density. Subsequently, only granted news objects are permitted to get into the buffer pool, where buffer allocation is made not on the block basis but on the object basis. We evaluated the performance of our proposed caching algorithm through simulation. As a result of the simulation, we show that by using this caching scheme to support users requests for real time news data, compared with serving those requests only by disks, 30% of extra requests are served without additional cost increase.

• Journal of KIISE:Databases
• /
• v.36 no.5
• /
• pp.399-404
• /
• 2009

In a multiple-server DBMS using the share-disk model, when a server process updates data, the updated ones are not immediately reflected to the buffers of the other server processes. Thus, the other server processes may read invalid data. In this paper, we propose a novel method to solve this problem. In this method the server process stores the identifiers and timestamps of the pages that have been updated during a transaction into the coherency volume when the transaction commits. Then, the server process invalidates its buffers of the pages updated by the other server processes by accessing the coherency volume when the lock is acquired, and, subsequently, read the up-to-date versions of the pages from disk. This method needs only a very small coherency volume and shows a good performance because the amount of data that need to be accessed is very small.