• Journal of Advanced Navigation Technology
• /
• v.14 no.5
• /
• pp.767-774
• /
• 2010

Due to advantages of NAND flash memory such as non-volatility, low access latency, low energy consumption, light weight, small size and shock resistance, it has become a better alternative over traditional magnetic disk drives, and has been widely used. Traditional DBMSs including mobile DBMSs may run on flash memory without any modification by using Flash Translation Layer (FTL), which emulates a random access block device to hide the characteristics of flash memory such as "erase-before-update". However, most existing FTLs are optimized for file systems, not for DBMSs, and traditional DBMSs are not aware of them. Also, traditional DBMSs do not consider the characteristics of flash memory. In this paper, we propose a flash-conscious storage system for DBMSs that utilizes flash memory as a main storage medium, and carefully put the characteristics of flash memory into considerations. The proposed flash-conscious storage system exploits log records to avoid costly update operations. It is shown that the proposed storage system outperforms the state.

• Journal of Internet Computing and Services
• /
• v.12 no.5
• /
• pp.63-72
• /
• 2011

Binary translation is a kind of the emulation method which converts a binary code compiled on the particular instruction set architecture to the new binary code that can be run on another one. It has been mostly used for migrating legacy systems to new architecture. In recent, binary translation is used for instrumenting programs without modifying source code, because it enables inserting additional codes dynamically, For general application, there already exists some instrumentation software using binary translation, such as dynamic binary analyzers and virtual machine monitors. On the other hand, in order to be benefited from binary translation in kernel-level, a few issues, which include system performance, memory management, privileged instructions, and synchronization, should be treated. These matters are derived from the structure of the kernel, and the difference between the kernel and user-level application. In this paper, we present a scheme to apply binary translation and dynamic instrumentation on kernel. We implement it on Linux kernel and demonstrate that kernel-level binary translation adds an insignificant overhead to performance of the system.

• Journal of Digital Contents Society
• /
• v.12 no.2
• /
• pp.141-150
• /
• 2011

Recently the Solid State Drive (SSD) is widely used for storage system of various mobile devices. In this case, existing buffer replacement algorithms based on the hard disk do not consider characteristics of flash memory, so it caused performance degradation of the system. This paper proposes a novel buffer replacement policy called ABM (Asymmetric Buffer Management) policy. ABM policy separates read and write buffer space and applies different replacement unit and replacement algorithm for each buffer. In addition, write buffer delay scheme and dynamic size adaptation algorithm is applied for better performance. ABM outperforms other replacement policies, especially ABM-LRU-CLC shows 32% better performance than normal LRU policy.

• Spatial Information Research
• /
• v.19 no.3
• /
• pp.43-52
• /
• 2011

Recently, interest in location-based service (LBS) which utilizes a DBMS in mobile system environment has been increasing, and it is expected to overcome the existing file-based system's limitation in advanced in-vehicle system by utilizing DBMS's advantages such as efficient storage, transaction management, modelling and spatial queries etc. In particular, the road network data corresponds to the most essential domain in a route planning system, which needs efficient management and maintenance. Accordingly, this study aims to develop an efficient graph-based geodata model for topological network data and to support dynamic path computation algorithm based on heuristic approach in mobile LBS system. To achieve this goal, we design a data model for supporting the hierarchy of network, and implement a path planning system to evaluate its performance in mobile LBS system. Last but not least, we find out that the designed path computation algorithm with hierarchical graph model reduced the number of nodes used for finding and improved the efficiency of memory.

• Journal of IKEEE
• /
• v.5 no.1 s.8
• /
• pp.100-110
• /
• 2001

In this paper, we investigated several buffer management schemes for the design of shared-memory type ATM switches, which can enhance the utilization of switch resources and can support quality-of-service (QoS) functionalities. Our results show that dynamic threshold (DT) scheme demonstrate a moderate degree of robustness close to pushout(PO) scheme, which is known to be impractical in the perspective of hardware implementation, under various traffic conditions such as traffic loads, burstyness of incoming traffic, and load non-uniformity across output ports. Next, we considered buffer management strategies to support QoS functions, which utilize parameter values obtained via connection admission control (CAC) procedures to set tile threshold values. Through simulations, we showed that the buffer management schemes adopted behave well in the sense that they can protect regulated traffic from unregulated cell traffic in allocating buffer space. In particular, it was observed that dynamic partitioning is superior in terms of QoS support than virtual partitioning.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10b
• /
• pp.388-392
• /
• 2007

계속적으로 변화하는 방대한 양의 EMS 데이터를 실시간 취득하여, 사용자가 원하는 데이터만 추출해서 원하는 포맷으로 저장하여 추후 활용할 수 있는 HDMS 시스템에 대하여 소개한다. HDMS 시스템은 K-EMS 과제의 일부분으로 개발되었다. 공유메모리를 사용하여 데이터를 처리하는 실시간 DBMS로부터 추출된 대용량 데이터를 고속으로 디스크 DBMS로 입력하고, 데이터 손실에 대한 Risk를 감소시키기 위하여 동적인 파티션 추가삭제를 통하여 자동으로 분산저장하며, 자동 백업 기능을 제공하여 사용자의 편의성을 증진한다. 데이터를 장기간 보관하고, 보관된 데이터에 대한 데이터 검색 기능을 제공하기 위하여 백업과 관련된 메타데이터를 관리한다. 관리된 메타데이터를 이용하여 사용자의 요구에 의해 백업파일을 시스템에 자동으로 복구하여 온라인 보관주기가 경과한 데이터에 대해 조회가 가능하도록 한다. HDMS시스템은 CIM 기반으로 데이터베이스가 구축되어 향후 K-EMS 외의 타 시스템과의 데이터 통합 및 연계가 용이하고 여러 분야에서 데이터 재활용이 가능할 것으로 예상된다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.3
• /
• pp.181-190
• /
• 2009

Module is an object file that can be loaded into operating system dynamically and has complete privileged access to all resources in kernel. Therefore trivial misuses in a module may cause critical system halts or deadlock situations. In this paper, we propose Kernel Resource Protector(KRP) scheme to reduce the various problems caused by module. KRP provides protections of a variety of kernel resources such as memory, major number and work queue resource. We implement the scheme onto linux kernel 2.6.18, and experimental results show that our scheme can protect kernel resources effectively.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.6
• /
• pp.1625-1635
• /
• 1997

An extension of the weighted buddy system, called the extended-weighted buddy system, for dynamic memory allocation in an object-oriented computer is presented. The extended-weighted buddy system allows block sizes of $2^k,\;3*2^k,\;5*2^k,\;7*2^k$, whereas the original weighted buddy system allowed block sizes of $2^k\;and\;3*2^k$. This extension is achieved at only the cost of additional 3 bits per block for memory management unit. Simulation results are presented which compare our method with the weighted buddy system. These results indicate that, for uniform request distributions, our system has less internal memory fragmentation than the weighted buddy system(approximately 60%). And, for exponential request distributions, it has less internal memory fragmentation than the weighted buddy method (approximately 50%). The external fragmentation is greater for this system than the weighted buddy system. But, our system has less total memory fragmentation for exponential request distributions, and two systems take a similar total memory fragmentation for uniform request distributions, so we can substitutes the extended-weighted buddy system for weighted buddy system.

• Journal of Korea Society of Industrial Information Systems
• /
• v.16 no.1
• /
• pp.37-48
• /
• 2011

Sensor networks monitor the environment, collect sensed data, and relay the data back to a collection point. Although sensor nodes have very limited hardware resources, they require an operating system that can provide efficient resource management and various application environments. In addition, the wireless sensor networks require the code update previously deployed to patch bugs in program and to improve performance of kernel service routines and application programs. This paper presents EPRCU (Easy to Perform Remote Code Update), a new operating system for wireless sensor nodes, which has enhanced functionalities to perform remote code update. To achieve an efficient code update, the EPRCU provides dynamic memory allocation and program memory management. It supports the event-driven kernel, which uses priority-based scheduling with the application of aging techniques. Therefore, the proposed operating system is not only easy to perform wireless communication with the remote code update but also suitable for various sensor network applications.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.199-201
• /
• 2006

소형 모바일 디바이스는 일반적으로 배터리로 동작하는 등 전력제한적이며 시스템 메모리 및 자원 제약적이다. 또한 소형 모바일 디바이스에서 실행되는 응용프로그램은 일반적으로 시스템의 일부 기능만을 이용하여 수행된다. 따라서 본 연구에서는 시스템에서 제공하는 서비스를 각각의 컴포넌트로 구현하고 응용프로그램의 요구에 따라 소프트웨어 플랫폼을 동적으로 재구성할 수 있는 소프트웨어 플랫폼을 설계 및 구현하였다. 구현한 플랫폼을 웨어러블 컴퓨터 보드에 포팅하여 정상 동작함을 확인하였다.