• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.28B no.9
• /
• pp.703-711
• /
• 1991

In this paper, an efficient storage reclamation algorithm for RISC parallel processing in the object orented programming environments is presented. The memory management for the dynamic memory allocation and the frequent memory access in object oriented programming is the main factor that decreases RISC parallel processing performance. The proposed algorithm can be efficiently allocated the memory space of RISCy computer which is required the frequent memory access, so it can be increased RISC parallel processing performance. The proposed algorithm is verified the efficiency by implementing C language on SUN SPARC(4.3 BSD UNIX).

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.4
• /
• pp.29-33
• /
• 2024

Recent advancements in mobile apps have led to continuously increasing memory demands on smartphone systems. Unlike desktops, which use swap functions to backup the entire memory footprint to storage when memory space is exhausted, smartphones terminate apps and lose significant context. This occurs because large-scale I/O operations to flash memory cause severe delays when swap is enabled on smartphones. This paper discusses how efficient memory management can be performed by using eMRAM, which is faster in write operations than flash memory, as the swap area in mobile systems. Considering the characteristics of backup storage (i.e., flash memory for the file system and eMRAM for the swap areas) as well as the reference characteristics of each page, we demonstrate that the proposed memory allocation and reclamation policies can improve the smartphone's I/O performance by an average of 15%.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.238-241
• /
• 2011

Locking은 다중 스레드간의 경쟁 상태를 조절하기 위한 전통적인 메커니즘이다. 하지만 Locking을 사용할 경우, 공유 데이터에 대한 잠금(lock) 및 해제(unlock)에 따른 대기 시간(waiting time)이 발생하며, 이는 전체 시스템 성능을 저하시킨다. Wait-free 동기화는 이러한 전통적인 Locking의 비용을 줄이고자 하는 기법이다. Wait-free 동기화의 기본 아이디어는 공유 데이터 수정 시 복제본을 생성해 처리함으로써 잠금에 따른 대기시간을 제거하는 것이다. 따라서 Wait-free 동기화 기법에서는 복제본생성 이후의 메모리 해제가 가장 큰 비용을 차지한다. 이에 본 논문에서는 Wait-free 동기화 및 메모리 해제 기법과 관련하여 주요 이슈 및 기술 현황에 대한 분석을 실시하였다.