AwkwardForth:使用内部DSL加速Uroot
AwkwardForth: accelerating Uproot with an internal DSL
摘要:
通用数据结构的文件格式,如ROOT、Avro和Parquet,给并行化带来了一个问题:它必须快速,但它的代码取决于数据结构的类型,在编译时是未知的。即时编译可以满足这两个约束,但我们提出了一个更便携的解决方案:专用虚拟机。AwkwardForth是一个Forth驱动的虚拟机,用于将数据存储到Awkward Array中。作为一种语言,它并不打算让人类编写,但它放松了Uproot和Awkward Array之间的耦合。AwkwardForth用于格式化面向记录的格式(ROOT和Avro)的程序与C++ ROOT一样快,而$\times$比fastavro快10-80 $\times$。列格式(简单的TTree、RNTuple和Parquet)只需要专门化来解释元数据,因此使用预编译代码更快。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。