• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.603-608
• /
• 2005

Disk I/O is a major performance bottleneck of web proxy server. Today's most web proxy sowers are design to run on top of a general purpose file system. But general purpose file system can not efficiently handle web cache workload, small files, leading to the performance degradation of entire web proxy servers. In this paper we evaluate the performance potential of raw disk to reduce disk I/O overhead of web proxy servers. To show the performance potential of raw disk, we design a storage management system called Block-structured Storage Management System (BSMS). And we also actually implement web proxy server that incorporate BSMS in Squid. Comprehensive experimental evaluations show that raw disk can be a good solution to improve disk I/O performance significantly for web proxy servers.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.60-62
• /
• 2003

본 연구는 DBMS에서의 Disk I/O 종류별, 옵션별 특성 및 성능 분석을 하고 이를 실제 시험을 통하여 검증하였다. Raw Device와 Quick I/O 등이 뛰어난 성능을 보여주었으나, UFS(Uxis File System)의 사용 및 관리의 용이성을 고려하여 특성에 맞는 DiskI/O 구성 방식이 필요함을 제시하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.123-125
• /
• 2011

A SATA hard disk has been widely used in recent years and NCQ is one of its crucial features. Despite the development from IDE to SATA disk, there is still much room for improvement for a SATA disk. In addition, until now a hard disk is a black box to us and it is very hard to make research at the level of a disk controller. To enhance the performance of NCQ, we try to do I/O clustering over the requests, which combines multiple sequential requests into a single large one. To evaluate the effect of an I/O clustering mechanism, we created a simple but practical SATA hard disk simulator. Experimental results show that the proposed approach is effective in enhancing the I/O performance of a SATA disk.

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

In current storage system environment, we use disk mirroring or Chained-declustering scheme to improve data availability and reliability. If disk error is occurred when these schemes are used. we need efficient recovery schemes for these situations. In this paper, it is proposed that a recovery method of disk mirroring that guarantees I/O performance similar to normal state during disk failure, Also, we execute performance evaluation for our recovery scheme and existing schemes in various environments. We show through the simulation that our algorithm outperforms the classic schemes in terms of I/O response time.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.11 no.3
• /
• pp.43-52
• /
• 2007

A hard disk, which can be classified as an external storage is usually capacious and economical. In spite of the attractive characteristics and efforts on the performance improvement, however, the operation of the hard disk is apparently slower than a processor and the advancement has also been slowly conducted since it is based on mechanical process. On the other hand, the advancement of the processor has been drastically performed as semiconductor technology does. So, disk I/O sub-system becomes bottleneck of computer systems' performance. For this reason, the research on disk I/O sub-system is in progress to improve computer systems' performance. In this paper, we proposed multi-level LRU scheme and then apply it to the computer systems with buffer cache and disk cache. By applying the proposed scheme to computer systems, the average access time to disk blocks can be decreased. The efficiency of the proposed algorithm was verified by simulation results.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.4
• /
• pp.131-140
• /
• 2013

This paper deals with the design and implementation of an interface for interoperation between DiskSim, a well-known disk simulator, and a system-level simulator based on DEVSim++. Such inter-operational simulation aims at evaluation of an overall performance of storage systems which consist of multiple computer nodes with a variety of I/O level specifications. A well-known system-level simulation framework, DEVSim++ environment is based on the DEVS formalism, which provides a sound semantics of modular and hierarchical modeling methodology at the discrete event systems level such as multi-node computer systems. For maintainability we assume that there is no change of the source codes for two heterogeneous simulation engines. Thus, we adopt a notion of simulators interoperation in which there should be a means to synchronize simulation times as well as to exchange messages between simulators. As an interface for such interoperation DiskSimManager is designed and implemented. Various experiments, comparing the results of the standalone DiskSim simulation and the interoperation simulation using the proposed interface of DiskSimManager, proved that DiskSimManager works correctly as an interface for interoperation between DEVSim++ and DiskSim.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.11
• /
• pp.3519-3533
• /
• 2000

In a VOD(Video-On-Demand) system, I/O performance and storage requirements are generally more important than computing capability, Due to the development of CPU tecnology, the gap between the performance of processors and desk speed are widening. Therefore, the disk system typically becomes the bohleneck ina VOD system. In order to allevte those effects from physical constramts, disk array system is used. The I/O performance of disk arrays can be improved by the capability of processors, I/O schefuling polcy, the number of member disks in the array, disk block size, block placemet method etc. In this paper, we considered the disk scheduling schemes including EDF( Earliest Deadine First), SCAN, SGAN-EDF, Round-robm. GSS(Grouped Sweeping scheme), and C-SCAN, LOOK, C-LOOK which are variations of SCAN Mamly focusing on those disk scheduling schemes, we performed the simulation in order to compare and eview the perionmance of disk arrays considening seveial related parameters under diverse environments and analyzed the effects of those parameters to the performance.

• The KIPS Transactions:PartD
• /
• v.13D no.4 s.107
• /
• pp.463-476
• /
• 2006

R-trees have been traditionally optimized for the I/O performance with the disk page as the tree node. Recently, researchers have proposed cache-conscious variations of R-trees optimized for the CPU cache performance in main memory environments, where the node size is several cache lines wide and more entries are packed in a node by compressing MBR keys. However, because there is a big difference between the node sizes of two types of R-trees, disk-optimized R-trees show poor cache performance while cache-optimized R-trees exhibit poor disk performance. In this paper, we propose a cache and disk optimized R-tree, called the PR-tree (Prefetching R-tree). For the cache performance, the node size of the PR-tree is wider than a cache line, and the prefetch instruction is used to reduce the number of cache misses. For the I/O performance, the nodes of the PR-tree are fitted into one disk page. We represent the detailed analysis of cache misses for range queries, and enumerate all the reasonable in-page leaf and nonleaf node sizes, and heights of in-page trees to figure out tree parameters for best cache and I/O performance. The PR-tree that we propose achieves better cache performance than the disk-optimized R-tree: a factor of 3.5-15.1 improvement for one-by-one insertions, 6.5-15.1 improvement for deletions, 1.3-1.9 improvement for range queries, and 2.7-9.7 improvement for k-nearest neighbor queries. All experimental results do not show notable declines of the I/O performance.

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

웹서버는 disk I/O 오버헤드를 줄이기 위해 웹 문서를 메모리 캐슁한다. 하지만 동시에 들어오는 connection들에 대해 처리 순서는 고려하지 않으므로 같은 문서를 요구하는 request들이 메모리 캐쉬의 working set내에 들어오지 않을 경우 disk I/O를 추가시킬 수 있다. 본 논문에서는 동시에 처리해야 할 같은 작업량을 요구하는 request는 연속적으로 처리함으로써 disk I/O 오버헤드를 줄이는 우선 순위 스케쥴링을 수행함으로써 정적 웹 환경서의 사용자 응답 시간을 줄였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.79-81
• /
• 2004

클러스터 시스템의 규모가 커질수록 이질성 문제가 심각해지고 유지, 보수에 큰비용이 소요되게 된다 본 논문에서는 I/O 부시스템의 입장에서 이러한 문제를 해결하기 위해 다양한 종류의 디스크를 지원하도록 개선된 SDIO(Single Disk I/O: 단일 디스크 입출력)를 설명한다. 단일 디스크 입출력은 리눅스의 커널 모듈의 형태로 제작되었으며 클러스터 내의 다양한 디스크를 하나의 큰 디스크 장치처럼 보이도록 해주는 역할을 한다. 또한 다양한 성능의 디스크가 존재할 때 모든 디스크의 성능을 최대한 활용하도록 한다.