• The KIPS Transactions:PartD
• /
• v.9D no.5
• /
• pp.779-788
• /
• 2002

There are many technically difficult issues in searching multimedia data such as image, video and audio because they are massive and more complex than simple text-based data. As a method of searching multimedia data, a similarity retrieval has been studied to retrieve automatically basic features of multimedia data and to make a search among data with retrieved features because exact match is not adaptable to a matrix of features of multimedia. In this paper, data clustering and its indexing are proposed as a speedy similarity-retrieval method of multimedia data. This approach clusters similar images on adjacent disk cylinders and then builds Indexes to access the clusters. To minimize the search cost, the hashing is adapted to index cluster. In addition, to reduce I/O time, the proposed searching takes just one I/O to look up the location of the cluster containing similar object and one sequential file I/O to read in this cluster. The proposed schema solves the problem of multi-dimension by using clustering and its indexing and has higher search efficiency than the content-based image retrieval that uses only clustering or indexing structure.

• The KIPS Transactions:PartA
• /
• v.13A no.5 s.102
• /
• pp.445-454
• /
• 2006

We introduce a family of simulators for I/O-intensive distributed or parallel applications, and a methodology that permits selecting the most efficient simulator meeting a given user-defined accuracy requirement. This methodology consists of a series of tests to choose an appropriate simulation based on the attributes of the application. In addition, each simulator provides two estimates of application execution time: the minimum expected time and the maximum. We present the results of applying our methodology to existing applications, and show that we can accurately simulate applications tens to hundreds of tunes faster than the application execution times.

• The Journal of the Korea Contents Association
• /
• v.18 no.1
• /
• pp.465-475
• /
• 2018

Recently, as the use of social media and IoT has increased, large graph streams has been generating and studies on real-time processing for them have been actively carrying out. In this paper we propose a incremental graph stream processing scheme that reuses previous result data when the graph changes continuously. We also propose a cost model to selectively perform incremental processing and static processing. The proposed cost model computes the predicted value of the detection cost and the processing cost of the recalculation area based on the actually processed history and performs the incremental processing when the incremental processing is more profit than the static processing. The proposed incremental processing increases the efficiency by processing only the part that changes when the graph update occurs. Also, by collecting only the previous result data of the changed part and performing the incremental processing, the disk I/O costs are reduced. It is shown through various performance evaluations that the proposed scheme outperforms the existing schemes.

• 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 the Korean Ceramic Society
• /
• v.37 no.10
• /
• pp.962-967
• /
• 2000

산소 결핍 페라이트 (oxygen deficient ferrites, ODF) MF $e_2$ $O_{4-}$$\delta$/는 약 30$0^{\circ}C$의 낮은 온도에서 온실가스중 하나인 $CO_2$를 C와 $O_2$로 분해시킨다. 본 연구에서는 $CO_2$분해 촉매로서 3원계 초미세 페라이트 N $i_{x}$Z $n_{1-x}$F $e_2$ $O_4$와 N $i_{x}$ $Co_{1-x}$F $e_2$ $O_4$를 수열합성법과 공침법 등의 습식 합성법으로 각각 합성하여 이들 분말의 특성과 $CO_2$분해 특성을 고찰하였다. 페라이트의 XRD 결과, 결정구조는 모두 전형적인 스피넬 구조로 동일하게 나타났다. BET 비표면적은 수열합성법으로 제조한 3원계 페라이트의 경우 110$m^2$/g 이상으로 공침법으로 제조한 페라이트보다 비교적 큰 값을 나타냈고 분말 입자크기 또한 약 10nm의 매우 미세한 분말을 얻을 수 있었다. 3원계 산소 결핍 페라이트의 $CO_2$분해 효율은 공침법으로 합성한 것보다 수열합성법으로 합성한 것이 더 우수하게 나타났으며, N $i_{x}$ $Co_{1-x}$F $e_2$ $O_{4-}$$\delta$/보다 N $i_{x}$Z $n_{1-x}$F $e_2$ $O_{4-}$$\delta$/가 우수한 것으로 나타났다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.10a
• /
• pp.1628-1631
• /
• 2015

웹을 통한 다수의 정보서비스와 전산자원을 공동으로 활용하는 경우에 있어서는, 구성자원에 대한 통합과 공동 활용이 상당히 중요한 요소이다. 일반적으로 웹 서비스를 위한 구성요소로서는 Web, WAS, 데이터베이스, 검색엔진 등의 다양한 소프트웨어를 통합, 운영하게 된다. 또한, 투입비용에 대한 효과적인 측면과 서비스 연속성 측면에서 서버의 공유 및 공유 스토로지에 대한 요구를 피할 수 없게 된다. 본 논문에서는 전체적인 서비스의 성능에 커다란 영향을 미치는 Back-end Tier의 검색서버를 통하여, IP 네트워크 기반의 스토리지 I/O에 대한 성능측정을 수행하였고, 그 성능실험의 결과에 따라 해당 애플리케이션에 최적의 스토리지 설계하고, 애플리케이션의 특성별로 최적의 스토리지를 할당하여 정보서비스의 전체적인 성능향상을 이루었다.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.9
• /
• pp.54-62
• /
• 2015

Although NAND flash-based SSD (Solid-State Drive) provides superior performance in comparison to HDD (Hard Disk Drive), it has a major drawback in write endurance. As a result, the lifetime of SSD is determined by the workload and thus it becomes a big challenge in current technology trend of such as the shifting from SLC (Single Level Cell) to MLC (Multi Level cell) and even TLC (Triple Level Cell). Most previous studies have dealt with wear-leveling or improving SSD lifetime regarding hardware architecture. In this paper, we propose the optimal configuration of host I/O stack focusing on file system, I/O scheduler, and link power management using JEDEC enterprise workloads in terms of WAF (Write Amplification Factor) which represents the efficiency perspective of SSD life time especially for host write processing into flash memory. Experimental analysis shows that the optimum configuration of I/O stack for the perspective of SSD lifetime is MinPower-Dead-XFS which prolongs the lifetime of SSD approximately 2.6 times in comparison with MaxPower-Cfq-Ext4, the best performance combination. Though the performance was reduced by 13%, this contributions demonstrates a considerable aspect of SSD lifetime in relation to I/O stack optimization.

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

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.2
• /
• pp.123-130
• /
• 2013

As size of genomic data is increasing rapidly, the needs for high-performance computing system to process and store genomic data is also increasing. In this paper, we captured I/O trace of a system which analyzed 500 million sequence reads data in Genome analysis pipeline for 86 hours. The workload created 630 file with size of 1031.7 Gbyte and deleted 535 file with size of 91.4 GByte. What is interesting in this workload is that 80% of all accesses are from only two files among 654 files in the system. Size of read and write request in the workload was larger than 512 KByte and 1 Mbyte, respectively. Majority of read write operations show random and sequential patterns, respectively. Throughput and bandwidth observed in each processing phase was different from each other.

• Journal of Broadcast Engineering
• /
• v.23 no.5
• /
• pp.606-613
• /
• 2018

This study is concerned with implementing an external memory expansion device for large-scale image processing. It consists of an external memory adapter card with a PCI(Peripheral Component Interconnect) Express Gen3 x8 interface mounted on a graphics workstation for image processing and an external memory board with external DDR(Dual Data Rate) memory. The connection between the memory adapter card and the external memory board is made through the optical interface. In order to access the external memory, both Programmable I/O and DMA(Direct Memory Access) methods can be used to efficiently transmit and receive image data. We implemented the result of this study using the boards equipped with Altera Stratix V FPGA(Field Programmable Gate Array) and 40G optical transceiver and the test result shows 1.6GB/s bandwidth performance.. It can handle one channel of 4K UHD(Ultra High Density) image. We will continue our study in the future for showing bandwidth of 3GB/s or more.