高效的树遍历:并行化的并行化和密集数据表示
Efficient Tree-Traversals: Reconciling Parallelism and Dense Data Representations
摘要:
最近的工作表明,编译函数程序使用密集的,串行化的内存表示递归代数数据集可以产生显着的常数因子加速顺序程序。但是,以最大密度格式序列化数据会导致对该数据的序列化处理,从而在密度和并行性之间产生紧张关系。本文表明,一个有纪律的,实际的妥协是可能的。我们提出了并行GitHub,一个编译器,获得密集的数据格式和并行性的好处。我们形式化的语义的并行位置演算支持这种新的实现策略,并表明它是类型安全的。对于使用递归代数数据库的纯函数程序,并行GitHub超过了现有编译器的并行性能,包括,值得注意的是,抽象语法树遍历编译器。
英文摘要:
Recent work showed that compiling functional programs to use dense, serialized memory representations for recursive algebraic datatypes can yield significant constant-factor speedups for sequential programs. But serializing data in a maximally dense format consequently serializes the processing of that data, yielding a tension between density and parallelism. This paper shows that a disciplined, practical compromise is possible. We present Parallel Gibbon, a compiler that obtains the benefits of dense data formats and parallelism. We formalize the semantics of the parallel location calculus underpinning this novel implementation strategy, and show that it is type-safe. Parallel Gibbon exceeds the parallel performance of existing compilers for purely functional programs that use recursive algebraic datatypes, including, notably, abstract-syntax-tree traversals as in compilers.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。