<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Memory at Your Service: Fast Memory Allocation for Latency-critical Services · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2109.02922/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2109.02922/feed.xml" rel="self" type="application/rss+xml" /><item><title>Memory at Your Service: Fast Memory Allocation for Latency-critical Services — mentioned by Y_Y</title><link>https://news.ycombinator.com/item?id=43409691</link><guid isPermaLink="false">urn:hackerpapers:mention:2109.02922:43409691</guid><pubDate>Wed, 19 Mar 2025 09:08:48 GMT</pubDate><description>&lt;p&gt;Thanks for that. I have an innate skepticism of benchmarks from a company who wants to show their solution is best, and it seems their latest results are from 2021, but I couldn&amp;#x27;t find a better comparison myself either. I do note that rpmalloc (old), Hermes (not public? doesn&amp;#x27;t compare with mimalloc) and also snmalloc (also Microsoft) have benchmarks of their own showing themselves to be best in some circumstances. https://github.com/mjansson/rpmalloc-benchmark https://arxiv.org/abs/2109.02922 https://github.com/SchrodingerZhu/bench_suite/blob/master/ou...&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2109.02922/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DC</category></item></channel></rss>
