Detailed heap profiling

Heap Profiling of a Lazy Functional Compiler

Heap Profiling of Lazy Functional Programs

We describe the design, implementation and use of a new kind of profiling tool that yields valuable information about the memory use of lazy functional programs. The tool has two parts: a modified functional language implementation which generates profiling information during the execution of programs, and a separate program which converts this information to graphical form. With the aid of pro...

Two-Pass Heap Profiling: A Matter of Life and Death

A heap proole is a chart showing the contents of heap memory throughout a computation. Contents are depicted abstractly by showing how much space is occupied by memory cells in each of several classes. A good heap prooler can use a variety of attributes of memory cells to deene a classiication. EEective prooling usually involves a combination of attributes. The ideal prooler gives full support ...

Skew Heap

Skew heaps are an amazingly simple and lightweight implementation of priority queues. They were invented by Sleator and Tarjan [1] and have logarithmic amortized complexity. This entry provides executable and verified functional skew heaps. The amortized complexity of skew heaps is analyzed in the AFP entry Amortized Complexity.

The Heap of the Living Dead: Post-mortem Memory Profiling for Java Applications

Managed memory, i.e., garbage collected memory, has gained wide-spread use because it relieves the programmer from freeing heap objects manually and allows for fast allocations. However, these advantages come at the cost of a difficult to understand memory manager and garbage collector. Therefore, searching for memory-related performance degredations is a tedious task because the reasons for sl...