• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.421-425
• /
• 2006

본 논문에서는 TinyOS 기반의 센서 네트워크에 대한 리프로그래밍을 에너지 효율적으로 수행하기 위한 매커니즘을 제안한다. 베이스 스테이션에서 센서노드에게 프로그램 전체를 보내는 대신 이전 버전과의 차이인 델타를 생성해서 전송할 때 Multi-round Rsync 알고리즘을 적용해 델타 파일의 크기를 최대한 줄이는 기법과 업데이트가 불필요한 플래시메모리 페이지에 대한 업데이트를 방지하기 위한 페이지 맵 기법을 통해 Rsync만을 사용하는 기존 방식보다 최대 30% 이상 에너지를 절감할 수 있음을 확인하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.11a
• /
• pp.39-42
• /
• 2004

공간 질의 및 색인에 관한 기존 연구는 주로 실외 환경에 기반을 두고 있다. 실내 환경은 실외 환경과는 달리 질의 특성 및 환경적 요소가 다르다. 실내 환경 질의의 대표적인 특징은 객체의 현재 위치를 파악하고 즉시 응답해야하며, 질의 범위도 지역적으로 제한되어 있는 점이다. 본 논문에서는 기존 연구가 가진 문제점을 해결하기 위해 메인 메모리 기반의 DBMS를 사용하며, 실내 환경에서 객체의 위치 탐색시 효율적으로 적응할 수 있는 비트맵 인덱스 기법을 제안한다.

• Journal of KIISE:Databases
• /
• v.31 no.3
• /
• pp.331-339
• /
• 2004

XML has got to be a new standard for data representation and exchanging by its many good points, and the core part of many new researches and emerging technologies. However, the self-describing characteristic, which is one of XML's good points, caused the spreading of XML documents with different structures, and so the need of the research for the effective XML-document search has been proposed. This paper is for the analysis of the problem in BitCube, which is a bitmap indexing that shows high performance grounded on its fast retrieval. In addition, to resolve the problem of BitCube, we did design and implement xPlaneb(XML Plane Web) which it a new 3-dimensional bitmap indexing made of linked lists. We propose an effective information retrieval technique by replacing BitCube operations with new ones and reconstructing 3-dimensional array index of BitCube with effective nodes. Performance evaluation shows that the proposed technique is better than BitCube, as the amount of document increases, in terms of memory consumptions and operation speed.

• Journal of Korea Multimedia Society
• /
• v.9 no.2
• /
• pp.244-254
• /
• 2006

This paper presents an efficient hybrid technique to compact the trie indexing the huge forward table small enough to be stored into cache for speeding up IP lookup. It combines two techniques, an encoding scheme called bit-map and a controlled-prefix expanding scheme to replace slow memory search with few fast-memory accesses and computations. For compaction, the bit-map represents each index and child pointer with one bit respectively. For example, when one node denotes n bits, the bit-map gives a high compression rate by consumes $2^{n-1}$ bits for $2^n$ index and child link pointers branched out of the node. The controlled-prefix expanding scheme determines the number of address bits represented by all root node of each trie's level. At this time, controlled-prefix scheme use a dynamic programming technique to get a smallest trie memory size with given number of trie's level. This paper proposes standard that can choose suitable trie structure depending on memory size of system and the required IP lookup speed presenting optimal memory size and the lookup speed according to trie level number.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.5
• /
• pp.1145-1153
• /
• 2013

Android mobile platform copy the class files of all applications installed in android platform and keep them into one directory. But to add the service library into a platform, Android must generate a new binary image of platform and replace the platform because android refer the libraries using the memory-mapped file method in a directory. And this memory-mapped file reference method waste the storage space of mobile device because that directory include the duplicated libraries if the libraries refered by application are duplicated, Therefore a dynamic reconfiguration method on android mobile platform is needed to manage the service libraries of application executed on android platform and support the version management and function addition/modification. In this paper, we propose the platform dynamic reconfiguration method to add dynmically the service libraries on android platform.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.2
• /
• pp.259-266
• /
• 2021

USB bus not only works with convenience but also transmits data fast and becomes a standard peripheral interface between FPGA development board and personal computer. In this paper FPGA verification system with slave FIFO interface for Cypress FX3 USB 3 bridge chip was implemented. The designed slave FIFO interface consists of host interface module based on FIFO structure, master bus controller and command decoder and supports streaming communication interface for FX3 bridge chip and memory-mapped input and output interface for user design circuit. The ZestSC3 board with Cypress FX3 USB 3 bridge chip and Xilinx Artix FPGA(XC7A35T-1C5G3241) was used to implement FPGA verification system. It was verified that the FPGA verification system for user design circuit operated correctly under various clock frequencies using GUI software developed by visual C# and C++ DLL. The designed slave FIFO interface for FPGA verification system has modular structure and can be applicable to the different user designs with memory-mapped I/O interface.

• Journal of Korea Game Society
• /
• v.12 no.5
• /
• pp.67-78
• /
• 2012

Summed area table allows filtering of arbitrary-width box regions for every pixel in constant time per pixel. This characteristic makes it beneficial in image processing applications where the sum or average of the surrounding pixel intensity is required. Although calculating the summed area table of an image data is primarily a memory bound job consisting of row or column-wise summation, previous works had to endure excessive access to the high latency global memory in order to exploit data parallelism. In this paper, we propose an efficient algorithm for generating the summed area table in the GPGPU environment where the input is decomposed into square sub-images with intermediate data that are propagated between them. By doing so, the global memory access is almost halved compared to the previous methods making an efficient use of the available memory bandwidth. The results show a substantial increase in performance.

• Journal of KIISE
• /
• v.41 no.9
• /
• pp.674-685
• /
• 2014

The Knowledge service system needs to infer a new knowledge from indicated knowledge to provide its effective service. Most of the Knowledge service system is expressed in terms of ontology. The volume of knowledge information in a real world is getting massive, so effective technique for massive data of ontology is drawing attention. This paper is to provide the method to infer massive data-ontology to the extent of RDFS, based on cloud computing environment, and evaluate its capability. RDFS inference suggested in this paper is focused on both the method applying MapReduce based on RDFS meta table, and the method of single use of cloud computing memory without using MapReduce under distributed file computing environment. Therefore, this paper explains basically the inference system structure of each technique, the meta table set-up according to RDFS inference rule, and the algorithm of inference strategy. In order to evaluate suggested method in this paper, we perform experiment with LUBM set which is formal data to evaluate ontology inference and search speed. In case LUBM6000, the RDFS inference technique based on meta table had required 13.75 minutes(inferring 1,042 triples per second) to conduct total inference, whereas the method applying the cloud computing memory had needed 7.24 minutes(inferring 1,979 triples per second) showing its speed twice faster.

• Journal of Korea Multimedia Society
• /
• v.9 no.10
• /
• pp.1257-1265
• /
• 2006

As XML is increasingly used, the need of researches which are related with XML in various fields is also augmented. Many XML document management systems have been actively developed especially for the storage, processing and retrieval of XML documents. The BitCube is a three dimensional bitmap index system that could be manipulated efficiently and improves the performance of document retrieval. However, the site of index is increase rapidly, when a new bit is added to the axis. This problem is caused by its three dimensional memory structure with document, path and word. We suggest a path combining strategy of XML documents in this paper to solve the problem of BitCube that mentioned above. To reduce the size of index, our approach combines sibling nodes that has same ancestor paths, and transforms word axis into value axis. The method reduces the size of index, when the system com poses the three dimensional bitmap index. It also improves the speed of retrieving, and takes efficiency in storage space.

• The KIPS Transactions:PartA
• /
• v.11A no.2
• /
• pp.129-142
• /
• 2004

As the Internet gets faster, the demand for high-speed routers that are capable of forwarding more than giga bits of data per second keeps increasing. In the previous research, Bitmap Trie algorithm was developed to rapidly execute LPM(longest prefix matching) process which is Well known as the Severe performance bottleneck. In this paper, we introduce a novel algorithm that drastically enhanced the performance of Bitmap. Trie algorithm by applying three techniques. First, a new table called the Count Table was devised. Owing to this table, we successfully eliminated shift operations that was the main cause of performance degradation in Bitmap Trie algorithm. Second, memory utilization was improved by removing redundant forwarding information from the Transfer Table. Lastly. the range of prefix lookup was diversified to optimize data accesses. On the other hand, the processing delays were classified into three categories according to their causes. They were, then, measured through the execution-driven simulation that provides the higher quality of the results than any other simulation techniques. We tried to assure the reliability of the experimental results by comparing with those that collected from the real system. Finally the Enhanced Bitmap Trie algorithm reduced 82% of time spent in previous algorithm.