On Characterizing the Data Access Complexity of Programs

DOI10.1145/2676726.2677010zbMath1345.68101arXiv1411.2286OpenAlexW2070079053MaRDI QIDQ2819842

Ponnuswamy Sadayappan, Fabrice Rastello, Venmugil Elango, Louis-Noël Pouchet, J. Ramanujam

Publication date: 29 September 2016

Published in: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.2286

zbMATH Keywords

static analysisdata access complexityI/O lower boundsred-blue pebble game

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (1)

Multilevel Algorithms for Acyclic Partitioning of Directed Acyclic Graphs

This page was built for publication: On Characterizing the Data Access Complexity of Programs