Results 1 - 10 of 3,838

Memory Allocators

by J. W. Ayres, N. Dunn, R. A. Hayden, J. Nystrom-persson
"... We present generic extensions to the GCspy visualisation framework that make it suitable for tracking the way continuous dynamic memory allocators such as dlmalloc or incremental and concurrent garbage collectors make use of heap memory. These extensions include sample-driven client-server communica ..."
Abstract - Add to MetaCart
We present generic extensions to the GCspy visualisation framework that make it suitable for tracking the way continuous dynamic memory allocators such as dlmalloc or incremental and concurrent garbage collectors make use of heap memory. These extensions include sample-driven client

Reconsidering custom memory allocation

by Emery D. Berger - In Proceedings of the Conference on Object-Oriented Programming: Systems, Languages, and Applications (OOPSLA) 2002 , 2002
"... Programmers hoping to achieve performance improvements often use custom memory allocators. This in-depth study examines eight applications that use custom allocators. Surprisingly, for six of these applications, a state-of-the-art general-purpose allocator (the Lea allocator) performs as well as or ..."
Abstract - Cited by 94 (14 self) - Add to MetaCart
Programmers hoping to achieve performance improvements often use custom memory allocators. This in-depth study examines eight applications that use custom allocators. Surprisingly, for six of these applications, a state-of-the-art general-purpose allocator (the Lea allocator) performs as well

Applying priorities to memory allocation

by Sven Robertz - ISMM , 2002
"... In embedded systems, memory is a scarce resource and great attention must be given to memory management. A novel approach of applying priorities to memory allocation is presented and it is shown how this can be used to enhance the robustness of real-time applications. Focus is on systems with automa ..."
Abstract - Cited by 5 (2 self) - Add to MetaCart
In embedded systems, memory is a scarce resource and great attention must be given to memory management. A novel approach of applying priorities to memory allocation is presented and it is shown how this can be used to enhance the robustness of real-time applications. Focus is on systems

Improving the Cache Locality of Memory Allocation

by Dirk Grunwald, Benjamin Zorn, Robert Henderson , 1993
"... The allocation and disposal of memory is a ubiquitous operation in most programs. Rarely do programmers concern themselves with details of memory allocators; most assume that memory allocators provided by the system perform well. This paper presents a performance evaluation of the reference locality ..."
Abstract - Cited by 77 (8 self) - Add to MetaCart
The allocation and disposal of memory is a ubiquitous operation in most programs. Rarely do programmers concern themselves with details of memory allocators; most assume that memory allocators provided by the system perform well. This paper presents a performance evaluation of the reference

Memory Allocation with Lazy Fits

by Yoo Chung, Soo-Mook Moon , 2000
"... Dynamic memory allocation is an important part of modern programming languages. It is important that it be done fast without wasting too much memory. Memory allocation using lazy fits is introduced, where pointer increments, which is very fast, is used as the primary allocation method and where conv ..."
Abstract - Cited by 5 (1 self) - Add to MetaCart
Dynamic memory allocation is an important part of modern programming languages. It is important that it be done fast without wasting too much memory. Memory allocation using lazy fits is introduced, where pointer increments, which is very fast, is used as the primary allocation method and where

Visualizing dynamic memory allocations

by Sergio Moreta, Ru Telea - In VISSOFT’07: Proceedings of 4th IEEE International Workshop on Visualizing Software for Understanding and Analysis (to appear) (2007), IEEE CS
"... We present a visualization tool for dynamic memory allocation information obtained from instrumenting the runtime allocator used by C programs. The goal of the presented visualization techniques is to convey insight in the dynamic behavior of the allocator. The purpose is to help the allocator desig ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
We present a visualization tool for dynamic memory allocation information obtained from instrumenting the runtime allocator used by C programs. The goal of the presented visualization techniques is to convey insight in the dynamic behavior of the allocator. The purpose is to help the allocator

Composing High-Performance Memory Allocators

by Emery D. Berger, Benjamin G. Zorn, Kathryn S. McKinley - IN PROCEEDINGS OF THE 2001 ACM SIGPLAN CONFERENCE ON PROGRAMMING LANGUAGE DESIGN AND IMPLEMENTATION (PLDI , 2001
"... Current general-purpose memory allocators do not provide sufficient speed or flexibility for modern high-performance applications. Highly-tuned general purpose allocators have per-operation costs around one hundred cycles, while the cost of an operation in a custom memory allocator can be just a han ..."
Abstract - Cited by 73 (22 self) - Add to MetaCart
Current general-purpose memory allocators do not provide sufficient speed or flexibility for modern high-performance applications. Highly-tuned general purpose allocators have per-operation costs around one hundred cycles, while the cost of an operation in a custom memory allocator can be just a

Memory Allocation with Lazy Fits

by Yoo Chung Soo-Mook, Yoo C. Chung, Soo-mook Moon - ACM SIGPLAN Notices , Proceedings of the 2nd international symposium on Memory management ISMM '00, ACM Press, School of Electrical Engineering Seoul National University, October 2000, Volume 36 Issue , 2000
"... Dynamic memory allocation is an important part of modern programming languages. It is important that it be done fast without wasting too much memory. Memory allocation using lazy fits is introduced, where pointer increments, which is very fast, is used as the primary allocation method and where conv ..."
Abstract - Add to MetaCart
Dynamic memory allocation is an important part of modern programming languages. It is important that it be done fast without wasting too much memory. Memory allocation using lazy fits is introduced, where pointer increments, which is very fast, is used as the primary allocation method and where

Simulation of highperformance memory allocators

by José L. Risco-martín, J. Manuel Colmenar, David Atienza, J. Ignacio Hidalgo - in: Proccedings of the 13th EUROMICRO Conference on Digital System Design, 2010
"... Abstract—Current general-purpose memory allocators do not provide sufficient speed or flexibility for modern high-performance applications. To optimize metrics like performance, memory usage and energy consumption, software engineers often write custom allocators from scratch, which is a difficult a ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract—Current general-purpose memory allocators do not provide sufficient speed or flexibility for modern high-performance applications. To optimize metrics like performance, memory usage and energy consumption, software engineers often write custom allocators from scratch, which is a difficult

Evaluating Models of Memory Allocation

by Benjamin Zorn, Dirk Grunwald - ACM TRANSACTIONS ON MODELING AND COMPUTER SIMULATION , 1992
"... Because dynamic memory management is an important part of a large class of computer programs, high-performance algorithms for dynamic memory management have been, and will continue to be, of considerable interest. We evaluate and compare models of the memory allocation behavior in actual programs an ..."
Abstract - Cited by 28 (6 self) - Add to MetaCart
Because dynamic memory management is an important part of a large class of computer programs, high-performance algorithms for dynamic memory management have been, and will continue to be, of considerable interest. We evaluate and compare models of the memory allocation behavior in actual programs
Results 1 - 10 of 3,838