Pebbles, Graphs, and a Pinch of Combinatorics: Towards Tight I/O Lower Bounds for Statically Analyzable Programs.
Grzegorz KwasniewskiTal Ben-NunLukas GianinazziAlexandru CalotoiuTimo SchneiderAlexandros Nikolaos ZiogasMaciej BestaTorsten HoeflerPublished in: CoRR (2021)
Keyphrases
- data transfer
- lower bound
- upper bound
- graph theory
- branch and bound
- worst case
- np hard
- objective function
- branch and bound algorithm
- optimal solution
- lower and upper bounds
- directed graph
- quadratic assignment problem
- graph model
- graph representation
- graph matching
- computer programs
- sample complexity
- graph databases
- main memory
- scheduling problem
- optimal cost