• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.5
• /
• pp.272-284
• /
• 2010

Flash Memory differs from the hard disk, because it cannot be overwritten. Most of the flash memory file systems use not-in-place update mechanisms for the update. Flash memory file systems execute sometimes block cleaning process in order to make writable space while performing not-in-place update process. Block cleaning process collects the invalid pages and convert them into the free pages. Block cleaning process is a factor that affects directly on the performance of the flash memory. Thus this paper suggests the efficient page allocation method, which reduces block cleaning cost by minimizing the numbers of block that has valid and invalid pages at a time. The result of the simulation shows an increase in efficiency by reducing more block cleaning costs than the original YAFFS.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.1
• /
• pp.136-140
• /
• 2015

Linux environment that is commonly used at embedded systems supports various file systems as Ext2, FAT, NTFS, etc. The file system that is equiped on the embedded system is mostly implemented on mini hard disk or flash memory. The types of the file system of the system make an effect on the performance of a application programs. The factors of file system performance on a same media are block read, block write and block free time. On these factors, block read and block free time are not so different according to the type of file systems. This paper evaluates the performance benchmark of file systems supported by linux about block allocation and write performance. The results obtained from various experiments shows the characteristics of each file system.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.16 no.1
• /
• pp.24-32
• /
• 2023

The current Private 5G use procedure goes through the step of application examination, use and usage inspection, and can be divided in to application, examination step as a procedure before frequency allocation, and use, usage inspection step as a procedure after frequency allocation. Various types of documents are required to apply for a Private 5G, and due to the document screening process and radio station inspection for using Private 5G frequencies, the procedure for Private 5G applicants to use Private 5G is complicated and takes a considerable amount of time. In this paper, we proposed Frequency Allocation Process for Private 5G using a blockchain platform, which is fast and simplified than the current procedure. Through the use of a blockchain platform and NFT (Non-Fungible Token), reliability and integrity of the data required in the frequency allocation process were secured, and security of frequency usage information was maintained and a reliable Private 5G frequency allocation process was established. Also by applying the RPA system that minimizes human intervention, fairness was secured in the process of allocating Private 5G. Finally, the frequency allocation process of Private 5G based on the Ethereum blockchain was performed though a simulation.

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

In this paper, we propose a new page allocation scheme for flash memory file system. The proposed scheme allocates pages by exploiting the concept of Purity, which is defined as the fraction of blocks where valid Pages and invalid Pages are coexisted. The Pity determines the cost of block cleaning, that is, the portion of pages to be copied and blocks to be erased for block cleaning. To enhance the purity, the scheme classifies hot-modified data and cold-modified data and allocates them into different blocks. The hot/cold classification is based on both static properties such as attribute of data and dynamic properties such as the frequency of modifications. We have implemented the proposed scheme in YAFFS and evaluated its performance on the embedded board equipped with 400MHz XScale CPU, 64MB SDRAM, and 64MB NAND flash memory. Performance measurements have shown that the proposed scheme can reduce block cleaning time by up to 15.4 seconds with an average of 7.8 seconds compared to the typical YAFFS. Also, the enhancement becomes bigger as the utilization of flash memory increases.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2000.05a
• /
• pp.342-347
• /
• 2000

새로운 칼라 영상 압축은 순간 포착과 블록절단 코딩에 기초로 두 개의 대표적인 칼라 중 하나로 할당된 각각의 블록 화소와 겹치지 않은 블록으로 분할된 입력은 블록에서 포착된 어떤 순간으로부터 유래된 해석방식으로 계산된다. 비트맵은 화소의 칼라를 묘사하기 위해 각각의 블록을 일반화하며 별개의 균일한 조건에 의해 설정된 대표적인 칼라는 동일하다고 간주되고 부호 비트를 저장하기 위해 이용된다. 본 연구에서 실험결과에 의해 13이상의 좋은 평균 압축률이 달성될 수 있었다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06a
• /
• pp.559-561
• /
• 2011

멀티코어 환경에서는 공유 데이터에 대한 동기화로 인한 병목 현상이 중요한 문제점 중의 하나이다. 그리고 동적 메모리 할당자는 대량의 메모리를 할당 및 해제하는 프로그램에서 공유 데이터에 대한 동기화 문제로 성능 저하를 유발시키고 있다. 이를 해결하기 위해 다양한 lock-free 메모리 할당 기법들이 소개되었지만 false sharing과 heap blow-up과 같은 여러 가지 문제점들을 가지고 있다. 이에 본 논문에서는 새로운 연속할당 기법을 제안하고, 이를 이용하여 동일 블록 내의 오브젝트 할당/해제에 따른 동기화 문제를 해결함으로써 효과적인 lock-free 메모리 할당 기법을 제안하였다. 그리고 제안 기법을 구현하여 기존의 메모리 할당 기법들과 실험을 통하여 검증하였으며, 대량의 메모리를 사용하는 멀티 스레드 환경에서 특히 좋은 성능을 보이는 것을 확인하였다.

• Journal of Convergence Society for SMB
• /
• v.4 no.1
• /
• pp.1-6
• /
• 2014

PB/MC-CDMA is an efficient system which divides the whole frequency band into several blocks, unlike a conventional MC-CDMA system. We propose an efficient resource allocation scheme in Multi-Block PB/MC-CDMA (Partial Block Multi-Carrier Code Division Multiple Access). This system aims to improve frequency efficiency and maximize the total throughput while satisfying predefined threshold over various channel conditions. Through computer simulations, we confirm that the performance of the proposed system is more effective in terms of throughput.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.2C
• /
• pp.200-208
• /
• 2009

A macroblock layer rate control for H.264/AVC has the problem that allocated target bits for current frame occasionally are exhausted too fast due to inadequate quantization parameter assignment. In this case, the maximum permissible quantization parameter is used to encode for remaining macroblocks and it leads to degradation of the visual quality. In addition, the header bits length estimation algorithm used for quantization parameter assignment takes the average header bits length for the encoded macroblocks of the previous frame and the current frame. Therefore, it generates a big mismatch between the actually generated header bits length and the estimated header bits length. In this paper, we propose adaptive quantization parameter decision method to prevent early exhausting target bits during encoding the current frame by considering the number of macroblocks that have negative targets bits in previous frame and the improved header bits length estimation scheme for accurate quantization parameter decision.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.3
• /
• pp.324-336
• /
• 2000

The paper proposes an efficient buffer management scheme to enhance performance of the disk I/O system. Without any user level information, the proposed scheme automatically detects the block reference patterns of applications by associating block attributes with forward distance of a block. Based on the detected patterns, the scheme applies an appropriate replacement policy to each application. We also present a new block allocation scheme to improve the performance of buffer cache when kernel needs to allocate a cache block due to a cache miss. The allocation scheme analyzes the cache hit ratio of each application based on block reference patterns and allocates a cache block to maximize cache hit ratios of system. These all procedures are performed on-line, as well as automatically at system level. We evaluate the scheme by trace-driven simulation. Experimental results show that our scheme leads to significant improvements in hit ratios of cache blocks compared to the traditional schemes and requires low overhead.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2012.06a
• /
• pp.237-239
• /
• 2012

이적작업은 자동화 컨테이너 터미널에서 하역작업의 생산성을 높이는 중요한 운영 전략 중의 하나이다. 이는 장치장 크레인의 이동시간과 재작업을 줄이기 위해 장치장 블록 내 컨테이너들의 재배치하는 작업을 의미한다. 이적작업은 주로 크레인의 유휴시간에 수행되며 장치장 크레인의 추가적인 하역 작업을 요구한다. 이적작업계획이 수립된 후 작업할당 문제가 다루어진다. 크레인 작업할당 문제는 작업가능시간에 대한 제약을 고려하여 이적작업의 효과를 최대화시키기 위해 장치장 크레인이 처리할 이적작업을 선정하고 이들의 작업순서를 정하는 것이다. 본 연구는 혼합정수계획법을 이용하여 장치장 크레인의 작업할당 문제를 모형화 하고 실효적인 이용을 위해 수치실험을 통해 여러 작업할당 규칙의 수행도를 비교분석하였다.