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

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06b
• /
• pp.460-464
• /
• 2010

SSD는 뛰어난 성능으로 인해 서버 시장에서 HDD를 빠르게 대체하며 각광받고 있다. 우리는 기존 SSD의 성능 분석이 단일한 I/O 패턴에 대해서만 이루어진 점을 주목하여, 다양한 패턴의 I/O가 동시에 수행 될 경우, 성능에 어떠한 영향이 있는지 평가해보고자 한다. 이를 위해 4KB부터 64MB까지 다양한 블록크기로 순차적/임의적 읽기/쓰기 연산을 수행함과 동시에 4KB 단위의 읽기/쓰기 I/O를 수행시켜 성능에 미치는 영향을 알아보았다. 이러한 평가를 네 가지 리눅스 I/O 스케줄러에 대해 각각 수행함으로써 스케줄러에 의한 영향 또한 평가하였다. 그 결과로 우리는 새로운 SSD의 성능 특성을 발견할 수 있었으며, 이는 새로운 I/O 스케줄러 및 SSD의 FTL 개발의 기반이 되리라 예상된다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.1774-1776
• /
• 2010

Solid State Device(SSD)는 플래시 메모리 모듈을 기반으로한 차세대 저장장치로서 디스크 회전방식의 Hard Disk Drive(HDD)를 대체하는 장치로 주목받고 있다. 하지만, 현재의 운영체제 I/O 스케줄러는 HDD 에 최적화되어 있기 때문에 플래시 모듈 기반의 SSD 의 성능을 최대한 끌어내지 못하는 한계를 갖고 있다. 따라서, 본 논문에서 우리는 SSD 의 성능을 끌어올리기 위해 SSD 의 특징을 분석하고 이를 바탕으로 SSD 에 최적화된 I/O 스케줄러를 고안하였다. 새로운 스케줄러(NSCHED)는 I/O Request 를 두 그룹으로 분류하고 각 요청에 타이머를 설정함으로써 I/O Request 를 빠르게 처리함과 동시에 기아방지를 위한 기법을 가진다. 우리는 Linux 2.6.30 에서 NSCHED 스케줄러를 구현하여 Postmark 벤치마크를 통해 성능평가를 수행했으며, NSCHED 스케줄러가 기본 Linux I/O 스케줄러보다 30% 가량 낮은 응답 시간이 소요됨을 확인했다.

• Korean Journal of Materials Research
• /
• v.7 no.3
• /
• pp.213-217
• /
• 1997

AOhf(Hcousto-r)l)tic niodulator) with :!OOlIiz freclucncl- and Sfi(;(Seconrl harmonic generation) green lasel-Lvith 53% nm wavelength were used for Il\'IIII~Dii.it,ii v~ilco disk recorder) FOI rhe appli~aptin of high densit]. optical recording, a high po\ver I ~ c r is r c ~ ~ l i ~ i l - u l ic I !tic. s\-sti,m a n d optic.,~I io;iting l,t)c>rs of each optical device must have a high laser damage threshoid hie rn;itie ant] retlwtive coatings on a $TeO_{2}$ singlc crystal. which is used as an acoustooptic material, by E-beam evaporation method. Laser damage threshold \vas nicdsureci hy Ar laser with the input power oi 0.55LV 1,aser damage threiholti 01 $ZrO_{2}$ and $SiO_{2}$. filn-is were higher than $AI_{2}O_{3}$ f i l m U'e also investigated a long--tern1 stability of the output po\ver of St{(; green laser

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.157-159
• /
• 2007

The conventional hard disk has been the dominant database storage system for over 25 years. Recently, hybrid systems which incorporate the advantages of flash memory into the conventional hard disks are considered to be the next dominant storage systems to support databases for desktops and server computers. Their features are satisfying the requirements like enhanced data I/O, energy consumption and reduced boot time, and they are sufficient to hybrid storage systems as major database storages. However, we need to improve traditional index node management schemes based on B-Tree due to the relatively slow characteristics of hard disk operations, as compared to flash memory. In order to achieve this goal, we propose a new index node management scheme called FNC-Tree. FNC-Tree-based index node management enhanced search and update performance by caching data objects in unused free area of flash leaf nodes to reduce slow hard disk I/Os in index access processes.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.11
• /
• pp.1365-1373
• /
• 1995

In this paper, we address the issues related to storage and retrieval of continuous media (CM)data we face in designing multimedia on-demand (MOD) storage servers. To support the two orthogonal factors of MOD server design, i.e., storage and retrieval of CM data, this paper discusses the techniques of disk layout, disk striping and real-time disk scheduling, which are integrated as a combined solution to the high- performance MOD storage subsystem. The proposed clustered striping technique enables either a multiple-disk or a parallel system to guarantee a continuous retrieval of CM data at the bandwidth required to support user playback rate by avoiding the formation of I/O bottlenecks.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.6
• /
• pp.451-462
• /
• 2009

Recently, there are many active studies to enhance low I/O performance of hard disk device. The studies on the hardware make good progress whereas those of the system software to enhance I/O performance may not support the hardware performance due to its poor progress. In this paper, we propose a new method of prefetching n-blocks into the flash memory. The proposed method consists of three steps: (1)analyzing the pattern of read requests in block units; (2)determining the number of blocks prefetched to flash memory; (3)replacing blocks according to block replacement policy. The proposed method can reduce the latency time of hard disk and optimize the power consumption of the computer system. Experimental results show that the proposed dynamic n-block method provides better average response time than that of the existing AMP(Adaptive multi stream prefetching) method by 9.05% and reduces the average power consumption than that of the existing AMP method by 11.11%.

• Journal of KIISE:Databases
• /
• v.29 no.5
• /
• pp.393-403
• /
• 2002

One of the major issues of DBMS is the buffer management. Because fetching data from the database disk is costly, the number of disk I/O's must be minimized in order to improve the DBMS performance. Although there have been many buffer management strategies to minimize the disk I/O, those strategies usually focused on just the temporal locality. Since there are the spatial locality as well as the temporal locality in the spatial database, strategies using only the temporal locality cannot achieve the optimal performance in the spatial database. In this paper, we propose a new buffer management strategy, the Spatial Locality Area Measure(SLAM) strategy, that considers not only the temporal locality but also the spatial locality. The SLAM buffer management strategy consists of two core structures, the SLM-tree and the M-LRU. We show the efficiency of the proposed strategy through experiments over various buffer sizes and reference frequencies.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.2
• /
• pp.19-32
• /
• 1993

This paper suggests the new high-speed input/output techniques in a shared memory multiprocessor system. The high-speed I/O processor which can connect the different kinds of large sized I/O periperal devices, the communication protocol to the main processing units for I/O operations, and the job scheduling scheme are addressed. This paper also introduces the disk cache technique which supports the slow I/O devices comparing with the main processing units. These techniques were implemented in the TICOM system. The performance evaluation statistics were collected and analyzed for the suggested high-speed I/O processing techniques. These statistics show the superiority of the suggested techniques.

• Journal of KIISE
• /
• v.43 no.11
• /
• pp.1216-1222
• /
• 2016

The advent of large-scale web services has resulted in gradual increase in the amount of data used in those services. These big data are managed efficiently by DBMS such as MySQL and MariaDB, which use InnoDB engine as their storage engine, since InnoDB guarantees ACID and is suitable for handling large-scale data. To improve I/O performance, InnoDB caches data and index of its database through a buffer pool. It also supports multiple buffer pools to mitigate lock contentions. However, the multiple buffer pool scheme leads to the additional data consistency overhead. In this paper, we analyze the overhead of the multiple buffer pool scheme. In our experimental results, although multiple buffer pool scheme mitigates the lock contention by up to 46.3%, throughput of DMBS is significantly degraded by up to 50.6% due to increased disk I/O and fsync calls.