Abstract Heresies
Unorthodox opinions on computer science and programming.
Wednesday, November 23, 2011
›
Imagine that we have a boatload of memory and we're nowhere near the limit. Suppose, too, that we allocate memory simply by bumping the...
Friday, November 18, 2011
Little's Law and the weak generational hypothesis
›
Theorem: The mean lifetime of a heap allocated object is equal to the mean amount of reachable storage. Proof: This is Little's Law...
Wednesday, November 16, 2011
Little's Law and Lisp
›
We model the Lisp heap as a queuing system. A “queuing system” consists of discrete objects we shall call “items” that “arrive” at some ra...
Tuesday, November 15, 2011
Little's Law
›
In Chapter 5 of Building Intuition: Insights from Basic Operations Management Models and Principles , edited by D. Chhajed and T. J. Lowe, S...
Thursday, October 27, 2011
Another chart
›
Here is a chart of the number of words in use after each garbage collection (for MIT/GNU Scheme compiling itself with a heap of 1935360 word...
Wednesday, October 26, 2011
›
Garbage collection gives us the illusion of nearly unlimited memory for temporary storage. To pull off this illusion, we must be able to sa...
2 comments:
Monday, October 24, 2011
›
John McCarthy 1927 - 2011
‹
›
Home
View web version