(Enter summary)
Abstract: The slab allocator provides efficient object caching but has two significant limitations: its global locking doesn't scale to many CPUs, and the allocator can't manage resources other than kernel memory. To provide scalability we introduce a per-processor caching scheme called the magazine layer that provides linear scaling to any number of CPUs. To support more general resource allocation we introduce a new virtual memory allocator, vmem, which acts as a universal backing store for the slab... (Update)
Cited by: More
Design Evolution of the EROS Single-Level Store - Shapiro, Adams (2002)
(Correct)
Active bibliography (related documents): More All
0.4: A Scalable Concurrent malloc(3) Implementation for FreeBSD - Evans (2006)
(Correct)
0.3: Three-Dimensional Widgets - Conner, Snibbe, Herndon, Robbins.. (1992)
(Correct)
0.3: Long Term Distributed File Reference Tracing.. - Mummert, Satyanarayanan (1994)
(Correct)
Similar documents based on text: More All
0.4: An Embedded Error Recovery and Debugging Mechanism for Scripting.. - Beazley (2001)
(Correct)
0.4: The Design and Implementation of the NetBSD rc.d System - Mewburn (2001)
(Correct)
0.4: Virtualizing I/O Devices on VMware Workstation's.. - Sugarman.. (2001)
(Correct)
BibTeX entry: (Update)
Jeff Bonwick and Jonathan Adams. Magazines and vmem: Extending the slab allocator to many cpu's and arbitrary resources. In Proc. 2001 USENIX Technical Conference. USENIX Association, 2001. http://citeseer.ist.psu.edu/bonwick01magazines.html More
@inproceedings{ bonwick01magazines,
author = {Bonwick, Jeff and Adams, Jonathan},
title = {Magazines and Vmem: Extending the Slab Allocator to Many {CPU}s and Arbitrary Resources},
booktitle = {Proceedings of the 2001 USENIX Annual Technical Conference},
year = 2001,
address = {Boston, MA},
month = jun,
url = {citeseer.ist.psu.edu/bonwick01magazines.html} }
Citations (may not include all citations):
70
UNIX Internals: The New Frontiers (context) - Vahalia - 1996
66
The Art of Computer Programming: Fundamental Algorithms (context) - Knuth - 1973
50
Hoard: A Scalable Memory Allocator for Multithreaded Applica..
- Berger, McKinley et al. - 2000
45
Understanding the Linux Kernel (context) - Bovet, Cesati - 2000
38
Personal communication (context) - Swain
29
Realtime Scheduling in SunOS
- Khanna, Sebree et al. - 1992
18
The Slab Allocator: An Object-Caching Kernel Memory Allocato..
- Bonwick - 1994
16
Efficient Kernel Memory Allocation on Shared-Memory Multipro.. (context) - McKenney, Slingwine - 1993
15
QuickFit: An Efficient Algorithm for Heap Storage Allocation (context) - Weinstock, Wulf - 1988
14
SelfAdjusting Binary Trees (context) - Sleator, Tarjan - 1985
13
The Working Set Model for Program Behaviour (context) - Denning - 1968
7
Solaris Internals: Core Kernel Architecture (context) - Mauro, McDougall - 2000
3
Personal communication (context) - Taylor, Software
http://nemesis.sourceforge.net
http://www.tpc.org
http://bird.network.cz
http://www.netbsd.org
http://www.linux.org
http://www.freebsd.org
http://www.openbsd.org
http://www.malloc.de
http://www.perl.org
http://www.eros-os.org
ftp://ftp.dcs.gla.ac.uk/pub/drastic/gc/wilson.ps
http://www.spec.org
Documents on the same site (http://www-2.cs.cmu.edu/People/bumba/filing_cabinet/): More
Puppeteer: Component-based Adaptation for Mobile Computing - de Lara, Wallach, Zwaenepoel (2000)
(Correct)
Designing Computer Systems with MEMS-based Storage - Schlosser, Griffin, Nagle.. (2000)
(Correct)
Distributed Raid -- A New Multiple Copy Algorithm - Michael Stonebraker And (1990)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC