Block Level TLB Coalescing for Buddy Memory Allocator

Jae Young HUR  

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E102-D   No.10   pp.2043-2046
Publication Date: 2019/10/01
Publicized: 2019/07/17
Online ISSN: 1745-1361
DOI: 10.1587/transinf.2019EDL8089
Type of Manuscript: LETTER
Category: Computer System
Keyword: 
architectures,  memory allocation,  translation lookaside buffer,  page table,  performance,  

Full Text: FreePDF(560.1KB)


Summary: 
Conventional TLB (Translation Lookaside Buffer) coalescing schemes do not fully exploit the contiguity that a memory allocator provides. The conventional schemes accordingly have certain performance overheads due to page table walks. To address this issue, we propose an efficient scheme, called block contiguity translation (BCT), that accommodates the block size information in a page table considering the Buddy algorithm. By fully exploiting the block-level contiguity, we can reduce the page table walks as certain physical memory is allocated in the contiguous way. Additionally, we present unified per-level page sizes to simplify the design and better utilize the contiguity information. Considering the state-of-the-art schemes as references, the comparative analysis and the performance simulations are conducted. Experiments indicate that the proposed scheme can improve the memory system performance with moderate hardware overheads.