Pebbles, Graphs, and a Pinch of Combinatorics - Towards Tight I/O Lower Bounds for Statically Analyzable Programs

Summary

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Grzegorz Kwasniewski, Tal Ben-Nun, Lukas Gianinazzi, Alexandru Calotoiu, Timo Schneider, Alexandros Nikolaos Ziogas, Maciej Besta, Torsten Hoefler

Journal title: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures

Journal publisher: ACM

Published year: 2021

Published pages: 328-339

DOI identifier: 10.1145/3409964.3461796

ISBN: 9781450380706