Betül Aydeğer

Betül Aydeğer

Auto-generated profile, based on publicly available information

Betül Aydeğer

Computer Engineering Department, TOBB University of Economics and Technology, Ankara, Trkiye

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 April 2025 in IEEE Computer Architecture Letters
Verified
Journal Article
Closed access
ŞIŞevval İzMirli
Şevval İzMirli
JPJulian Pavon
Julian Pavon
IVIvan Vargas Valdivieso
Ivan Vargas Valdivieso
BABetül Aydeğer
Betül Aydeğer
KYKerem Yalçınkaya
Kerem Yalçınkaya
OÜOsman Ünsal
Osman Ünsal
Graph Pattern Mining (GPM) algorithms extract meaningful information within graph structures, making them fundamental building blocks for multiple application domains. However, their performance is bottlenecked by hard-to-predict divergence control, cache pollution, and low parallelism caused by index matching operations that dominate the execution time. To address these challenges, this paper introduces Halis, a hardware-software co-designed Near-Cache Accelerator for GPM workloads on commercial multi-core CPUs. By executing index matching operations near the Last-Level Cache (LLC), Halis reduces data movement and cache pollution in upper cache levels while minimizing divergence control and enhancing parallelism. To achieve this, Halis repurposes underutilized Content Addressable Memories (CAMs) in hardware data prefetchers, taking advantage of their efficient lookup capabilities for GPM workloads. Furthermore, Halis includes virtual memory support, ensuring compatibility with commodity operating systems. Designed as a decoupled programmable accelerator, it operates via memory-mapped registers. Our evaluation demonstrates that Halis outperforms software and hardware approaches by 26.9× and 2.4× respectively, while incurring a negligible area overhead of 0.05% over the CPU baseline.