paper-with-me

Papers

SGDP: A Stream-Graph Neural Network Based Data Prefetcher

2023-04-07 · Yiyuan Yang, Rongshang Li, Qiquan Shi, Xijun Li, Gang Hu, Xing Li, Mingxuan Yuan

Data prefetching is important for storage system optimization and access performance improvement. Traditional prefetchers work well for mining access patterns of sequential logical block address (LBA) but cannot handle complex non-sequential patterns that commonly exist in real-world applications. The state-of-the-art (SOTA) learning-based prefetchers cover more LBA accesses. However, they do not adequately consider the spatial interdependencies between LBA deltas, which leads to limited performance and robustness. This paper proposes a novel Stream-Graph neural network-based Data Prefetcher (SGDP). Specifically, SGDP models LBA delta streams using a weighted directed graph structure to represent interactive relations among LBA deltas and further extracts hybrid features by graph neural networks for data prefetching. We conduct extensive experiments on eight real-world datasets. Empirical results verify that SGDP outperforms the SOTA methods in terms of the hit ratio by 6.21%, the effective prefetching ratio by 7.00%, and speeds up inference time by 3.13X on average. Besides, we generalize SGDP to different variants by different stream constructions, further expanding its application scenarios and demonstrating its robustness. SGDP offers a novel data prefetching solution and has been verified in commercial hybrid storage systems in the experimental phase. Our codes and appendix are available at https://github.com/yyysjz1997/SGDP/.

📄 PDF Abstract BibTeX arXiv:2304.03864

Code (1)

yyysjz1997/SGDP 공식 구현 pytorch

Tasks

Graph Neural Network

Similar Papers 제목 키워드 기반

Phases, Modalities, Temporal and Spatial Locality: Domain Specific ML Prefetcher for Accelerating Graph Analytics

2022-12-10 · Pengmiao Zhang, Rajgopal Kannan, Viktor K. Prasanna

Memory performance is a bottleneck in graph analytics acceleration. Existing Machine Learning (ML) prefetchers struggle with phase transitions and irregular memory accesses in graph processing. We propose MPGraph, an ML-…

Custom Tailored Suite of Random Forests for Prefetcher Adaptation

2020-08-01 · Furkan Eris, Sadullah Canakci, Cansu Demirkiran, Ajay Joshi

To close the gap between memory and processors, and in turn improve performance, there has been an abundance of work in the area of data/instruction prefetcher designs. Prefetchers are deployed in each level of the memor…

Puppeteer: A Random Forest-based Manager for Hardware Prefetchers across the Memory Hierarchy

2022-01-28 · Furkan Eris, Marcia S. Louis, Kubra Eris, Jose L. Abellan 외

Over the years, processor throughput has steadily increased. However, the memory throughput has not increased at the same rate, which has led to the memory wall problem in turn increasing the gap between effective and th…

Learning Intermediate Representations using Graph Neural Networks for NUMA and Prefetchers Optimization

2022-03-01 · Ali TehraniJamsaz, Mihail Popov, Akash Dutta, Emmanuelle Saillard 외

There is a large space of NUMA and hardware prefetcher configurations that can significantly impact the performance of an application. Previous studies have demonstrated how a model can automatically select configuration…

Graph Neural Network

Probabilistic Inference Modulo Theories

2016-05-26 · Rodrigo de Salvo Braz, Ciaran O'Reilly, Vibhav Gogate, Rina Dechter

We present SGDPLL(T), an algorithm that solves (among many other problems) probabilistic inference modulo theories, that is, inference problems over probabilistic models defined via a logic theory provided as a parameter…