• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.04a
• /
• pp.243-246
• /
• 2001

과도한 파일 입출력이 요구되는 병렬파일 시스템의 성능을 결정하는 중요한 요소로서 캐슁과 선반입을 들 수 있다. 본 논문은 캐쉬의 크기에 비해 상대적으로 근 파일을 요청하는 경우에 시스템 성능에 막대한 영향을 미치는 선반입에 대해서 선반입할 데이터를 결정하는 알고리즘으로 테이블 비교법을 제안하고, 이와 더불어 예측된 데이터의 선반입 여부와 선반입 시기를 결정하는 경우 현재의 가용 입출력 대역폭을 고려하는 기법을 제안한다. 제안하는 선반입 알고리즘은 실제 병렬파일시스템에 구현되었으며, 파일시스템 성능향상에 크게 기여하였다.

• KIISE Transactions on Computing Practices
• /
• v.22 no.6
• /
• pp.284-289
• /
• 2016

In the Hadoop-based Big Data analysis model, the data movement between the legacy system and the analysis system is difficult to avoid. To overcome this problem, a unified Big Data file system is introduced so that a unified platform can support the legacy service as well as the analysis service. However, major challenges in avoiding the performance degradation problem due to the interference of two services remain. In order to solve this problem, we first performed a real-life simulation and observed resource utilization, workload characteristics and I/O balanced level. Based on this analysis, two solutions were proposed both for the system level and for the technical level. In the system level, we divide I/O path into the legacy I/O path and the analysis I/O path. In the technical level, we introduce an aggressive prefetch method for analysis service which requires the sequential read. Also, we introduce experimental results that shows the outstanding performance gain comparing the previous system.

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

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.5
• /
• pp.400-404
• /
• 2009

Native Command Queueing is a technology to maximize throughput of disk system by reordering requests in its command queue. Recent S-ATA 2 standard specifies a protocol for the purpose of dealing with NCQ feature, making most vendors implementing it in their disk devices. However, the new feature, NCQ, may lead to information gap between OS and disk drive. 05 considers that disk will service I/O requests in the order as OS has dispatched. Unfortunately, it isn't true any more since NCQ would simply ignore the policy of OS and reorder the sequence OS has expected. Let us define the term as expectation-discord. Due to the discord, serious performance anomalies or starvation of requests may occur in I/O subsystem. In this paper, we confirm that the expectation-discord actually brings about starvation of requests. We propose a solution to settle it. Our solution is very simple, effective, cheap(not requiring any hardware modification) and portable across various OS. Experimental results show that our solution can balance throughput and response time very well.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.9
• /
• pp.527-535
• /
• 2004

Handling mixed workload in digital set-top box or streaming server becomes an important issue as integrated file system gets momentum as the choice for the next generation file system. The next generation file system is required to handle real-time audio/video playback while being able to handle text requests such as web page, image file, etc. Legacy file system provides only best effort I/O service and thus cannot properly support the QoS of soft real-time I/O. In this paper, we would like to present our experience in developing the file system which fan guarantee the QoS of multimedia stream. We classify all application I/O requests into two category: periodic I/O and sporadic I/O. The QoS requirement of multimedia stream could be guaranteed by giving a higher priority to periodic requests than sporadic requests. The proto-type file system(Qosfs) is developed on Linux Operating System.

• The Magazine of the IEIE
• /
• v.20 no.5
• /
• pp.71-79
• /
• 1993

• ICROS
• /
• v.1 no.3
• /
• pp.83-91
• /
• 1995

이 글에서는 신경회로망의 장점과 퍼지논리의 장점을 최대한 이용하며 각각의 단점을 보완하는 뉴로-퍼지 융합 기술과 현재 연구의 흐름을 간단히 살펴보았다. 비구조적인 정보 뿐만 아니라 구조적인 정보까지도 신경회로망의 영역 안에서 처리할 수 있는 새로운 뉴로-퍼지 회로망을 소개하였다. 소개한 뉴로-퍼지 회로망은 비퍼지화와 비퍼지화에 의해 발생하는 오차를 잘 보상할 수 있을 뿐만 아니라, 최적의 입출력 퍼지 소속 함수의 중심점과 모양을 찾을 수 있는 장점이 있다. 또한, 그 특성을 알지 못하는 임의의 비선형 동적 시스템에서 입출력 데이터만 얻을 수 있으며 시스템을 모델할 수 있는 퍼지 규칙을 언어적인 방법과 수치적인 방법으로 표현할 수 있으며 간단한 예제를 통한 시뮬레이션 결과를 보였다. 소개한 뉴로-퍼지 회로망을 이용하여 뉴로-퍼지 제어기를 구성할 수도 있으며, 또한 시스템의 역 퍼지 규칙을 찾는데 이용할 수도 있다. 향후 보다 우수한 일반화 성능을 가질 수 있는 뉴로-퍼지 회로망의 개발이 필요하며, 충분한 입출력 데이터를 얻는 방법의 연구도 필요하다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10a
• /
• pp.356-361
• /
• 2006

수많은 동시 사용자를 처리해야 하는 인터넷 서버에서는 다수의 연결을 효율적으로 처리 하는 것이 중요한 문제이다. 기존의 멀티 쓰레드 방식이나 이벤트 드리븐 방식이 가지는 한계를 극복하기 위한 한 가지 대안으로서 네트워크 비동기 입출력 방식을 들 수 있다. 네트워크 비동기 입출력을 요청 한 후에 완료될 때까지 블로킹 되지 않고 즉시 다른 작업을 진행할 수 있는 방식으로서, 하나의 쓰레드에서 다중 연결을 효율적으로 처리할 수 있게 한다. 본 논문에서는 리눅스 커널에 네크워크 비동기 입출력을 구현하고 실험을 통한 성능 분석을 수행하였다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.5
• /
• pp.155-160
• /
• 2018

In this paper, we found that buffer cache in general systems does not perform well in rendering software, and presented a new buffer cache management scheme that resolves this problem. To do so, we collected various file I/O traces of rending software and analyzed their characteristics. From this analysis, we observed that file I/Os in rendering consist of long loops, short loops, random accesses, and write-once accesses. Based on this observation, we presented a buffer cache management scheme that allocates cache space to each access types and manages them appropriately, thereby improving the buffer cache performances by 19% on average and up to 55%.

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