3 ms·
How do we know the observed behaviour isn't mostly due to the hash set node allocator? If you want speed, you don't use global malloc.
by TwoBit 9y ago
How do we know the observed behaviour isn't mostly due to the hash set node allocator? If you want speed, you don't use global malloc.
- chubot 9y agoBut in-place sort doesn't use malloc() at all. Problem solved. Custom allocators are nice in theory but come with practical costs. And it's easier to do worse than your system malloc() these days. Counterpoints: - Why custom allocators/pools are hard: http://yosefk.com/blog/why-custom-allocatorspools-are-hard.html http://yosefk.com/blog/why-custom-allocatorspools-are-hard.h... - Reconsidering Custom Memory Allocation: https://people.cs.umass.edu/~emery/pubs/berger-oopsla2002.pdf https://people.cs.umass.edu/~emery/pubs/berger-oopsla2002.pd... I think it's good to test your assumptions and this article is a nice example of that.