Memory allocation for long-running server applications

International Symposium on Memory Management, ISMM

Volumn Part F129247, Issue , 1998, Pages 176-185

  Larson, Per Åke ^a   Krishnan, Murali ^a  

^a MICROSOFT   (United States)

Author keywords

Cache conscious algorithms; Concurrency; Dynamic memory allocation; Multiprocessor scalability; Reducing lock contention; Server applications

Indexed keywords

DATA COMMUNICATION EQUIPMENT; LOCKS (FASTENERS); MEMORY ARCHITECTURE; STORAGE ALLOCATION (COMPUTER);

CACHE-CONSCIOUS; CONCURRENCY; DYNAMIC MEMORY ALLOCATION; LOCK CONTENTIONS; SERVER APPLICATIONS;

CACHE MEMORY;

EID: 78650963820     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/286860.286880     Document Type: Conference Paper

References (18)

1. Andrew W. Appel, John R. Ellis, and Kai Li, Realtime concurrent collection on stock multi-processors, ACM SIGPLAN Notices, 23(7): 11-20, 1988.
2. David Detlefs, AI Dosser, and Benjamin Zorn, Memory Allocation Costs in Large C and C++ Programs, Software Practice and Experience 24(6): 527-542, June 1994.
3. J. S. Fenton and D. W. Payne. Dynamic storage allocations of arbitrary sized segments. In Proc. IFIPS, pages 344-348, 1974.
4. Wolfram Gloger, Dynamic memory allocator implementations in Linux system libraries, http://www.dent.med.uni-muenchen.de/~wmglo/malloc-slides.html (site visited May 11, 1998)
5. Dirk Grunwald and Benjamin Zorn, CustoMalloc: Efficient Synthesized Memory Allocators, Software: Practice and Experience. 23(8): 851-869, August 1993.
6. Dirk Grunwald and Benjamin Zorn and Rob Henderson, Improving the Cache Locality of Memory Allocation, ACM SIGPLAN'93 Conference on Programming Language Design and Implementation, pp 177-186. Albuquerque, NM. June 1993.
7. Arun K. Iyengar, Parallel dynamic storage allocation algorithms, In Fifth IEEE Symposium on Parallel and Distributed Processing. IEEE Press, 1993.
8. Arun Iyengar, Scalability of Dynamic Storage Allocation Algorithms, In Frontiers '96 - The 6th Symposium on Frontiers of Massively Parallel Computing, IEEE Computer Society Press. Pages: 223-232.
9. Donald E. Knuth. Fundamental Algorithms, Vol. 1 of The Art of Computer Programming, chapter 2, pages 435-451. Addison Wesley, Reading, MA, 2nd edition, 1973.
10. Doug Lea, A memory allocator, http://g.oswego.edu/dl/html/rnalloc.html (site visited May 11, 1998).
11. B. W. Leverett and P. G. Hibbard. An adaptive system for dynamic storage allocation. Software Practice and Experience, 12(6): 543-556, June 1982.
12. Paul E. McKenney and Jack Slingwine. Efficient kernel memory allocation on shared-memory multiprocessors. In USENIX Conference Proceedings, Berkeley CA, February 1993.
13. C. J. Stephenson. Fast fits: New methods for dynamic storage allocation. In Proceedings of the Ninth ACM Symposium on Operating System Principles, pages 30-32, Bretton Woods, NH, October 1983.
14. Kiem-Phong Vo, Vmalloc: A general and efficient memory allocator. Software Practice and Experience, 26(3), 357-374, 1996.
15. Paul R. Wilson, Mark S. Johnstone, Michael Neely, and David Boles. Dynamic storage allocation: A survey and critical review. In 1995 International Workshop on Memory Management, Kinross, Scotland, UK, 1995. Springer Verlag LNCS.
16. Benjamin Zorn, Malloc/free and GC implementations, http://www.cs.colorado.edu/~zorn/Malloc.html (site visited May 11, 1988).
17. Benjamin Zorn and Dirk Grunwald, Evaluating Models of Memory Allocation, ACM Transactions on Modeling and Computer Simulation. 4(1): 107-131, January 1994.
18. Richard Jones, and Rafael Lins, Garbage Collection: Algorithms for automatic dynamic memory management, John Wiley & Sons, 1998