论文信息 - Magazines and Vmem: Extending the Slab Allocator to Many CPUs and Arbitrary Resources

Magazines and Vmem: Extending the Slab Allocator to Many CPUs and Arbitrary Resources

Rights to individual papers remain with the author or the author's employer. Permission is granted for noncommercial reproduction of the work for educational or research purposes. This copyright notice must be included in the reproduced paper. USENIX acknowledges all trademarks herein.

Jonathan Adams | Jeff Bonwick | Jeff Bonwick | Jonathan Adams

[1] Paul E. McKenney,et al. Efficient Kernel Memory Allocation on Shared-Memory Multiprocessors , 1993, USENIX Winter.

[2] Paul R. Wilson,et al. Dynamic Storage Allocation: A Survey and Critical Review , 1995, IWMM.

[3] Peter J. Denning,et al. The working set model for program behavior , 1968, CACM.

[4] Robert E. Tarjan,et al. Self-adjusting binary trees , 1983, STOC.

[5] Daniel Pierre Bovet,et al. Understanding the Linux Kernel , 2000 .

[6] William A. Wulf,et al. An efficient algorithm for heap storage allocation , 1988, SIGP.

[7] Robert E. Tarjan,et al. Self-adjusting binary search trees , 1985, JACM.

[8] Uresh K. Vahalia. UNIX Internals: The New Frontiers , 1995 .

[9] Donald E. Knuth,et al. The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition , 1997 .

[10] Jeff Bonwick,et al. The Slab Allocator: An Object-Caching Kernel Memory Allocator , 1994, USENIX Summer.

[11] Richard McDougall,et al. Solaris Internals: Core Kernel Architecture , 2000 .

[12] Paul R. Wilson,et al. The memory fragmentation problem: solved? , 1998, ISMM '98.

[13] Kathryn S. McKinley,et al. Hoard: a scalable memory allocator for multithreaded applications , 2000, SIGP.