A Scalable and Efficient Storage Allocator on Shared Memory Multiprocessors

Authors:
Voon-Yee Vee;Wen-Jing Hsu
Affiliations:
-;-
Venue:
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Year:
1999

Citing 0
Cited 6

Hoard: a scalable memory allocator for multithreaded applications

ACM SIGPLAN Notices
Hoard: a scalable memory allocator for multithreaded applications

ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Mostly lock-free malloc

Proceedings of the 3rd international symposium on Memory management
Performance Evaluation of Task Pools Based on Hardware Synchronization

Proceedings of the 2004 ACM/IEEE conference on Supercomputing
Scalable locality-conscious multithreaded memory allocation

Proceedings of the 5th international symposium on Memory management
Power-aware dynamic memory management on many-core platforms utilizing DVFS

ACM Transactions on Embedded Computing Systems (TECS) - Special Section on ESTIMedia'10

Quantified Score

Hi-index	0.00

Visualization

Abstract

An efficient dynamic storage allocator is important for time-critical parallel programs. In this paper, we present a fast and simple parallel allocator for fixed size block on shared-memory multiprocessors. We show both theoretically and empirically that the allocator incurs very low lock contention. The allocator is tested with parallel simulation applications with frequent allocation and release requests. The results confirm that our allocator is highly efficient and is scalable to more processors.