Check out the new USENIX Web site. next up previous
Next: About this document ... Up: Are Mallocs Free of Previous: Acknowledgements

Bibliography

1
Jon Bentley.
Programming Pearls, 2nd Edition.
Addison Wesley, 2000.

2
Mark S. Johnstone and Paul R. Wilson.
The memory fragmentation problem: Solved?
In Proceedings of the Intl. Symp. on Memory Management (ISMM), pages 26-36, Vancouver, Canada, October 17-19 1998.

3
Poul-Henning Kamp.
Malloc(3) revisited.
In Usenix 1998 Annual Technical Conference: Invited Talks and Freenix Track, pages 193-198. Usenix, June 1998.

4
Per-Åke Larson and Murali Krishnan.
Memory allocation for long-running server applications.
In Proceedings of the Intl. Symp. on Memory Management (ISMM), pages 176-185, Vancouver, Canada, October 17-19 1998.

5
Purify.
Rational Purify.
https://www.rational.com/products/pqc/index.jsp.

6
J. M. Robson.
Worst case fragmentation of the first fit and best fit storage allocation strategies.
The Computer Journal, 20(3):242-244, August 1977.

7
Elizabeth Shriver, Eran Gabber, Lan Huang, and Christopher Stein.
Storage management for web proxies.
In Proceedings of the 2001 USENIX Annual Technical Conference, Boston, MA, June 25-30 2001.

8
Apache Webserver.
Apache software foundation.
https://www.apache.org.

9
Paul R. Wilson, Mark S. Johnstone, Michael Neely, and David Boles.
Dynamic storage allocation: A survey and critical review.
In International Workshop on Memory Management (IWMM 1995), pages 1-116, Kinross, Scotland, UK, September 1995. Springer Verlag LNCS 986.

10
G. K. Zipf.
Human Behaviour and the Principle of Least Effort.
Cambridge Press, 1949.