Efficient approximations for cache-conscious data placement-Reference-Cited by-同舟云学术

Efficient approximations for cache-conscious data placement

Published:2022-06-09 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation
language:
Short-container-title:

Author:

Ahmadi Ali¹,Daliri Majid²,Goharshady Amir Kafshdar³,Pavlogiannis Andreas⁴

Affiliation:

1. Sharif University of Technology, Iran

2. University of Tehran, Iran

3. Hong Kong University of Science and Technology, China

4. Aarhus University, Denmark

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3519939.3523436

Reference50 articles.

1. Ali Ahmadi , Majid Daliri , Amir Kafshdar Goharshady, and Andreas Pavlogiannis . 2022 . Efficient Approximations for Cache-conscious Data Placement . https://hal.archives-ouvertes.fr/hal-03616652/ Ali Ahmadi, Majid Daliri, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. 2022. Efficient Approximations for Cache-conscious Data Placement. https://hal.archives-ouvertes.fr/hal-03616652/

2. Mohsen Alambardar , Amir Goharshady , Mohammad Reza Hooshmandasl, and Ali Shakiba . 2021 . Optimal Mining : Maximizing Bitcoin Miners’ Revenues . https://hal.archives-ouvertes.fr/hal-03232783 Mohsen Alambardar, Amir Goharshady, Mohammad Reza Hooshmandasl, and Ali Shakiba. 2021. Optimal Mining: Maximizing Bitcoin Miners’ Revenues. https://hal.archives-ouvertes.fr/hal-03232783

3. Ali Asadi Krishnendu Chatterjee Amir Goharshady Kiarash Mohammadi and Andreas Pavlogiannis. 2020. Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth. In ATVA. 253–270. Ali Asadi Krishnendu Chatterjee Amir Goharshady Kiarash Mohammadi and Andreas Pavlogiannis. 2020. Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth. In ATVA. 253–270.

4. Mirza Beg and Peter Van Beek. 2010. A graph theoretic approach to cache-conscious placement of data for direct mapped caches. In ISMM. 113–120. Mirza Beg and Peter Van Beek. 2010. A graph theoretic approach to cache-conscious placement of data for direct mapped caches. In ISMM. 113–120.

5. SIAM Journal on computing, 25, 6;Bodlaender Hans,1996

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Exploiting the Sparseness of Control-Flow and Call Graphs for Efficient and On-Demand Algebraic Program Analysis;Proceedings of the ACM on Programming Languages;2023-10-16

2. The Bounded Pathwidth of Control-Flow Graphs;Proceedings of the ACM on Programming Languages;2023-10-16

3. A Novel Data Management Scheme in Cloud for Micromachines;Electronics;2023-09-08

4. Optimizing Function Layout for Mobile Applications;Proceedings of the 24th ACM SIGPLAN/SIGBED International Conference on Languages, Compilers, and Tools for Embedded Systems;2023-06-13

5. Efficient Interprocedural Data-Flow Analysis Using Treedepth and Treewidth;Lecture Notes in Computer Science;2023