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?

MAGA allies tell Trump to vet AI before release

What Lucid Dreaming Reveals About Waking Life

Isms.sh – Free and Open Source Information Security Management System

Learn Harness Engineering

Pope Leo's encyclical on preserving the human person in the AI era drops May 25

The End of Cheap AI: What Consumption Pricing Means for Organizations

The age of the generalist is finally here

No Silver Bullet: Essence and Accidents of Software Engineering (1986) [pdf]

Don't Sign In with Google

When Kierkegaard Got Cancelled

The HTML Sanitizer API

Pip install once, Docker errors auto-translated forever

Lemmy Tray – Rust menu bar app that shows Lemmy posts without browser or account

Siri App to Have Auto-Deleting Chats

Lisp in Web-Based Applications (2001)

NYC Commute POV

Data Center Discontent, Understanding the Opposition, Fixing the Problem

Voice AI Systems Are Vulnerable to Hidden Audio Attacks

Les Horribles Cernettes

PyPI packages are increasing rapidly

Baylibre Partners with SpacemiT to Bring Android 16 to RISC-V

Learning-focused CTFs are Facing a Restructure

HearHam Live Repeater listing app

The new class of AI jobs

Qubes OS: A reasonably secure operating system

Utah lawmakers form united front in push to ban prediction markets

Busting performance issues, AI edition

What A.I. Did to My College Class

How to Write Something Wise (Maria Popova Interview) [video]

I automated opt-outs for 500 data broker sites (open source)