进入正题。指针数组规划中的索引集与保序自动差分
Getting to the Point. Index Sets and Parallelism-Preserving Autodiff for Pointful Array Programming
摘要:
我们提出了一种新的程序设计语言设计,试图结合高层次的功能语言的清晰性和安全性与低层次的数字语言的效率和并行性。我们将数组视为类型化索引集上的快速记忆化函数,允许抽象函数操作(如currying)在数组上工作。与组成原始的批量数组操作相比,我们主张一种明确的嵌套索引风格,它反映了函数到参数的应用。我们还介绍了一个细粒度的类型化效果系统,提供简洁和自动并行就地更新。具体而言,关联累积效应允许以保持并行性的方式对就地更新进行反向模式自动微分。从经验上讲,我们对Futhark阵列程序设计语言的基准,并证明积极的内联和类型驱动的编译允许数组程序被写在一个富有表现力的,“点”的风格,很少的性能损失。
英文摘要:
We present a novel programming language design that attempts to combine the clarity and safety of high-level functional languages with the efficiency and parallelism of low-level numerical languages. We treat arrays as eagerly-memoized functions on typed index sets, allowing abstract function manipulations, such as currying, to work on arrays. In contrast to composing primitive bulk-array operations, we argue for an explicit nested indexing style that mirrors application of functions to arguments. We also introduce a fine-grained typed effects system which affords concise and automatically-parallelized in-place updates. Specifically, an associative accumulation effect allows reverse-mode automatic differentiation of in-place updates in a way that preserves parallelism. Empirically, we benchmark against the Futhark array programming language, and demonstrate that aggressive inlining and type-driven compilation allows array programs to be written in an expressive, "pointful" style with little performance penalty.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。