Although parallelism for the naive algorithm is excellent, it requires generating 65671 processes whereas the improved algorithm only generates 196 processes and even computes 50 fibonacci numbers. The response time of the tool is quite fast. The processing and redisplay of traces is about 430 trace statements per sec. This is significantly faster than visualization tools which use complex layout algorithms to get optimal results within fixed display space. The approach to visualize a call tree in a polar coordinate system has a great potential.
Programmers can see very large call trees on one window and they are able to zoom in and out.
The tool's algorithms are fast and easy to implement. Since call trees are hierachies, other hierarchies can be visualized, too. Polaranimation is thus not restricted to Strand programs. All things considered, Polaranimation helps programmers to improve their understanding of what is happening during the execution and aids in performance tuning of their programs. Visualisierungen von Strand TM Prozessen, Diploma Thesis in German, Univ. of Hamburg, Dept. of Comp.