Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•1y ago

Comments

nine_k•1y ago

> Introducing the ‘packed’ data format, a binary format that allows using data as it is, without the need for a deserialisation step. A notable perk of this format is that traversals on packed trees is proven to be faster than on ‘unpacked’ trees: as the fields of data structures are inlines, there are no pointer jumps, thus making the most of the L1 cache.

That is, a "memory dump -> zero-copy memory read" of a subgraph of Haskell objects, allowing to pass such trees / subgraphs directly over a network. Slightly reminiscent of Cap'n Proto.

90s_dev•1y ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•1y ago

They mention this in the article.

spockz•1y ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•1y ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•1y ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•1y ago

> the serialised version of the data is usually bigger than its in-memory representation

I don’t think this is common. Perhaps for arrays of floats serialized as JSON or something. But I can’t think of a case where binary serialization is bigger. Data types like maps are necessarily larger in memory to support fast lookup and mutability.

nine_k•1y ago

I suppose all self-describing formats, like protobuf, or thrift or, well, JSON are bigger than the efficient machine representation, because they carry the schema in every message, one way or another.

IsTom•1y ago

If you use a lot of sharing in immutable data it can grow a lot when serializing. A simple pathological example would be a tree that has all left subtrees same as the right ones. It takes O(height) space in memory, but O(2^height) when serialized.

gitroom•1y ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•1y ago

This was very well written. Excellent article!

NetOpWibby•1y ago

Is this like MessagePack for Haskell?

Automake 1.20 Brings New Features, to Re-Establish GNU as Leading Build System

B.C. businesses push back against 'AI slop' with pen-and-paper ads

AMD PerfOpt Performance Boosting Code Tweaked for Linux 7.4-Rc2

Show HN: MergeAtlas – A better way to review PRs

Do We Still Have to Denormalize? Have Your Schema and Search It Too

Synaptics sends cease-and-desist order to open-source DisplayLink hobbyist

Why Gmx.com?

GrapheneOS myths I busted after installing it on my Pixel

Vodafone Deutschland to axe 2,300 jobs as it steps up cost-cutting efforts

Lessons learned when hiring engineers in the age of AI

E-means: 10x faster k-means at equal loss

Hackers exploit SSHole OpenSSH flaw to breach Linux systems

Upside-Down-Ternet (2006)

Security Vocabulary for Maintainers

Encyclopedia of Triangle Centers

PolinRider: North Korea-linked worm forges developers' commits in 7,609 repos

The ENIAC in Context: 80 Years of Computing History [video]

I Am Done Using Your UI

Trump administration's embrace of "perp" futures sets off risk alarms

ChaCha AVX-512 Optimization for Linux 7.5 Yields Up to 99% Improvement AMD Zen5

Tide, an iPhone IDE That Runs Node, Python, Ruby and PHP Offline

Show HN: MeowDisplay Is iPhone Mirroring, but in Reverse

Claude's Wager: Why you don't have to believe in AI to bet on it

Show HN: A free replacement for House Stock Watcher, since 2015

The AI bubble can wait, but your exit plan can't

New Democratic Congress will likely strip the gilding from Trump's Golden Dome

Ask HN: Share your best blog/videos on learning about LLMs in depth

Show HN: Juggling multiple inboxes for customer support is a PITA

Tell HN: Another GitHub Major Outage

DeepX claims inference up to 100B parameters at less than 5 W