Dynamic storage allocation: A survey and critical review
PR Wilson, MS Johnstone, M Neely, D Boles - … Workshop IWMM 95 …, 1995 - Springer
Dynamic memory allocation has been a fundamental part of most computer systems since
roughly 1960, and memory allocation is widely considered to be either a solved problem or …
roughly 1960, and memory allocation is widely considered to be either a solved problem or …
Fast efficient fixed-size memory pool: No loops and no overhead
B Kenwright - ar** safe rust safe with galeed
Rust is a programming language that simultaneously offers high performance and strong
security guarantees. Safe Rust (ie, Rust code that does not use the unsafe keyword) is …
security guarantees. Safe Rust (ie, Rust code that does not use the unsafe keyword) is …
The memory fragmentation problem: Solved?
MS Johnstone, PR Wilson - ACM Sigplan Notices, 1998 - dl.acm.org
We show that for 8 real and varied C and C++ programs, several conventional dynamic
storage allocators provide near-zero fragmentation, once we account for overheads due to …
storage allocators provide near-zero fragmentation, once we account for overheads due to …
Myths and realities: The performance impact of garbage collection
SM Blackburn, P Cheng, KS McKinley - ACM SIGMETRICS Performance …, 2004 - dl.acm.org
This paper explores and quantifies garbage collection behavior for three whole heap
collectors and generational counterparts: copying semi-space, mark-sweep, and reference …
collectors and generational counterparts: copying semi-space, mark-sweep, and reference …
The Foundations for Scalable Multi-core Software in Intel Threading Building Blocks.
A Kukanov, MJ Voss - Intel Technology Journal, 2007 - search.ebscohost.com
This paper describes two features of Intel® Threading Building Blocks (Intel® TBB)[1] that
provide the foundation for its robust performance: a work-stealing task scheduler and a …
provide the foundation for its robust performance: a work-stealing task scheduler and a …
Memory management with explicit regions
Much research has been devoted to studies of and algorithms for memory management
based on garbage collection or explicit allocation and deallocation. An alternative approach …
based on garbage collection or explicit allocation and deallocation. An alternative approach …
A study of the allocation behavior of the SPECjvm98 Java benchmarks
S Dieckmann, U Hölzle - European Conference on Object-Oriented …, 1999 - Springer
We present an analysis of the memory usage for six of the Java programs in the SPECjvm98
benchmark suite. Most of the programs are realworld applications with high demands on the …
benchmark suite. Most of the programs are realworld applications with high demands on the …
[PDF][PDF] Quantifying behavioral differences between C and C++ programs
Improving the performance of C programs has been a topic of great interest for many years.
Both hardware technology and compiler optimization research has been applied in an effort …
Both hardware technology and compiler optimization research has been applied in an effort …
[BOOK][B] Code reading: the open source perspective
D Spinellis - 2003 - books.google.com
If you are a programmer, you need this book. You've got a day to add a new feature in a
34,000-line program: Where do you start? Page 333 How can you understand and simplify …
34,000-line program: Where do you start? Page 333 How can you understand and simplify …