Editing Memory management (section)

=== Efficiency ===
The specific dynamic memory allocation algorithm implemented can impact performance significantly. A study conducted in 1994 by [[Digital Equipment Corporation]] illustrates the [[computational overhead|overheads]] involved for a variety of allocators. The lowest average [[instruction path length]] required to allocate a single memory slot was 52 (as measured with an instruction level [[Profiling (computer programming)|profiler]] on a variety of software).<ref name=":0">{{Cite journal | doi = 10.1002/spe.4380240602| title = Memory allocation costs in large C and C++ programs| journal = Software: Practice and Experience| volume = 24| issue = 6| pages = 527–542| date=June 1994 | last1 = Detlefs | first1 = D. | last2 = Dosser | first2 = A. | last3 = Zorn | first3 = B. | url = https://users.cs.northwestern.edu/~robby/uc-courses/15400-2008-spring/spe895.pdf | citeseerx = 10.1.1.30.3073| s2cid = 14214110}}</ref>