• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.699-702
• /
• 2009

저 전력, 내구성, 소형, 빠른 속도 등의 장점을 가지고 있는 플래시 메모리는 생산 기술 발전에 힘입어 센서 노드, 휴대폰, MP3, PMP등의 소형 전자 제품의 저장장치에서부터 SSD형태로 노트북이나 서버에 이르기 까지 그 활용범위가 더욱 확장되어 가고 있다. 다양한 시스템에서 사용될 수 있는 플래시 메모리의 특성상 이에 저장된 데이터의 호환성은 중요한 고려사항이다. 이를 위해 플래시 메모리의 고유한 특성을 숨기고 일반적인 블록장치로 에뮬레이션 해주는 소프트웨어인 FTL과 FAT 파일시스템이 플래시 메모리 관리를 위한 사실상 표준 소프트웨어로써 사용되고 있다. 그러나 범용 컴퓨터를 기반으로 개발된 FTL과 FAT 파일시스템을 열악한 하드웨어로 구성된 시스템에서 구동하는 경우 많은 제약이 발생한다. 따라서 본 논문에서는 이러한 제약사항을 극복하기 위해 최소한의 파일시스템 기능을 제공하는 FAT 표준 호환 FTL을 제안한다. 제안된 기법은 리눅스 운영체제에 동적으로 적재 가능한 모듈형태로 구현되었으며, 실험을 통해 본 논문에서 제안한 기법이 기존 기법 대비 32%의 메모리 공간을 절약할 수 있으며, 동시에 완벽한 FAT 호환성을 제공함을 확인할 수 있었다.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.1
• /
• pp.57-64
• /
• 2009

Recently virtualization has been one of the most popular research topics in system software area. While there already exist many commercial virtualization products for general-purpose computer system, little efforts are made to virtualize embedded system. In this paper, we design and implement a virtual machine monitor which divides each physical hardware resource of a embedded system into logical ones and reorganizes them into many virtual machines, which result in running several real-time operating systems concurrently on a single embedded system. We measure various performance metrics of the virtual machine monitor developed on a real embedded system. The results of the study show that our virtual machine monitor has enough potentiality of its application to real-world embedded systems.

• Journal of Astronomy and Space Sciences
• /
• v.24 no.4
• /
• pp.367-378
• /
• 2007

We present a software which we developed for the multi-purpose CCD camera. This software can be used on the all 3 types of CCD - KAF-0401E ($768{\times}512$), KAF-1602E ($1536{\times}1024$), KAF-3200E ($2184{\times}1472$) made in KODAK Co.. For the efficient CCD camera control, the software is operated with two independent processes of the CCD control program and the temperature/shutter operation program. This software is designed to fully automatic operation as well as manually operation under LINUX system, and is controled by LINUX user signal procedure. We plan to use this software for all sky survey system and also night sky monitoring and sky observation. As our results, the read-out time of each CCD are about 15sec, 64sec, 134sec for KAF-0401E, KAF-1602E, KAF-3200E., because these time are limited by the data transmission speed of parallel port. For larger format CCD, the data transmission is required more high speed. we are considering this control software to one using USB port for high speed data transmission.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.319-330
• /
• 2001

In virtual memory system, when a process attempts to access a page that is not resident in memory, the system generates and handles a page fault that causes unpredictable delay. So virtual memory system is not appropriate for the real-time system, because it can increase the deadline miss ratio of real-time task. In multimedia system, virtual memory system may degrade the QoS(quality of service) of multimedia application. Furthermore, in general-purpose operating system, whenever a new task is dynamically loaded, virtual memory system suffers from extensive page fault that cause transient overloading state. In this paper, we present efficient overloading control mechanism called RBPFH (Rate-Based Page Fault Handling). A significant feature of the RBPFH algorithm is page fault dispersion that keeps page fault ratio from exceeding available bound by monitoring current system resources. Furthermore, whenever the amount of available system resource is changed, the RBPFH algorithm dynamically adjusts the page fault handling rate. The RBPFH algorithm is implemented in the Linux operating system and its performance measured. The results demonstrate RBPFH\`s superior performance in supporting multimedia applications. Experiment result shows that RBPFH could achieve 10%∼20% reduction in deadline miss ratio and 50%∼60% reduction in average delay.

• Journal of the Korean Society for information Management
• /
• v.2 no.2
• /
• pp.115-149
• /
• 1985

The classification systems generally used in library are for the external information such as books and periodicals, so it is difficult to apply them to the internal information of specific organization such as documents and records. Therefore, it is necessary for the information centers of any enterprise or specific organization to found the Record Management System (RMS), and to develop and use the specific classification system which is called the coding system for internal information. Documents and components of nuclear power plant are controlled by coding (numbering) system, but they are different each other greatly. So the coordination of work and the cross reference between components and documents are difficult. In this paper, the unified Record Management Coding System is developed for Nuclear Power Plant unit 7 & 8 in Korea on the basis of the existing document and component coding system. The expected effects are the easy cross reference between components and documents, the effective coordination of work and the consistence of central file.

• KIISE Transactions on Computing Practices
• /
• v.23 no.7
• /
• pp.452-457
• /
• 2017

Linux is a general-purpose operating system that supports several schedulers, allowing different schedulers to coexist. In addition, Linux uses the Control Group (cgroup) to reserve CPU resources for task groups that follow the real-time (SCHED_FIFO, SCHED_RR) and non-real-time (SCHED_NORMAL) scheduler policies, except for the deadline scheduler (SCHED_DEADLINE). The cgroup performs the schedulability analysis to guarantee the reserved CPU resource as much as possible. However, current implementation of the schedulability analysis does not distinguish between deadline tasks and real-time tasks. Therefore, if these deadline tasks and real-time task groups coexist, there is a case where the resource reservation for the real-time task group is rejected. In this paper, we analyze the problems in the schedulability analysis for real-time task groups of Linux cgroups and propose patches to solve these problems.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.4
• /
• pp.410-419
• /
• 2003

The buffer cache of general operating systems such as Linux manages file data by using global block replacement policy and read ahead. As a result, multimedia data with a low locality of reference and various consumption rate have low cache hit ratio and consume additional buffers because of read ahead. In this paper we have designed and implemented a new buffer allocation algorithm for multimedia data on Linux. Our approach keeps one read-ahead cache per every opened multimedia file and dynamically changes the read-ahead group size based on the buffer consumption rate of the file. This distributes resources fairly and optimizes the buffer consumption. This paper compares the system performance with that of Linux 2.4.17 in terms of buffer consumption and buffer hit ratio.

• The Journal of the Korea Contents Association
• /
• v.13 no.3
• /
• pp.22-31
• /
• 2013

For the case of test equipments requiring data accuracy, real-time is highly required in acceptance test for performance evaluation of developed weapons. For convenience' sake, test equipments are usually developed using Windows. However Windows does not support real-time in itself. Thus, in this paper, so as to reduce development time and expenses, we design and implement an integrated middleware for real-time device drivers using RTiK-MP. Using DLL, we also support user API's for the sake of development convenience without details of the complex RTiK-MP structure. We evaluate the performance of the proposed integrated middleware using the RDTSC command which returns the number of CPU clock ticks. The evaluation results show that it operates correctly within error ranges in the periods of 1ms and 4ms for the cases of TCP/IP and RS-232, respectively.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.7
• /
• pp.636-645
• /
• 2008

OneNAND flash is a high-performance hybrid flash memory that combines the advantages of both NAND flash and NOR flash. OneNAND flash has not only all virtues of NAND flash but also greatly enhanced read performance which is considered as a downside of NAND flash. As a result, it is widely used in mobile applications such as mobile phones, digital cameras, PMP, and portable game players. However, most of the general purpose operating systems, such as Linux, can not exploit the read performance of OneNAND flash because of the restrictions imposed by their virtual memory system and block I/O architecture. In order to solve that problem, we suggest a new approach called virtual I/O segment. By using virtual I/O segment, the superior read performance of OneNAND flash can be exploited without modifying the existing block I/O architecture and MTD subsystem. Experiments by implementations show that this approach can reduce read latency of OneNAND flash as much as 54%.

• Journal of KIISE:Databases
• /
• v.35 no.3
• /
• pp.199-207
• /
• 2008

The FP-tree(Frequency Pattern Tree) mining association rules algorithm was proposed to improve mining performance by reducing DB scan overhead dramatically, and it is recognized that the performance of it is better than that of any other algorithms based on different approaches. But the FP-tree algorithm needs a few more memory because it has to store all transactions including frequent itemsets of the DB. This paper implements a FP-tree algorithm on a general purpose UNK system and compares it with the DHP(Direct Hashing and Pruning) algorithm which uses hash tree and direct hash table from the point of memory usage and execution time. The results show surprisingly that the FP-tree algorithm is poor than the DHP algorithm in some cases even if the system memory is sufficient for the FP-tree. The characteristics of the test data are as follows. The site of DB is look, the number of total items is $1K{\sim}7K$, avenrage length of transactions is $5{\sim}10$, avergage size of maximal frequent itemsets is $2{\sim}12$(these are typical attributes of data for large-scale convenience stores).