News for hackers. Stuff that matters.

A comment on Always Bump Downwards (2019). Parent comment

Re:Always Bump Downwards (2019) by toast0 on Tuesday September 19, 2023 @04:46PM (#37576299)
BEAM (Erlang) uses something similar for process memory; a process gets a chunk of memory, heap grows up, stack grows down; when they meet, trigger GC, and if that doesn't reclaim enough, allocate a larger chunk of memory. More details if you're interested [1]. In general, I'd think anywhere that the combined size of two allocators should be a consideration, one going up and one going down would make a lot of sense.

[1] https://www.erlang.org/doc/apps/erts/garbagecollection

[ Parent | on HN ]
Re:Always Bump Downwards (2019) by dev_dwarf on Tuesday September 19, 2023 @04:59PM (#37576515)
Thats an interesting idea. I'm not sure I'm sold on it v.s. just having two seperate allocators and growing them seperately. The arena allocators I use take advantage of virtual memory to grow which might change my perception of the tradeoffs involved, as I wouldn't typically need to resize one of my allocators (you can just aggressively over-reserve memory and then only commit what is actually used).
[ Parent | on HN ]