Corpus ID: 17721001

Balancing Allocation Speed , Locality and Fragmentation in a Locality Improving Allocator

@inproceedings{Jula2008BalancingAS,
  title={Balancing Allocation Speed , Locality and Fragmentation in a Locality Improving Allocator},
  author={Alin Jula and Lawrence Rauchwerger alinj},
  year={2008}
}
  • Alin Jula, Lawrence Rauchwerger alinj
  • Published 2008
  • The performance of memory allocators is a significant contributor to the overall performance of dynamic applications. A good memory allocator is fast, maximizes locality of access and minimizes fragmentation. In this paper we first introduce two novel memory allocators, TP and Medius, which can be tuned to optimize the three characteristics of memory allocation. These allocators can take locality enhancing hints provided automatically by the C++ STL containers used in our benchmark applications… CONTINUE READING

    Citations

    Publications citing this paper.

    Parameters affecting the functionality of memory allocators

    VIEW 4 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 32 REFERENCES

    A locality-improving dynamic memory allocator

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    Cache-conscious structure layout

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Improving cache behavior of dynamically allocated data structures

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Some storage management techniques for container classes

    • Doug Lea
    • The C++ Report,
    • 1989
    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    C++ benchmarks in SPEC CPU2006

    VIEW 1 EXCERPT

    Data layouts for object-oriented programs

    VIEW 1 EXCERPT