A hierarchical model of data locality

DOI10.1145/1111037.1111040MaRDI QIDQ5348910zbMATH OpenOpenAlexFDO

Authors Chengliang Zhang, Chen Ding, Ogihara, Mitsunori, Yutao Zhong, Youfeng Wu

Publication date 21 August 2017

Published in Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1802/1306

zbMATH Keywords

\(N\)-body simulationhierarchical data placementNP-completeprogram localityreference affinityvolume distance

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Languages and Compilers for Parallel Computing
• The hardness of cache conscious data placement
• The hardness of cache conscious data placement
• The hardness of data packing
• Maximizing data locality in distributed systems

Cited in

(5)

• On characterizing the data access complexity of programs
• Remote memory references at block granularity
• The hardness of cache conscious data placement
• Languages and Compilers for Parallel Computing
• Modeling data locality for the sparse matrix-vector product using distance measures

This page was built for publication: A hierarchical model of data locality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5348910)