HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
rbehrends
btree-alloc
C2019–2019
rbehrends / btree-alloc

btree-alloc

Memory allocation benchmark

3Distinct people
3Mentions
0Explicit recommenders
18GitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

Memory allocation benchmark

GitHub

Where it is used

No documented product use has been verified yet.

What people are saying

No recommendation phrase was found in the indexed comments.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

No other repository is repeatedly linked in the same discussions.

This week on Hacker News

Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 1:49:46 PM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by 3-hour interval3 dated mentions

Observed mentions: 2019-05-09 09:30:15 UTC to 2019-05-11 14:47:51 UTC.

012019-05-09 09:00:00 UTC to 2019-05-09 12:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsMay 9, 09:002019-05-09 12:00:00 UTC to 2019-05-09 15:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-05-09 15:00:00 UTC to 2019-05-09 18:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-05-09 18:00:00 UTC to 2019-05-09 21:00:00 UTC (exclusive): 1 mentions; 1 submissions, 0 comments2019-05-09 21:00:00 UTC to 2019-05-10 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-05-10 00:00:00 UTC to 2019-05-10 03:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-05-10 03:00:00 UTC to 2019-05-10 06:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-05-10 06:00:00 UTC to 2019-05-10 09:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-05-10 09:00:00 UTC to 2019-05-10 12:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 commentsMay 10, 09:002019-05-10 12:00:00 UTC to 2019-05-10 15:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-05-10 15:00:00 UTC to 2019-05-10 18:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-05-10 18:00:00 UTC to 2019-05-10 21:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-05-10 21:00:00 UTC to 2019-05-11 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-05-11 00:00:00 UTC to 2019-05-11 03:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-05-11 03:00:00 UTC to 2019-05-11 06:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-05-11 06:00:00 UTC to 2019-05-11 09:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-05-11 09:00:00 UTC to 2019-05-11 12:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-05-11 12:00:00 UTC to 2019-05-11 15:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsMay 11, 12:00

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges
UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
PeriodStart (UTC)End (exclusive, UTC)MentionsSubmissionsComments
May 9, 09:002019-05-09 09:00:00 UTC2019-05-09 12:00:00 UTC101
May 9, 12:002019-05-09 12:00:00 UTC2019-05-09 15:00:00 UTC000
May 9, 15:002019-05-09 15:00:00 UTC2019-05-09 18:00:00 UTC000
May 9, 18:002019-05-09 18:00:00 UTC2019-05-09 21:00:00 UTC110
May 9, 21:002019-05-09 21:00:00 UTC2019-05-10 00:00:00 UTC000
May 10, 00:002019-05-10 00:00:00 UTC2019-05-10 03:00:00 UTC000
May 10, 03:002019-05-10 03:00:00 UTC2019-05-10 06:00:00 UTC000
May 10, 06:002019-05-10 06:00:00 UTC2019-05-10 09:00:00 UTC000
May 10, 09:002019-05-10 09:00:00 UTC2019-05-10 12:00:00 UTC000
May 10, 12:002019-05-10 12:00:00 UTC2019-05-10 15:00:00 UTC000
May 10, 15:002019-05-10 15:00:00 UTC2019-05-10 18:00:00 UTC000
May 10, 18:002019-05-10 18:00:00 UTC2019-05-10 21:00:00 UTC000
May 10, 21:002019-05-10 21:00:00 UTC2019-05-11 00:00:00 UTC000
May 11, 00:002019-05-11 00:00:00 UTC2019-05-11 03:00:00 UTC000
May 11, 03:002019-05-11 03:00:00 UTC2019-05-11 06:00:00 UTC000
May 11, 06:002019-05-11 06:00:00 UTC2019-05-11 09:00:00 UTC000
May 11, 09:002019-05-11 09:00:00 UTC2019-05-11 12:00:00 UTC000
May 11, 12:002019-05-11 12:00:00 UTC2019-05-11 15:00:00 UTC101

What Hacker News says

3 sources
> We'll never get there, for the mythical "there" where GC overhead and latency isn't an issue that needs to be tuned in deployment. I think that for the most part we're "there" already. Such improvements in GCs, like Shenandoah, C4 and ZGC, are more than keeping up with most applications' evolving requirements, and yield tremendous benefits for the relatively low cost of added RAM footprint. > it's time to start recognizing that fact instead of trying to make the JVM and .NET do what we get from explicit heaps in C and Rust. To do better than the JVM, especially in concurrent applications, you have to work hard. What we "get" from manual memory management we actually buy for a rather steep price (and remember that for shared data structures, which are extremely important in concurrent applications, Rust also uses a GC, just a particularl
Read the rest
y primitive one -- reference counting). And even what we buy is not universally "better." I just saw this nice benchmark the other day, that compares allocation costs (even without concurrency). As always, it gives a small part of the picture, but a very real one: https://github.com/rbehrends/btree-alloc. I don't think anyone can reasonably claim that manual memory management is "generally better" than modern GCs, even once the effort is invested. It's better in some respects and worse in others. So it's not even clear which of them has that "last 5%" (and sometimes more) advantage.
In Shenandoah GC in production: experience report

MAKE YOURSELF AT HOME

A few shortcuts

/
Search the collection
?
Open this guide
Esc
Close dialogs and navigation

Your saved repositories and interests stay in this browser.