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

Abstract

Red-blue pebbling is a model of computation that captures the complexity of I/O operations in systems with external memory access. We focus on one-shot pebbling strategies, that is without re-computation. Prior work on this model has focused on finding upper and lower bounds on the I/O complexity of certain families of graphs. We give a polynomial-time bi… (More)
DOI: 10.1145/2935764.2935807

Topics

Cite this paper

@inproceedings{Carpenter2016BriefAA, title={Brief Announcement: Approximating the I/O Complexity of One-Shot Red-Blue Pebbling}, author={Timothy Carpenter and Fabrice Rastello and P. Sadayappan and Anastasios Sidiropoulos}, booktitle={SPAA}, year={2016} }