poster

Access map pattern matching for data cache prefetch

Authors:

Yasuo Ishii,

Mary Inaba,

Kei HirakiAuthors Info & Claims

ICS '09: Proceedings of the 23rd international conference on Supercomputing

Pages 499 - 500

https://doi.org/10.1145/1542275.1542349

Published: 08 June 2009 Publication History

Get Access

Abstract

A novel data prefetching method -- access map pattern matching (AMPM) -- that uses "memory access map" is proposed. The AMPM prefetching concentrate hardware resources on collecting the access footprint of the frequently accessed area which we called "hot zones". 2-bit state is associated with each cache lines of hot zone. A set of these states is called "memory access map". Prefetch requests are generated from the pattern matching of the memory access map. The pattern matching detects multiple memory access patterns in parallel and generates more prefetch requests than conventional prefetchers. The evaluation result shows that the AMPM prefetcher improves performance by 42.0% in FP benchmarks.

References

[1]

Y. Ishii, M. Inaba, and K. Hiraki. Access map pattern matching prefetch: Optimization friendly method. The first JILP Data Prefetching Championship, 2009.

Digital Library

Google Scholar

[2]

K. J. Nesbit, A. S. Dhodapkar, and J. E. Smith. Ac/dc: An adaptive data cache prefetcher. In Proceedings of the 13th International Conference on Parallel Architectures and Compilation Techniques, pages 135--145, 2004.

Digital Library

Google Scholar

[3]

K. J. Nesbit and J. E. Smith. Data cache prefetching using a global history buffer. In Proceedings of the 10th International Symposium on High Performance Computer Architecture, pages 96--105, 2004.

Digital Library

Google Scholar

[4]

S. Palacharla and R. E. Kessler. Evaluating stream buffers as a secondary cache replacement. SIGARCH Comput. Archit. News, 22(2):24--33, 1994.

Digital Library

Google Scholar

Cited By

View all

Wang LZhang XWang SJiang ZLu TChen MLuo SHuang K(2024)Asynchronous Memory Access Unit: Exploiting Massive Parallelism for Far Memory AccessACM Transactions on Architecture and Code Optimization10.1145/366347921:3(1-28)Online publication date: 9-May-2024
https://dl.acm.org/doi/10.1145/3663479
Martínez Palau FTorrents MArmejach ACasas M(2024)Exploiting Vector Code Semantics for Efficient Data Cache PrefetchingProceedings of the 38th ACM International Conference on Supercomputing10.1145/3650200.3656635(98-109)Online publication date: 30-May-2024
https://dl.acm.org/doi/10.1145/3650200.3656635
Zhang YSobotka NPark SJamilan SKhan TKasikci BPokam GLitz HDevietti JTsafrir DMusuvathi MGupta RAbu-Ghazaleh N(2024)RPG2: Robust Profile-Guided Runtime Prefetch GenerationProceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 210.1145/3620665.3640396(999-1013)Online publication date: 27-Apr-2024
https://dl.acm.org/doi/10.1145/3620665.3640396
Show More Cited By

Index Terms

Access map pattern matching for data cache prefetch
1. Computer systems organization
  1. Architectures

Recommendations

Data access history cache and associated data prefetching mechanisms
SC '07: Proceedings of the 2007 ACM/IEEE conference on Supercomputing

Data prefetching is an effective way to bridge the increasing performance gap between processor and memory. As computing power is increasing much faster than memory performance, we suggest that it is time to have a dedicated cache to store data access ...
Reducing Cache Pollution via Dynamic Data Prefetch Filtering

In order to bridge the gap of the growing speed disparity between processors and their memory subsystems, aggressive prefetch mechanisms, either hardware-based or compiler-assisted, are employed to hide memory latencies. As the first-level cache gets ...
Improving direct-mapped cache performance by the addition of a small fully-associative cache and prefetch buffers
Special Issue: Proceedings of the 17th annual international symposium on Computer Architecture

Projections of computer technology forecast processors with peak performance of 1,000 MIPS in the relatively near future. These processors could easily lose half or more of their performance in the memory hierarchy if the hierarchy design is based on ...

Comments

Information & Contributors

Information

Published In

ICS '09: Proceedings of the 23rd international conference on Supercomputing

June 2009

544 pages

ISBN:9781605584980

DOI:10.1145/1542275

General Chairs:
Michael Gschwind
IBM TJ Watson Research Center, USA
,
Alex Nicolau
UC Irvine, USA
,
Program Chairs:
Valentina Salapura
IBM TJ Watson Research Center, USA
,
José Moreira
IBM TJ Watson Research Center, USA

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 08 June 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Poster

Conference

ICS '09

Sponsor:

ICS '09: International Conference on Supercomputing

June 8 - 12, 2009

NY, Yorktown Heights, USA

Acceptance Rates

Overall Acceptance Rate 629 of 2,180 submissions, 29%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

45
Total Citations
View Citations
885
Total Downloads

Downloads (Last 12 months)138
Downloads (Last 6 weeks)10

Reflects downloads up to 13 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Wang LZhang XWang SJiang ZLu TChen MLuo SHuang K(2024)Asynchronous Memory Access Unit: Exploiting Massive Parallelism for Far Memory AccessACM Transactions on Architecture and Code Optimization10.1145/366347921:3(1-28)Online publication date: 9-May-2024
https://dl.acm.org/doi/10.1145/3663479
Martínez Palau FTorrents MArmejach ACasas M(2024)Exploiting Vector Code Semantics for Efficient Data Cache PrefetchingProceedings of the 38th ACM International Conference on Supercomputing10.1145/3650200.3656635(98-109)Online publication date: 30-May-2024
https://dl.acm.org/doi/10.1145/3650200.3656635
Zhang YSobotka NPark SJamilan SKhan TKasikci BPokam GLitz HDevietti JTsafrir DMusuvathi MGupta RAbu-Ghazaleh N(2024)RPG2: Robust Profile-Guided Runtime Prefetch GenerationProceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 210.1145/3620665.3640396(999-1013)Online publication date: 27-Apr-2024
https://dl.acm.org/doi/10.1145/3620665.3640396
Bera RRanganathan ARakshit JMahto SNori AGaur JOlgun AKanellopoulos KSadrosadati MSubramoney SMutlu O(2024)Constable: Improving Performance and Power Efficiency by Safely Eliminating Load Instruction Execution2024 ACM/IEEE 51st Annual International Symposium on Computer Architecture (ISCA)10.1109/ISCA59077.2024.00017(88-102)Online publication date: 29-Jun-2024
https://doi.org/10.1109/ISCA59077.2024.00017
Liu YTziantzioulis GWentzlaff D(2023)Building Efficient Neural PrefetcherProceedings of the International Symposium on Memory Systems10.1145/3631882.3631903(1-12)Online publication date: 2-Oct-2023
https://dl.acm.org/doi/10.1145/3631882.3631903
Jamil HChung JBicer TKosar TKettimuthu R(2023)Throughput Optimization with a NUMA-Aware Runtime System for Efficient Scientific Data StreamingProceedings of the SC '23 Workshops of The International Conference on High Performance Computing, Network, Storage, and Analysis10.1145/3624062.3624593(795-805)Online publication date: 12-Nov-2023
https://dl.acm.org/doi/10.1145/3624062.3624593
Sanzo PQuaglia F(2023)On the Effects of Transaction Data Access Patterns on Performance in Lock-Based Concurrency ControlIEEE Transactions on Computers10.1109/TC.2022.322208472:6(1718-1732)Online publication date: 1-Jun-2023
https://doi.org/10.1109/TC.2022.3222084
Fang JLi JYang HWang YSong S(2023)AMPP: An Adaptive Multilayer Perceptron Prefetcher for Irregular Data Prefetching2023 IEEE International Conference on High Performance Computing & Communications, Data Science & Systems, Smart City & Dependability in Sensor, Cloud & Big Data Systems & Application (HPCC/DSS/SmartCity/DependSys)10.1109/HPCC-DSS-SmartCity-DependSys60770.2023.00059(377-384)Online publication date: 17-Dec-2023
https://doi.org/10.1109/HPCC-DSS-SmartCity-DependSys60770.2023.00059
Vijaykumar NOlgun AKanellopoulos KBostanci FHassan HLotfi MGibbons PMutlu O(2022)MetaSys: A Practical Open-source Metadata Management System to Implement and Evaluate Cross-layer OptimizationsACM Transactions on Architecture and Code Optimization10.1145/350525019:2(1-29)Online publication date: 24-Mar-2022
https://dl.acm.org/doi/10.1145/3505250
Shukla SBandishte SGaur JSubramoney SSalapura VZahran MChong FTang L(2022)Register file prefetchingProceedings of the 49th Annual International Symposium on Computer Architecture10.1145/3470496.3527398(410-423)Online publication date: 18-Jun-2022
https://dl.acm.org/doi/10.1145/3470496.3527398
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Data access history cache and associated data prefetching mechanisms

Reducing Cache Pollution via Dynamic Data Prefetch Filtering

Improving direct-mapped cache performance by the addition of a small fully-associative cache and prefetch buffers