AwkwardForth: accelerating Uproot with an internal DSL
| Autor: | Pivarski, Jim, Osborne, Ianna, Das, Pratyush, Lange, David, Elmer, Peter |
|---|---|
| Rok vydání: | 2021 |
| Předmět: | |
| Druh dokumentu: | Working Paper |
| DOI: | 10.1051/epjconf/202125103002 |
| Popis: | File formats for generic data structures, such as ROOT, Avro, and Parquet, pose a problem for deserialization: it must be fast, but its code depends on the type of the data structure, not known at compile-time. Just-in-time compilation can satisfy both constraints, but we propose a more portable solution: specialized virtual machines. AwkwardForth is a Forth-driven virtual machine for deserializing data into Awkward Arrays. As a language, it is not intended for humans to write, but it loosens the coupling between Uproot and Awkward Array. AwkwardForth programs for deserializing record-oriented formats (ROOT and Avro) are about as fast as C++ ROOT and 10-80$\times$ faster than fastavro. Columnar formats (simple TTrees, RNTuple, and Parquet) only require specialization to interpret metadata and are therefore faster with precompiled code. Comment: 11 pages, 2 figures, submitted to the 25th International Conference on Computing in High Energy & Nuclear Physics |
| Databáze: | arXiv |
| Externí odkaz: |
|