IEICE TRANSACTIONS on Information
Open Access
Block Level TLB Coalescing for Buddy Memory Allocator
-
Full Text Views
28
- Cite this
- Free PDF (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.
- Publication
- IEICE TRANSACTIONS on Information 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
Authors
Jae Young HUR
Vietnamese-German University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Jae Young HUR, "Block Level TLB Coalescing for Buddy Memory Allocator" in IEICE TRANSACTIONS on Information,
vol. E102-D, no. 10, pp. 2043-2046, October 2019, doi: 10.1587/transinf.2019EDL8089.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2019EDL8089/_p
Copy
@ARTICLE{e102-d_10_2043,
author={Jae Young HUR, },
journal={IEICE TRANSACTIONS on Information},
title={Block Level TLB Coalescing for Buddy Memory Allocator},
year={2019},
volume={E102-D},
number={10},
pages={2043-2046},
abstract={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.},
keywords={},
doi={10.1587/transinf.2019EDL8089},
ISSN={1745-1361},
month={October},}
Copy
TY - JOUR
TI - Block Level TLB Coalescing for Buddy Memory Allocator
T2 - IEICE TRANSACTIONS on Information
SP - 2043
EP - 2046
AU - Jae Young HUR
PY - 2019
DO - 10.1587/transinf.2019EDL8089
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E102-D
IS - 10
JA - IEICE TRANSACTIONS on Information
Y1 - October 2019
AB - 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.
ER -
English
