Utvärdering av prestanda för sidstorlekar av virtuellt minne och cache konfigurationer på Gitter Boltzmann-metoden

This thesis analyzes the impact of virtual memory page size and Translation Lookaside Buffer (TLB) configuration on performance with stencil-based computations, particularly with the memory intensive Lattice Boltzmann Method. Through the gem5 simulator, we analyzed the effect of page sizes (4 KiB and 64 KiB) on execution time, TLB size, and translation behavior. We benchmarked the accuracy of gem5’s simulations using hardware performance measurements from the HAICGU ARM-based HPC cluster. Our results demonstrate improved TLB hit rates with larger page sizes for sequential access patterns. The benefit for random access is limited when working sets exceed TLB coverage. Although gem5 was not able to simulate TLB behavior flawlessly, the simulator accurately captured the trends within TLB and cache behavior.

Publication Details

Journal
KTH Publication Database DiVA (KTH Royal Institute of Technology)
Published
2025-01-01
Primary Topic
Parallel Computing and Optimization Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Utvärdering av prestanda för sidstorlekar av virtuellt minne och cache konfigurationer på Gitter Boltzmann-metoden

KTH Publication Database DiVA (KTH Royal Institute of Technology)
Parallel Computing and Optimization Techniques
article

Utvärdering av prestanda för sidstorlekar av virtuellt minne och cache konfigurationer på Gitter Boltzmann-metoden

article en

Abstract

This thesis analyzes the impact of virtual memory page size and Translation Lookaside Buffer (TLB) configuration on performance with stencil-based computations, particularly with the memory intensive Lattice Boltzmann Method. Through the gem5 simulator, we analyzed the effect of page sizes (4 KiB and 64 KiB) on execution time, TLB size, and translation behavior. We benchmarked the accuracy of gem5’s simulations using hardware performance measurements from the HAICGU ARM-based HPC cluster. Our results demonstrate improved TLB hit rates with larger page sizes for sequential access patterns. The benefit for random access is limited when working sets exceed TLB coverage. Although gem5 was not able to simulate TLB behavior flawlessly, the simulator accurately captured the trends within TLB and cache behavior.

KTH Publication Database DiVA (KTH Royal Institute of Technology)
Openalex Percentile: Top 43%
Parallel Computing and Optimization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.