Farms, pipes, streams and reforestation: reasoning about structured parallel processes using types and hylomorphisms

Farms, pipes, streams and reforestation: reasoning about structured parallel processes using types and hylomorphisms
复制标题

农场、管道、溪流和重新造林:使用类型和水态推理结构化并行过程

DOI:
10.1145/2951913.2951920
复制
发表时间:
2016
期刊:
--
影响因子:
--
通讯作者:
Castro D
Castro D
中科院分区:
--
文献类型:
--
作者:
Castro D

文献摘要

参考文献

被引文献

相似文献

并行性的重要性日益增加,促使人们为编写并行软件创建更好的抽象,包括使用嵌套算法框架的结构化并行性。这种方法提供了避免常见问题(如竞争条件)的高级抽象,并且通常允许定义强大的成本模型。然而,选择一个组合的算法骨架,产生良好的并行加速比的程序在一些特定的并行架构仍然是一项艰巨的任务。为了实现这一点,有必要同时推理不同并行结构的成本以及它们之间的语义等价。本文提出了一种新的基于类型的机制,使这些属性的强静态推理。我们利用一个非常一般的递归模式,hylomorphisms,著名的属性,并给出了这些hylomorphisms的结构化并行进程的指称语义。使用我们的方法,它是可能的,以正式确定是否有可能引入一个所需的并行结构到一个程序中,而不改变其功能行为,并选择一个版本的并行结构,最大限度地减少一些给定的成本模型。
The increasing importance of parallelism has motivated the creation of better abstractions for writing parallel software, including structured parallelism using nested algorithmic skeletons. Such approaches provide high-level abstractions that avoid common problems, such as race conditions, and often allow strong cost models to be defined. However, choosing a combination of algorithmic skeletons that yields good parallel speedups for a program on some specific parallel architecture remains a difficult task. In order to achieve this, it is necessary to simultaneously reason both about the costs of different parallel structures and about the semantic equivalences between them. This paper presents a new type-based mechanism that enables strong static reasoning about these properties. We exploit well-known properties of a very general recursion pattern, hylomorphisms, and give a denotational semantics for structured parallel processes in terms of these hylomorphisms. Using our approach, it is possible to determine formally whether it is possible to introduce a desired parallel structure into a program without altering its functional behaviour, and also to choose a version of that parallel structure that minimises some given cost model.
纯强分类逻辑 CCL 的汇合结果:作为 CCL 子系统的 lambda 演算
DOI: --
发表时间: 1989
影响因子: 1.1
作者:
T. Hardin
通讯作者: T. Hardin
分类组合子重写系统的 Church-Rosser 定理
DOI: --
发表时间: 1989
影响因子: 1.1
作者:
H. Yokouchi
通讯作者: H. Yokouchi
压扁树木
DOI: --
发表时间: 1998
期刊: European Conference on Parallel Processing
影响因子: --
作者:
G. Keller;M. Chakravarty
通讯作者: M. Chakravarty
DOI: --
发表时间: 2010
期刊: Fuji International Symposium on Functional and Logic Programming
影响因子: --
作者:
Akimasa Morihata;Kiminori Matsuzaki
通讯作者: Kiminori Matsuzaki
用于打字 Eden 骷髅的尺寸类型
DOI: --
发表时间: 2001
期刊: International Symposium on Implementation and Application of Functional Languages
影响因子: --
作者:
Ricardo Peña;Clara Segura
通讯作者: Clara Segura