一种通用的并发计算流模型

协调程序设计的案例研究：S-Net与Intel并发集合的性能评估

A Case Study in Coordination Programming: Performance Evaluation of S-Net vs Intel's Concurrent Collections

我们提出了一个编程方法和运行时性能的案例研究比较声明性数据流协调语言S-Net与英特尔的并发集合（CnC）。作为一种协调语言，S-Net实现了在一个单独的算法语言中实现的顺序软件组件和它们在异步数据流流网络中的并行编排之间的关注点的几乎完全分离。我们调查的优点，S-网和CnC的帮助下，一个相关的和非平凡的线性代数问题：平铺Cholesky分解。我们描述了平铺Cholesky分解的两种替代S-Net实现，并将其与两种CnC实现进行比较，一种具有显式性能调整，另一种没有，以前曾用于说明英特尔CnC。我们在48核机器上的实验表明，S-Net在这个问题上的表现优于CnC。

Can Fortran's 'do concurrent' replace directives for accelerated computing?

Recently, there has been growing interest in using standard language constructs (e.g. C++'s Parallel Algorithms and Fortran's do concurrent) for accelerated computing as an alternative to directive-based APIs (e.g. OpenMP and OpenACC). These constructs have the potential to be more portable, and some compilers already (or have plans to) support such standards. Here, we look at the current capabilities, portability, and performance of replacing directives with Fortran's do concurrent using a mini-app that currently implements OpenACC for GPU-acceleration and OpenMP for multi-core CPU parallelis…

Computing Race Variants in Message-Passing Concurrent Programming with Selective Receives

Message-passing concurrency is a popular computation model that underlies several programming languages like, e.g., Erlang, Akka, and (to some extent) Go and Rust. In particular, we consider a message-passing concurrent language with dynamic process spawning and selective receives, i.e., where messages can only be consumed by the target process when they match a specific constraint (e.g., the case of Erlang). In this work, we introduce a notion of trace that can be seen as an abstraction of a class of causally equivalent executions (i.e., which produce the same outcome). We then show that exec…

并发高阶程序静态分析的抽象解释族

A family of abstract interpretations for static analysis of concurrent higher-order programs

我们开发了一个框架，计算两个基本的分析并发高阶程序：（控制）流分析（CFA）和可能发生的并行分析（MHP）。我们特别关注的独特挑战所带来的不受限制的混合一流的延续和动态生成的线程。为了设置阶段，我们制定了一个具体的模型并发高阶程序：P（CEK*）S机。我们发现，这台机器的系统抽象的解释是能够计算流量和MHP分析。然而，仔细检查发现，MHP的精度很差。作为一种补救措施，我们采用了形状分析技术单例抽象动态产生的线程（而不是堆中的对象）。然后，我们表明，如果MHP分析是不感兴趣的，我们可以大大加快计算流分析单独崩溃线程交织与第二层的抽象。

A Variant of Concurrent Constraint Programming on GPU

The number of cores on graphical computing units (GPUs) is reaching thousands nowadays, whereas the clock speed of processors stagnates. Unfortunately, constraint programming solvers do not take advantage yet of GPU parallelism. One reason is that constraint solvers were primarily designed within the mental frame of sequential computation. To solve this issue, we take a step back and contribute to a simple, intrinsically parallel, lock-free and formally correct programming language based on concurrent constraint programming. We then re-examine parallel constraint solving on GPUs within this fo…

A Streaming Analytics Language for Processing Cyber Data

We present a domain-specific language called SAL(the Streaming Analytics Language) for processing data in a semi-streaming model. In particular we examine the use case of processing netflow data in order to identify malicious actors within a network. Because of the large volume of data generated from networks, it is often only feasible to process the data with a single pass, utilizing a streaming (O(polylog n) space requirements) or semi-streaming computing model ( O(n polylog n) space requirements). Despite these constraints, we are able to achieve an average of 0.87 for the AUC of the ROC cu…