| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10328630 | Computer Languages, Systems & Structures | 2005 | 14 Pages |
Abstract
Dynamic memory allocation often makes up a large part of program execution time. Different variants of the best-fit allocator are implemented and their space and time costs measured and compared. We found variants of this algorithm that are 3-33% faster than the Doug Lea 2.7.0 allocator.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Yusuf Hasan, Morris Chang,