malloc() performance in a multithreaded Linux environment

Authors:
Chuck Lever;David Boreham
Affiliations:
Sun-Netscape Alliance, University of Michigan, Ann Arbor;Sun-Netscape Alliance, University of Michigan, Ann Arbor
Venue:
ATEC '00 Proceedings of the annual conference on USENIX Annual Technical Conference
Year:
2000

Citing 7
Cited 6

Empirical measurements of six allocation-intensive C programs

ACM SIGPLAN Notices
Improving the cache locality of memory allocation

PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
Evaluating models of memory allocation

ACM Transactions on Modeling and Computer Simulation (TOMACS)
The memory fragmentation problem: solved?

Proceedings of the 1st international symposium on Memory management
Memory allocation for long-running server applications

Proceedings of the 1st international symposium on Memory management
Dynamic Storage Allocation: A Survey and Critical Review

IWMM '95 Proceedings of the International Workshop on Memory Management
Hoard: A Fast, Scalable, and Memory-Efficient Allocator for Shared-MemoryMultiprocessors

Hoard: A Fast, Scalable, and Memory-Efficient Allocator for Shared-MemoryMultiprocessors

Mostly lock-free malloc

Proceedings of the 3rd international symposium on Memory management
Scalable lock-free dynamic memory allocation

Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation
Extending futex for kernel to user notification

ACM SIGOPS Operating Systems Review - Research and developments in the Linux kernel
Practice of parallelizing network applications on multi-core architectures

Proceedings of the 23rd international conference on Supercomputing
Optimizing c multithreaded memory management using thread-local storage

CC'05 Proceedings of the 14th international conference on Compiler Construction
ACDC: towards a universal mutator for benchmarking heap management systems

Proceedings of the 2013 international symposium on memory management

Quantified Score

Hi-index	0.00

Visualization

Abstract

Network servers make special demands that other types of applications may not make on memory allocators. We describe a simple malloc() microbenchmark suite that tests the ability of malloc() to divide its work efficiently among multiple threads and processors. The purpose of this suite is to determine the suitability of an operating system's heap allocator for use with network servers running in an SMP environment.