A Scalable and Efficient Storage Allocator on Shared Memory Multiprocessors

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Voon-Yee Vee Articles by Wen-Jing Hsu

1999 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '99)

Fremantle, Australia

June 23-June 25

ISBN: 0-7695-0231-8

	ASCII Text	x
	Voon-Yee Vee, Wen-Jing Hsu, "A Scalable and Efficient Storage Allocator on Shared Memory Multiprocessors," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 230, 1999 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '99), 1999.

	BibTex	x
	@article{ 10.1109/ISPAN.1999.778944, author = {Voon-Yee Vee and Wen-Jing Hsu}, title = {A Scalable and Efficient Storage Allocator on Shared Memory Multiprocessors}, journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on}, volume = {0}, year = {1999}, issn = {1087-4089}, pages = {230}, doi = {http://doi.ieeecomputersociety.org/10.1109/ISPAN.1999.778944}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Parallel Architectures, Algorithms, and Networks, International Symposium on TI - A Scalable and Efficient Storage Allocator on Shared Memory Multiprocessors SN - 1087-4089 SP EP A1 - Voon-Yee Vee, A1 - Wen-Jing Hsu, PY - 1999 KW - Parallel storage allocators; minimization of lock contention; scalable parallel algorithms VL - 0 JA - Parallel Architectures, Algorithms, and Networks, International Symposium on ER -

Voon-Yee Vee, Nanyang Technological University

Wen-Jing Hsu, Nanyang Technological University

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISPAN.1999.778944

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.

Index Terms:

Parallel storage allocators; minimization of lock contention; scalable parallel algorithms

Citation:

Voon-Yee Vee, Wen-Jing Hsu, "A Scalable and Efficient Storage Allocator on Shared Memory Multiprocessors," ispan, pp.230, 1999 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '99), 1999

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.