Pengmiao Zhang, R. Kannan, Xiangzhi Tong, Anant V. Nori, V. Prasanna
{"title":"SHARP: Software Hint-Assisted Memory Access Prediction for Graph Analytics","authors":"Pengmiao Zhang, R. Kannan, Xiangzhi Tong, Anant V. Nori, V. Prasanna","doi":"10.1109/HPEC55821.2022.9926307","DOIUrl":null,"url":null,"abstract":"Memory system performance is a major bottleneck in large-scale graph analytics. Data prefetching can hide memory latency; this relies on accurate prediction of memory accesses. While recent machine learning approaches have performed well on memory access prediction, they are restricted to building general models, ignoring the shift of memory access patterns following the change of processing phases in software. We propose SHARP: a novel Software Hint-Assisted memoRy access Prediction approach for graph analytics under Scatter-Gather paradigm on multi-core shared-memory platforms. We intro-duce software hints, generated from programmer insertion, that explicitly indicate the processing phase of a graph processing program, i.e., Scatter or Gather. Assisted by the software hints, we develop phase-specific prediction models that use attention-based neural networks, trained by memory traces with rich context information. We use three widely-used graph algorithms and a variety of datasets for evaluation. With respect to Fl-score, SHARP outperforms the widely-used Delta-LSTM model by 16.45%-18.93% for the scatter phase and 9.50%-22.25% for the Gather phase, and outperforms the state-of-the-art TransFetch model by 3.66%-7.48% for the scatter phase and 2.69%-7.59% for the Gather phase.","PeriodicalId":200071,"journal":{"name":"2022 IEEE High Performance Extreme Computing Conference (HPEC)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE High Performance Extreme Computing Conference (HPEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPEC55821.2022.9926307","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Memory system performance is a major bottleneck in large-scale graph analytics. Data prefetching can hide memory latency; this relies on accurate prediction of memory accesses. While recent machine learning approaches have performed well on memory access prediction, they are restricted to building general models, ignoring the shift of memory access patterns following the change of processing phases in software. We propose SHARP: a novel Software Hint-Assisted memoRy access Prediction approach for graph analytics under Scatter-Gather paradigm on multi-core shared-memory platforms. We intro-duce software hints, generated from programmer insertion, that explicitly indicate the processing phase of a graph processing program, i.e., Scatter or Gather. Assisted by the software hints, we develop phase-specific prediction models that use attention-based neural networks, trained by memory traces with rich context information. We use three widely-used graph algorithms and a variety of datasets for evaluation. With respect to Fl-score, SHARP outperforms the widely-used Delta-LSTM model by 16.45%-18.93% for the scatter phase and 9.50%-22.25% for the Gather phase, and outperforms the state-of-the-art TransFetch model by 3.66%-7.48% for the scatter phase and 2.69%-7.59% for the Gather phase.