Strong I/O lower bounds for binomial and FFT computation graphs

  • Authors:

  • Desh Ranjan;John Savage;Mohammad Zubair

  • Affiliations:

  • Old Dominion University, Norfolk, Virginia;Brown University, Providence, Rhode Island;Old Dominion University, Norfolk, Virginia

  • Venue:
  • COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Processors on most of the modern computing devices have several levels of memory hierarchy. To obtain good performance on these processors it is necessary to design algorithms that minimize I/O traffic to slower memories in the hierarchy. In this paper, we propose a new technique, the boundary flow technique, for deriving lower bounds on the memory traffic complexity of problems in a two-level memory hierarchy architectures. The boundary flow technique relies on identifying sub-computation structure corresponding to equal computations with a minimum number of boundary vertices, which in turn is related to the vertex isoperimetric parameter of a computation graph. We demonstrate that this technique results in stronger lower bounds for memory traffic on memory hierarchy architectures for well-known computation structures: the binomial computation graphs and FFT computation graphs.