I kagi’ed around and I can’t, sorry. The software is 30 some odd years old and was acquired by IBM and sublimated as all ibm acquisitions do. But my memory of it could well be approximated by using dot to create nodes for execution points with edges to calls that are rendered with a weight proportional to the log of the execution time. The nice thing is it allowed for recursive calls to be rendered as cycles, and there are a lot of non recursive cycles I found. It also did a reasonably good job of clustering so highly popular calls fanned into a sub graph but with each graph calling in clustered independently.

Thanks a lot!

I appreciated the description anyway!