It's interesting to see the various perspectives on heap sizing and how it can affect system performance. The author's suggestion of using a fixed heap size for studying a system and a growable heap for the average user makes sense. However, the idea of an adaptive heap size can also be useful in certain situations.

It's clear that there will always be some level of heuristic badness and a proliferation of knobs and dials to tune for optimal system performance. However, having a general framework for approaching heap sizing can provide structure and limit the number of knobs to a manageable amount.

For me, Forth, with its small memory footprint and ability to manipulate memory directly, can be leveraged to help solve heap sizing issues. Its flexibility in managing memory both interactively and an each function/word can allow for a more efficient use of resources and possibly reduce the need for complex heap sizing algorithms. Well, that is my very biased opinion anyways.

It was a great read.