License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-20924
URL: http://drops.dagstuhl.de/opus/volltexte/2009/2092/
Go to the corresponding Portal


Mosenkis, Viktor ; Naumann, Uwe ; Peise, Elmar

Low-Memory Tour Reversal in Directed Graphs

pdf-format:
Document 1.pdf (87 KB)


Abstract

We consider the problem of reversing a {em tour} $(i_1,i_2,ldots,i_l)$ in a directed graph $G=(V,E)$ with positive integer vertices $V$ and edges $E subseteq V imes V$, where $i_j in V$ and $(i_j,i_{j+1}) in E$ for all $j=1,ldots,l-1.$ The tour can be processed in last-in-first-out order as long as the size of the corresponding stack does not exceed the available memory. This constraint is violated in most cases when considering control-flow graphs of large-scale numerical simulation programs. The tour reversal problem also arises in adjoint programs used, for example, in the context of derivative-based nonlinear optimization, sensitivity analysis, or other, often inverse, problems. The intention is to compress the tour in order not to run out of memory. As the general optimal compression problem was proven to be NP-hard and big control-flow graphs results from loops in programs we do not want to use general purpose algorithms to compress the tour. We want rather to compress the tour by finding loops and replace the redundant information by proper representation of the loops.

BibTeX - Entry

@InProceedings{mosenkis_et_al:DSP:2009:2092,
  author =	{Viktor Mosenkis and Uwe Naumann and Elmar Peise},
  title =	{Low-Memory Tour Reversal in Directed Graphs},
  booktitle =	{Combinatorial Scientific Computing},
  year =	{2009},
  editor =	{Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo},
  number =	{09061},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/2092},
  annote =	{Keywords: Directed graph, tour reversal, offline algorithm, dynamic programming, online algorithm, control-flow reversal, adjoint program}
}

Keywords: Directed graph, tour reversal, offline algorithm, dynamic programming, online algorithm, control-flow reversal, adjoint program
Seminar: 09061 - Combinatorial Scientific Computing
Issue Date: 2009
Date of publication: 24.07.2009


DROPS-Home | Fulltext Search | Imprint Published by LZI