Back to Results
First PageMeta Content
Memory management / Computer programming / Knowledge representation / Tree / B-tree / C dynamic memory allocation / R-tree / Fragmentation / Memory pool / Computing / Binary trees / Graph theory


A WAIT-FREE DYNAMIC STORAGE ALLOCATOR BY ADOPTING THE HELPING QUEUE PATTERN Philippe Stellwag, Jakob Krainz, Wolfgang Schr¨oder-Preikschat Friedrich-Alexander University Erlangen-Nuremberg Computer Science 4
Add to Reading List

Document Date: 2010-02-18 06:49:02


Open Document

File Size: 146,54 KB

Share Result on Facebook

City

Erlangen / Washington DC / Catania / Vienna / San Diego / Nuremberg / /

Company

Industrial Embedded Systems / DSA / Real-Time Systems / Intel / /

Country

Germany / Austria / United States / Italy / /

/

Facility

Wolfgang Schr¨oder-Preikschat Friedrich-Alexander University / /

IndustryTerm

quadcore processors / depth-first search order / intensive applications / possible solution / deallocation algorithm / multi-core processors / allocation algorithm / deallocation algorithms / multi-processor / static storage management / buddy systems / order multiprocessor systems / dynamic memory allocation algorithms / sharedmemory multi-core processors / /

OperatingSystem

Linux / MaRTE OS / /

Organization

Federal Aviation Administration / U.S. Securities and Exchange Commission / /

Person

Wolfgang Schr / Philippe Stellwag / Jakob Krainz / /

Position

system designer / kernel driver / scheduler / /

ProgrammingLanguage

DC / /

ProvinceOrState

Manitoba / California / /

RadioStation

Wait / /

TVStation

WCET / /

Technology

using multi-processor / 2.2 Deallocation The deallocation algorithm / employed algorithm / Xeon E7340 quadcore processors / Linux / dynamic memory allocation algorithms / 2.1 Algorithm / Operating Systems / deallocation algorithm / allocation algorithm / presented algorithm / deallocation algorithms / /

URL

www.hpl.hp.com/research/linux/atomic / /

SocialTag