Re: [graphviz-interest] actual memory use of dot, fdp
"Emden R. Gansner" <[email protected]> Mon, 07 Oct 2013 14:57:59 -0400
| Newsgroups | gmane.comp.video.graphviz |
|---|---|
| Message-ID | <[email protected]> |
On 10/7/13 1:56 PM, Ron Newman wrote:
> For capacity planning, I'm attempting to get a general idea of how a) dot and b) fdp handle memory
> on Linux. Before diving into a tool like exmap or valgrind to measure usage, maybe someone knows
> whether memory usage by dot and fdp increases linearly with source file size, and whether it is
> some semi-determinate multiple or fraction of the source file size.
The rough answer is that memory size is linear in the number of nodes and edges. This is definitely
true for fdp. The caveat for dot concerns the introduction of
dummy nodes each place a long edge crosses a rank. This could lead to |V||E| dummy nodes.
I should note that all of the Graphviz programs, and especially dot, could be tuned to dramatically
decrease memory usage. With 2.30, everything runs on the cgraph library,
so that each algorithm component can be rewritten to use just the amount of memory it needs, not the
sum of memory for all algorithms, as is currently the case. In addition,
dot can provide a variant that avoids uses 2|E| dummy nodes. All that is required is a bit of
programming. :)
Emden
_______________________________________________
[email protected]
http://lists.research.att.com/mailman/listinfo/graphviz-interest