finding a tree like data structure for stack trace implementation

[philip-harr]

A high-performant tree-like data structure is needed for the tracking of the stack traces of the threads in fasttrack.

[philip-harr]

an implementation with the adjacent_list of the boost graph library gets currently implemented

[fmoessbauer]

One important thing to to keep in mind is that NO memory allocations must happen on each insertion of a node into the tree.
Additionally, the tree has to be stored in TLS (or in a large block of heap memory). To achieve that, a pooled allocator could be used (a blocked memory allocation, every xMB is ok IMO).