Brief Announcement: Approximating the I/O Complexity of One-Shot Red-Blue Pebbling

Timothy Carpenter, Fabrice Rastello, P. Sadayappan, Anastasios Sidiropoulos. Brief Announcement: Approximating the I/O Complexity of One-Shot Red-Blue Pebbling. In Christian Scheideler, Seth Gilbert, editors, Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016. pages 161-163, ACM, 2016. [doi]

Abstract

Abstract is missing.