• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.1
• /
• pp.19-26
• /
• 2010

In this paper, we adopt Storage Class Memory, which is next-generation non-volatile RAM technology, as part of main memory parallel to DRAM, and exploit the SCM+DRAM main memory system from the dependability perspective. Our system provides instant system on/off without bootstrapping, dynamic selection of process persistence or non-persistence, and fast recovery from power and/or software failure. The advantages of our system are that it does not cause the problems of checkpointing, i.e., heavy overhead and recovery delay. Furthermore, as the system enables full application transparency, our system is easily applicable to real-world environments. As proof of the concept, we implemented a system based on a commodity Linux kernel 2.6.21 operating system. We verify that the persistence enabled processes continue to execute instantly at system off-on without any state and/or data loss. Therefore, we conclude that our system can improve availability and reliability.

• Journal of IKEEE
• /
• v.23 no.1
• /
• pp.80-90
• /
• 2019

Even though Non-Volatile Memory (NVM) is used for data storage, a page table should be built to access data in it. And this observation leads us to the Persistent Page Table (PPT) scheme that keeps the page table in NVM persistently. By the way, processors have different page table structures and really operational page table cannot be built without virtual and physical addresses of NVM. However, those addresses are determined dynamically when NVM storage is attached to the system. Thus, the PPT should have system-independent and also address-independent structure and really working system-dependent page table should be built from the PPT. Moreover, entries of PPT should be updated atomically and, in this paper, we describe the design of PPT that meets those requirements. And we investigate how file systems can decrease the journaling overhead with the swap operation, which is a new operation created by the PPT. We modified the Ext4 file system in Linux and experiments conducted with Filebench workloads show that the swap operation enhances file system performance up to 60%.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.1
• /
• pp.71-76
• /
• 2022

Buffer cache bridges the performance gap between memory and storage, but its effectiveness is limited due to periodic flush, performed to prevent data loss in smartphones. This paper shows that selective flushing technique with small persistent memory can reduce the flushing overhead of smartphone buffer cache significantly. This is due to our I/O analysis of smartphone applications in that a certain hot data account for most of file writes, while a large proportion of file data incurs single-writes. The proposed selective flushing policy performs flushing to persistent memory for frequently updated data, and storage flushing is performed only for single-write data. This eliminates storage write traffic and also improves the space efficiency of persistent memory. Simulations with popular smartphone application I/O traces show that the proposed policy reduces write traffic to storage by 24.8% on average and up to 37.8%.

• Journal of KIISE
• /
• v.43 no.2
• /
• pp.152-162
• /
• 2016

Most traditional garbage collectors commonly use the language level metadata, which is designed for pointer type searching. However, because it is difficult to use this metadata in non-volatile memory allocation platforms, a new garbage collection technique is essential for non-volatile memory utilization. In this paper, we design new metadata for managing information regarding non-volatile memory allocation called "Allocation Tree". This metadata is comprised of tree data structure for fast information lookup and a node that holds an allocation address and an object ID pair in key-value form. The Garbage Collector starts collecting when there are insufficient non-volatile memory spaces, and it compares user data and the allocation tree for garbage detection. We develop this algorithm in a persistent heap based non-volatile memory allocation platform called "HEAPO" for demonstration.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.5
• /
• pp.468-476
• /
• 2000

Binding the object-oriented programming language C++ with a database management system provides a persistency to C++ programming objects so that objects can persist after program termina~,on. In such a binding system, we can manage a persistent object same as that we use a transient object and also use database management facilities such as transaction management and concurrency control. This paper presents a method providing the persistency to C++ programming objects in the binding system. We propose an improved interface based on C++ binding of ODMG-97 and present the design and implementation technique of it. The proposed interface provides a seamless interface for creating objects of the persistent capable class. We can create a persistent object without its class name as we do not give a class name when creating a transient object. Also, we guarantee the type compatibilty between the obiect created in database and the obiect created in main memory.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.793-795
• /
• 2005

영속적인 데이터 저장이 가능한 차세대 비휘발성 메모리를 휘발성 메모리와 혼용하여 버퍼캐처로 사용하면, 안정성과 성능향상의 효과를 얻을 수 있다. 본 연구에서는 기존의 연구에서 제시한 캐처관리 정책을 시뮬레이터를 이용하여 실험하고 실험 결과를 분석하여 비휘발성 메모리가 추가된 캐처의 새로운 특성을 밝혀냈다. 비휘발성 메모리가 캐쉬에 포함되면 읽기 쓰기의 요청의 종류, 미스(miss)되었을 경우 캐쉬될 블록의 더티(dirty)여부, 읽기 요청이 적중(hit)되었을 때, 적중된 블록의 메모리 종류에 따라 각각의 요청을 처리하기 위한 디스크 접근횟수가 달라지는 특성을 나타낸다. 이 특성 때문에 비휘발성 메모리가 추가된 버퍼캐처는 적중률(hit rate) 보다는 디스크 접근횟수를 측정하는 것이 정확한 성능측정을 가능하게 한다.

• Smart Media Journal
• /
• v.4 no.3
• /
• pp.16-23
• /
• 2015

As the IT technology advances, data processing system is required to handle and process large amounts of data. However, the existing On-Disk system has limit to process data which increase rapidly. For that reason, the In-Memory system is being used which saves and manages data on the fast memory not saving data into hard disk. Although it has fast processing capability, it is necessary to use the fault tolerance techniques in the In-Memory system because it has a risk of data loss due to volatility which is one of the memory characteristics. These fault tolerance techniques lead to performance degradation of In-Memory system. In this paper, we classify the data into Hot and Cold data in consideration of the data usage characteristics in the In-Memory system and propose compound backup technique to ensure data persistence. The proposed technique increases the persistence and improves performance degradation.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06a
• /
• pp.145-147
• /
• 2006

최근 차세대 메모리 기술이 급격히 발전하여 FeRAM과 PRAM같은 비휘발성 메모리의 상품화가 진행중 이다. 이러한 차세대 비휘발성 메모리는 메모리와 저장장치의 속성을 모두 만족시켜 주지만, 용량/가격 면에서 비효율적이다. 따라서 다양한 크기의 객체를 효율적으로 표현하고 네이밍과 같은 영속성을 제공하면서 공간 효율성이 뛰어난 관리기법이 필요하다. 비휘발성 메모리에서 공간 효율성을 높이기 위하여 새로운 메모리 파일시스템을 설계하였으며, 본 논문에서는 파일 시스템을 설계하면서 파일 시스템의 공간 효율성을 측정하기 위한 공간 비용 분석 모델과 그 결과를 제시한다. 분석 모델은 다양한 파일 시스템의 공간효율성을 수치로 제시하여 파일 시스템 설계 단계부터 공간 효율성을 예측하고 설계를 구체화하는데 매우 큰 도움이 되었다. 또한 분석 모델은 파일 시스템의 공간 효율을 최대화하는 블록 크기를 결정하는 데 근거를 제시하였으며 아울러 공간 효율을 최대화하는 블록 크기는 파일 시스템에 존재하는 파일의 평균 크기에 의존적임을 보여주었다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11b
• /
• pp.970-972
• /
• 2005

J2EE 어플리케이션에서 영속성을 관리하기 위한 데이터 계층에 많은 기술들이 제공되고 있다. 특히 ORM(Object Relation Mapping)을 위해 비영리적이면서도 성숙도가 높은 기술들이 많은 관심을 받고 있다. 그러나 중대형 규모의 어플리케이션에서는 아직 활발하게 적용되고 있지 못한 것이 현실이다. 이것은 새로운 기술 적용에 대한 위험 부담과 기술 자체에 대한 신뢰성이 아직 따라 주지 못하고 있기 때문이다. 논문에서는 대표적인 오픈 소스 ORM 기술인 iBatis와 Hibernate에 대해 알아보고, 적용 전략과 가능성을 살펴본다. 이를 위해 몇 가지 시나리오를 가지고 반응 시간과 메모리 활용을 측정하기 위한 테스팅을 수행하고, 이를 통해 각 기술들이 가지는 장단점을 연구한다.

• Journal of KIISE
• /
• v.43 no.7
• /
• pp.725-735
• /
• 2016

Smart TV uses Webkit as a web browser engine to provide contents such as web surfing, VOD watching, and games. Webkit uses web resources, such as HTML, CSS, JavaScript, and images, in order to run applications. At the start of an application, Webkit loads resources to the memory and creates DOM tree and render tree, which is a time consuming process. However, DOM tree and render tree created by the smart TV application do not change over time because the smart TV application uses web resources stored in a disk. If DOM tree and render tree can be stored and reused, it is possible to reduce loading time of an application. In this paper, we propose FastIO technique that selectively adds persistency to dynamically allocated memory. FastIO reduces overall application loading time by eliminating the process of loading resources from storage, parsing the HTML documents, and creating DOM tree and render tree. Comparison of the application resource loading times indicates that the web browser with FastIO is 7.9x, 44.8x, and 2.9x faster than the legacy web browser in an SSD, Ramdisk, and eMMC environment, respectively.