• 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 Information Science Society Conference
• /
• 2004.10a
• /
• pp.79-81
• /
• 2004

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

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

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10a
• /
• pp.657-660
• /
• 2000

병렬 파일 시스템은 늦은 디스크 I/O로 인한 성능 저하를 개선하기 위해 병렬 I/O를 제공한다. 이때 계산과 디스크 I/O를 중첩시키는 선반입 기법으로 디스크 I/O로 인한 성능 저하를 더욱 개선할 수 있다. 하지만 I/O 위주의 프로그램에서는 선반입으로 인하여 시스템에서 제공하는 I/O 대역폭을 넘어 최악의 경우 기존의 선반입 기법은 성능개선을 위한 최선이 될 수 없을 뿐 아니라 선반입 기법 자체가 과부하가 될 수 있다. 본 논문에서는 이런 상황을 고려하여 I/O 대역폭 개선을 위한 이단 선반입 기법을 제시하여 성능개선을 제공한다.

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

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

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.11
• /
• pp.1989-1995
• /
• 2006

RAID(Redundant mays of inexpensive disks) were proposed as a way to use parallelism between multiple disks to improve aggregate I/O performance. The emerging of intelligent I/O architecture provides a standard for high performance I/O subsystems and introducer intelligence at the hardware level. With an embedded processor, intelligent I/O adaptors can offload the major I/O processing workload from the CPU and, at the same time, increase the I/O performance. This parer addresses the essential issue in the design of disk scheduling for intelligent I/O devices. In this paper we compare with MB throughput per second and maximum I/O respond time in RAID.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.1599-1602
• /
• 2012

스마트폰이나 태블릿PC와 같은 모바일기기 보급의 확산으로 모바일 클라우드 컴퓨팅이 발전하고 있다. 이와 같은 클라우드 컴퓨팅의 핵심 기술은 가상화 기술이며 서버 가상화가 근간을 이룬다. 가상 서버는 물리 서버의 성능 이상을 추구하고 있으며 디스크 I/O에 따라 성능이 크게 좌우된다. 본 논문에서는 가상 서버 상에서 NAS, Local SAS, PCI-SSD와 같은 다양한 디스크에 대한 I/O 성능을 테스트하였고, 이를 근거로 디스크 I/O 성능에 따른 가상 서버 통합에 대해 고찰하였다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.1_2
• /
• pp.79-91
• /
• 2006

The intelligent disk can improve the overall performance of the I/O subsystem by processing the I/O operations in the disk side. At present time, however, realizing the intelligent disk seems to be impossible because of the limitation of the I/O subsystem and the lack of the backward compatibility with the traditional I/O interface scheme. In this paper, we proposed new model for the intelligent disk that dynamically optimizes the I/O subsystem using the information that is only related to the physical sector. In this way, the proposed model does not break the compatibility with the traditional I/O interface scheme. For these works, the boosting algorithm that upgrades a weak learner by repeating teaming is used. If the last learner classifies a recent I/O workload as the multimedia workload, the disk reads more sectors. Also, by embedding this functionality as a firmware or a embedded OS within the disk, the overall I/O subsystem can be operated more efficiently without the additional workload.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.6
• /
• pp.1151-1158
• /
• 2020

In order to investigate the speed profile of data I/O of HDD, we have developed an utility program. The application to HDD reveals the detail properties of the speed profile of HDD and the relation between the cylinder structure of HDD and the velocity profile. For the extent application, the experiment of the large volume storage was performed, and the profile of SSD media, which is known as the new rapid media, was measured. The new M.2 NVME SSD, which has the ability of over 10Gbps, we can compare the velocities between cp under linux O/S and the utility, and shows that the performance of the utility can be reliable.