access_time 21 de outubro de 2019 às 10:30 até 21 de outubro de 2019 às 12:30
place Sala 0.20, Pavilhão Informática II, IST, Alameda
Page placement is a critical problem to memory-intensive applications running on nonuniform memory access (NUMA) architectures. However, modern NUMA systems present complex memory and interconnect topologies, characterized by asymmetric bandwidths and latencies, and sensitive to memory contention and interconnect congestion interferences. In this thesis, we show that the most common rule of thumb to page placement in NUMA systems fails to exploit the available memory bandwidth by substantial margins. We propose BWAP, a novel page placement mechanism that, unlike current state-of-the-art alternatives, is based on the principle of asymmetric weighted interleaving for optimizing memory access performance. Given a target application running on a subset of nodes in a NUMA machine, BWAP estimates a near-optimal weight distribution and places the shared pages of that application accordingly.
local_offer Prova de CAT
person Candidato: David Daharewa Gureya
supervisor_account Orientador: Prof. João Pedro Faria Mendonça Barreto/ Prof. Vladimir Vlassov