Automated Lower Bounds on the I/O Complexity of Computation Graphs release_2fq3ov7eibasjeoui4fuad37j4

by Saachi Jain, Matei Zaharia

Released as a article .

2019  

Abstract

We consider the problem of finding lower bounds on the I/O complexity of arbitrary computations. Executions of complex computations can be formalized as an evaluation order over the underlying computation graph. In this paper, we present two novel methods to find I/O lower bounds for an arbitrary computation graph. In the first, we bound the I/O using the eigenvalues of the graph Laplacian. This spectral bound is not only efficiently computable, but also can be computed in closed form for graphs with known spectra. In our second method, we leverage a novel Integer Linear Program that directly solves for the optimal evaluation order; we solve this ILP on constant sized sub-graphs of the original computation graph to find I/O lower bounds. We apply our spectral method to compute closed-form analytical bounds on two computation graphs (hypercube and Fast Fourier Transform). We further empirically validate our methods on four computation graphs, and find that our methods provide tighter bounds than current empirical methods and behave similarly to previously published I/O bounds.
In text/plain format

Archived Files and Locations

application/pdf  1.2 MB
file_kvl5u3yqpjccllprecvp3b3j7u
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2019-09-21
Version   v1
Language   en ?
arXiv  1909.09791v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 471671ed-1427-4ad6-8637-04d5402e6099
API URL: JSON