• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.1
• /
• pp.91-95
• /
• 2008

Flash memory is widely used in embedded systems because of its benefits such as non-volatile, shock resistant, and low power consumption. But NAND flash memory suffers from out-place-update, limited erase cycles, and page based read/write operations. To solve these problems, log-structured filesystem was proposed such as YAFFS. However, YAFFS sequentially retrieves an array of all block information to allocate free block for a write operation. Also before the write operation, YAFPS read the array of block information to find invalid block for erase. These could reduce the performance of the filesystem. This paper suggests fast operation method for NAND flash filesystem that solves the above-mentioned problems. We implemented the proposed methods in YAFFS. And we measured the performance compared with the original technique.

• Journal of the Institute of Convergence Signal Processing
• /
• v.7 no.3
• /
• pp.136-142
• /
• 2006

Existing buffer management schemes for shared-memory output queueing switches can be classified into two types: In the first type, some constant amount of memory space is guaranteed to each virtual queue using static queue thresholds. The static threshold method (ST) belongs to this type. On the other hand, the second type of approach tries to maximize the buffer utilization in 머 locating buffer memories. The complete sharing (CS) method is classified into this type. In the case of CS, it is very hard to protect regular traffic from mis-behaving traffic flows while in the case of ST the thresholds can not be adjusted according to varying traffic conditions. In this paper, we propose a new buffer management method called weighted dynamic thresholds (WDT) which can process packet flows based on loss priorities for quality-of-service (QoS) functionalities with fairly high memory utilization factors. We verified the performance of the proposed scheme through computer simulations.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.17 no.5 s.108
• /
• pp.408-415
• /
• 2006

This paper suggests an improved system-level model of RF power amplifiers(PAs) including memory effects, and validates the suggested model by analyzing the power spectral density of the output signal with a predistortion linearizer. The original three-box(Wiener-Hammerstein) model uses input and output filters to capture RF frequency response of PAs. The adjacent spectral regrowth that occurs in three-box model can be perfectly removed by Hammerstein structure predistorter. However, the predistorter based on Hammerstein structure achieves limited performance in real PA applications due to other memory effects except RF frequency response. The spectrum of the output signal can be predicted accurately using the suggested model that changes a memoryless block in a three-box model with a memory polynomial. The proposed model accurately predicts the output spectrum density of PA with Hammerstein structure predistorter with less than 2 dB errors over ${\pm}30$ MHz adjacent channel ranges for IEEE 802.11 g WLAN signal.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.4
• /
• pp.82-88
• /
• 2009

Video proxy server which is located near clients can store the frequently requested video data in storage space in order to minimize initial latency and network traffic significantly. However, due to the limited storage space in video proxy server, an appropriate video selection method is needed to store the videos which are frequently requested by users. Thus, we present a virtual caching technique to efficiently store the video in video proxy server. For this purpose, we employ a virtual memory in video poky server. If the video is requested by user, it is loaded in virtual memory first and then, delivered to the user. A video which is loaded in virtual memory is deleted or moved into the storage space of video poxy sewer depending on the request condition. In addition, virtual memory is divided into each segment area in order to store the segments efficiently and to avoid the fragmentation. The simulation results show that the proposed method performs better than other methods in terms of the block hit rate and the number of block deletion.

• Journal of KIISE:Databases
• /
• v.36 no.1
• /
• pp.1-7
• /
• 2009

Flash memory has its unique characteristics: i.e., (1) the write operation is much more costly than the read operation. (2) In-place updating is not allowed. In this paper, we first analyze how these characteristics affect the performance of record management in flash memory, and discuss the problems with previous methods for record management when they are applied to flash memory environment. Next, we propose a new record management method to be suitable for flash memory environment. The proposed method employs a new concept of a container that makes it possible to overwrite data on flash memory several times when performing insertions, deletions, and modifications of records. As a result, this method reduces the number of overwrite operations, and consequently does the number of erase operations. The results of experiments show that our method improves the performance by up to 34%, compared with the previous one.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.15 no.2
• /
• pp.237-249
• /
• 2002

The wall system that is composed only of reinforced concrete walls and slabs is adopted on many high-rise apartment buildings recently constructed. In the apartment buildings, a shear wall may have one or mote openings for functional reasons. Many researches on the analysis of shear wall with openings were performed. But, some restrictions prevent those research results being applied to practical analysis and design procedure. It is necessary to use subdivided finite elements lot accurate analysis of the wall system with openings. But it would cost tremendous amount of analysis time and computer memory if the entire building structure is subdivided into a finer mesh. An efficient analysis method which can be used regardless of the number, size and location of openings is proposed in this study. The analysis method uses super element, matrix condensation technique and fictitious beam technique. Analyses of example structures having various types of openings were performed to verify the efficiency of proposed method. It was confirmed that the proposed method have outstanding accuracy with drastically reduced time and computer memory from the analyses of example structures.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.4
• /
• pp.1098-1105
• /
• 1999

The caches in distributed shared memory systems enhance the performance by reducing memory access latency and communication overhead, but they must solve the cache coherence problem. This paper proposes a new directory protocol to solve the cache coherence problem and to improve the system performance in distributed shared memory systems. To maintain the cache coherence of shared data, processors within a limited distance reduce the communication overhead by using a bit-vector like the full directory scheme. Processors over a limited distance store pointers in a directory pool. Since the bit-vector and the directory pool remove the unnecessary cache invalidations, the proposed scheme reduces the communication traffic and improves the system performance. The dynamic limited directory scheme reduces the communication traffic up to 66 percents compared with the limited directory scheme and the number of directory access up to 27 percents compared with the dynamic pointer allocation scheme.

• The Journal of the Korea Contents Association
• /
• v.22 no.6
• /
• pp.56-68
• /
• 2022

Recently, as the demand for real-time processing increases, studies on a dynamic graph that changes over time has been actively done. There is a connected components processing algorithm as one of the algorithms for analyzing dynamic graphs. GPUs are suitable for large-scale graph calculations due to their high memory bandwidth and computational performance. However, when computing the connected components of a dynamic graph using the GPU, frequent data exchange occurs between the CPU and the GPU during real graph processing due to the limited memory of the GPU. The proposed scheme utilizes the Weighted-Quick-Union algorithm to process large-scale graphs on the GPU. It supports fast connected components computation by applying the size to the connected component label. It computes the connected component by determining the parts to be recalculated and minimizing the data to be transmitted to the GPU. In addition, we propose a processing structure in which the GPU and the CPU execute asynchronously to reduce the data transfer time between GPU and CPU. We show the excellence of the proposed scheme through performance evaluation using real dataset.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.2
• /
• pp.338-344
• /
• 1994

Price`s theorem is generalized for general zero memory nonlinear function when input are drawn from a sum, called the constrained non-Gaussian, of two or more mutually independent processes of which the first is the Gaussian. An example is given to illustrate the applicability of the generalization.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10d
• /
• pp.145-147
• /
• 2002

본 논문에서는 내장형 리눅스 기반의 PDA(Personal Digital Assistants)를 위한 MPEG-4 비디오 재생기를 제안한다. PDA는 CPU 및 메인 메모리, 디스플레이 장치가 일반 PC에 비해 제한적이다. 현재 다양한 멀티미디어 데이터를 처리하기 위해 WinCE, Epoc, VxWorks과 같은 운영체제들이 개발되었으나, 운영체제의 크기가 크고 상용이라서 구입비용이 많이 드는 문제가 있다. 또, 기존의 MPEG-1, MPEG-2 같은 비디오 데이터는 1편의 영화를 감상하기에는 데이터의 크기가 커서 자원이 제한된 PDA에서 재생하기가 어렵다. 따라서, 본 논문에서는 실시간 운영체제인 내장형 리눅스를 탑재하여 PDA의 제한된 자원을 효율적으로 사용하도록 하며, 데이터 압축률이 뛰어난 MPEG-4 포맷의 비디오를 재생할 수 있는 내장형 리눅스기반의 MPEG-4 비디오 재생기를 제안한다. 제안하는 MPEG-4 비디오 재생기는 화상통신 및 화상회의를 이동 중에 할 수 있다. 또한 PDA를 위한 MPEG-4 스트리밍 서비스를 지원하는 시스템에 적용 가능하다.