• Proceedings of the Korean Society of Computer Information Conference
• /
• 2013.01a
• /
• pp.61-62
• /
• 2013

안드로이드 스마트폰 사용자에게 응답성은 중요한 성능 이슈이다. 스마트폰 응용 구동 시 응답성에 큰 영향을 미치는 것은 수많은 페이지 부재 처리기의 수행 시간이다. 선사상 기법은 페이지 부재 발생을 효과적으로 줄일 수 있는 기법이지만, 선사상할 페이지를 예측하기 어렵기 때문에 기존 안드로이드 스마트폰에서는 요구 사상 기법이 사용되고 있다. 본 논문은 응답성 향상을 위해 커널이 안드로이드 런타임과 라이브러리의 도움을 받아 선사상할 페이지를 예측하는 선사상 기법을 제안한다. 실험 결과 제안된 기법은 기존 시스템에 비해 웹 브라우저 응용의 응답 시간을 최대 3.25% 단축할 수 있었다.

• Journal of Korea Multimedia Society
• /
• v.10 no.5
• /
• pp.583-593
• /
• 2007

We study the page replacement algorithms for demand paging, called CFLRU/C, CFLRU/E and DL-CFLRU/E, that reduce the number of erase operations and improve the wear-leveling degree of flash memory. Under the CFLRU/C and CFLRU/E algorithms, the victim page is the least recently used dean page within the pre-specified window. However, when there is not any dean page within the window, the CFLRU/C evicts the dirty page with the lowest frequency while the CFLRU/E evicts the dirty page with the highest number of erase operations. The DL-CFLRU/E algorithm maintains two page lists called the dean page list and the dirty page list, and first finds the page within the dean page list when it selects a victim. However, when it can not find any dean page within the dean page list, it evicts the dirty page with the highest number of erase operations within the window of the dirty page list. In this thesis, we show through simulation that the proposed schemes reduce the number of erase operations and improve the wear-leveling than the existing schemes like LRU.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.1757-1760
• /
• 2005

요구 페이징 방식의 가상메모리 시스템에서 페이지 참조 스트링에 따른 페이지 교체 알고리즘의 성능평가를 위한 시뮬레이션을 개발한다. 참조 집약성을 기반으로 워킹세트(working set) 모델을 수정한 MWS 교체 알고리즘을 제안하였고 다양한 교체 알고리즘(FIFO, SC, LFU, LRU, Rand)들과 비교 실험한 결과 MWS는 발생 페이지 부재 수 측면에서 다른 교체 정책 보다 성능이 우수하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.282-283
• /
• 2012

가상메모리 시스템에서 페이지 부재(page fault)를 최소화하기 위해서는 미래에 사용될 페이지를 미리 예측하는 것이 중요하다. 미래에 사용될 페이지는 이미 입력된 페이지들의 패턴 분석을 통해 예측 가능하며 이를 통해 시스템 성능을 최대화 할 수 있는 페이지 교체 정책(page replacement policy)에 대한 연구가 필요하다. 본 논문에서는 동일한 교체 우선권을 가지는 페이지들 간의 예측 적중률을 높이기 위하여 기존의 NUR(not used recently) 정책에 참조횟수 비트를 추가하여 우선 순위를 판단하는 방법을 제안한다. 제안하는 정책은 C 언어를 기반으로 모델링 되었으며 시뮬레이션 결과 페이지 프레임의 크기와 무관하게 기존의 정책들에 비해 성능이 향상됨을 확인하였다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.3
• /
• pp.172-183
• /
• 2010

Virtual memory systems (VM) reduce disk I/Os caused by page faults using page prefetching, which reads pages together with a desired page at a page fault in a single disk I/O. Operating systems including 4.4BSD attempt to prefetch as many pages as possible at a page fault regardless of page access patterns of applications. However, such an approach increases a disk access time taken to service a page fault when a high portion of the prefetched pages is not referenced. More seriously, the approach can cause the memory pollution, a problem that prefetched pages not to be accessed evict another pages that will be referenced soon. To solve these problems, we propose an adaptive page prefetching control scheme (APC), which periodically monitors access patterns of prefetched pages in a process unit. Such a pattern is represented as the ratio of referenced pages among prefetched ones before they are evicted from memory. Then APC uses the ratio to adjust the number of pages that 4.4BSD VM intends to prefetch at a page fault. Thus APC allows 4.4BSD VM to prefetch a proper number of pages to have a better effect on reducing disk I/Os, though page access patterns of an application vary in runtime. The experiment of our technique implemented in FreeBSD 6.2 shows that APC improves the execution times of SOR, SMM, and FFT benchmarks over 4.4BSD VM by up to 57%.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.2
• /
• pp.77-82
• /
• 2022

Due to the recent advent of fast storage media, the memory management system needs to reconsider the configuring of a page unit. In this paper, we analyze the effect of the page size on memory performance as fast storage is adopted. Specifically, we analyze the TLB hit ratio and the page fault ratio as the workload and the page size are varied in desktop and smartphone environments. Our analysis shows that the influence of the page size depends on the system and workload conditions in desktop systems. However, in smartphone systems, the effect of the page size on memory performance is not large, and is not also sensitive to workloads. We expect that the analysis of this paper will be helpful in configuring the page size of given workloads under the system with fast storage media.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.5
• /
• pp.875-878
• /
• 2006

In this paper, I design and implement a software streaming server platform which provides a software streaming service to geographically dispersed internet users. Through the use of QALoad, I verify the correct operation of implemented software streaming server platform.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.1
• /
• pp.118-126
• /
• 1996

Memory hierarchy is a useful mechanism for improving the memory access speed and making the program space larger by layering the memories and separating program spaces from memory spaces. However, it needs at least two memory accesses for each data reference : a TLB(Translation Lookaside Buffer) access for the address translation and a data cache access for the desired data. If the cache size increases to the multiplication of page size and the cache associativity, it is difficult to access the TLB with the cache in parallel, thereby making longer the critical timing path in the processor. To achieve such parallel accesses, we present the hybrid mapped TLB which combines a direct mapped TLB with a very small fully-associative mapped TLB. The former can reduce the TLB access time. while the latter removes the conflict misses from the former. The trace-driven simulation shows that under given workloads the proposed TLB is effective even when a fully-associative mapped TLB with only four entries is added because the effects of its increased misses are offset by its speed benefits.

• Cartoon and Animation Studies
• /
• s.40
• /
• pp.177-209
• /
• 2015

The purpose of this study is to determine the meaning and function of black and white in the comic strip, which are mounted on the book pages. The role of space in comic strip, compared to the role of time in the cinema, enable to feel the role of the time in the book. Therefore storytelling of comic strip has been placed in the inseparable relationship with space. My aim is to think about the black and white meaning in the visual media, especially the use of black and white which is highlighted in the comic strip. Black and white doesn't mean a loss of color in the comic strip but it works around 2 important notions : readability, modernity (with minimalism). In comic strip, 'black and white' is not a true colour but it is complex items which indicate symbolic significances. Moreover it is also a notion which enhance 'existence and absence' and 'visible and invisible'. That's why to analyze and to understand how the space is organized in comic strip page, i chose several examples extract from black and white comic strip.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.05a
• /
• pp.714-717
• /
• 2013

스마트폰의 대중화로 현재 앱스토어에는 다양한 어플리케이션들이 나오고 있다. 이와 같이 급속하게 발전하는 시대임에도 불구하고 모바일디바이스에서 웹페이지 또는 어플리케이션 으로 확인 할 수 있는 표준정보의 부재가 심각하다. 본 논문에서는 확인하기도 힘들고 활용하기도 어려운 기술표준 관련 정보를 공공안내그림표지 OpenAPI를 활용하여 보다 쉽게 이용 가능한 iOS 기반 스마트폰 어플리케이션을 설계 및 구현한다.