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

09/21/2019
by   Saachi Jain, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/12/2021

Lower Bounds for Maximum Weighted Cut

While there have been many results on lower bounds for Max Cut in unweig...
research
02/26/2020

Trapping problem on star-type graphs with applications

The trapping problem on graph (or network) as a typical focus of great i...
research
01/04/2020

Discovering and Certifying Lower Bounds for the Online Bin Stretching Problem

There are several problems in the theory of online computation where tig...
research
03/12/2022

Bitcoin's Latency–Security Analysis Made Simple

Closed-form upper and lower bounds are developed for the security of the...
research
01/07/2019

Smaller Cuts, Higher Lower Bounds

This paper proves strong lower bounds for distributed computing in the C...
research
07/10/2018

Scalable Katz Ranking Computation in Large Static and Dynamic Graphs

Network analysis defines a number of centrality measures to identify the...
research
06/04/2020

An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs

We present an integer programming model to compute the strong rainbow co...

Please sign up or login with your details

Forgot password? Click here to reset