In this thesis, we describe two related memory allocators, each with novel properties. PALLOC1 contributes a unique strategy based on the traversal of a parallel tree data structure for allowing concurrent allocations and frees to proceed within a single thread's heap. PALLOC1 also provides a novel, provable guarantee limiting the allocator's requests for more memory from the operating system to only those situations where no contiguous block is available to satisfy the allocation request, and a pure bitmap allocation strategy speed-competitive even for sequential codes with the boundary-tag / binning strategy used in dlmalloc. We find that, for larger allocation patterns, our implementation exhibits competitive base performance relative t...
New and emerging memory technologies combined with enormous growths in data collection and mining wi...
International audienceWe provide a parallelization with and without shared-memory for Bandit-Based M...
In modern multicore processors, various resources (such as memory bandwidth and caches) are designed...
In this thesis, we describe two related memory allocators, each with novel properties. PALLOC1 cont...
There are two venues for many-core machines to gain higher performance: increasing the number of pro...
Memory management takes a sequence of program-generated allocation/deallocation requests and attempt...
Dynamic memory allocators are a determining factor of an application's performanceand have the oppor...
We present the design and implementation of the Standard Template Adap- tive Parallel Library (stapl...
Discrete-event simulation programs make heavy use of dynamic memory allocation in order to support s...
6 pagesInternational audienceThis paper introduces and assesses a new method to allocate memory for ...
Multi-core processors have become the dominant processor architecture with 2, 4, and 8 cores on a ch...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
The task parallel programming model allows programmers to express concurrency at a high level of abs...
With the advancement of multiple processors, the sequential algorithms are being investigated and gr...
We present a non-blocking algorithm for a concurrent heap in asynchronous shared memory multiprocess...
New and emerging memory technologies combined with enormous growths in data collection and mining wi...
International audienceWe provide a parallelization with and without shared-memory for Bandit-Based M...
In modern multicore processors, various resources (such as memory bandwidth and caches) are designed...
In this thesis, we describe two related memory allocators, each with novel properties. PALLOC1 cont...
There are two venues for many-core machines to gain higher performance: increasing the number of pro...
Memory management takes a sequence of program-generated allocation/deallocation requests and attempt...
Dynamic memory allocators are a determining factor of an application's performanceand have the oppor...
We present the design and implementation of the Standard Template Adap- tive Parallel Library (stapl...
Discrete-event simulation programs make heavy use of dynamic memory allocation in order to support s...
6 pagesInternational audienceThis paper introduces and assesses a new method to allocate memory for ...
Multi-core processors have become the dominant processor architecture with 2, 4, and 8 cores on a ch...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
The task parallel programming model allows programmers to express concurrency at a high level of abs...
With the advancement of multiple processors, the sequential algorithms are being investigated and gr...
We present a non-blocking algorithm for a concurrent heap in asynchronous shared memory multiprocess...
New and emerging memory technologies combined with enormous growths in data collection and mining wi...
International audienceWe provide a parallelization with and without shared-memory for Bandit-Based M...
In modern multicore processors, various resources (such as memory bandwidth and caches) are designed...