Sciweavers

Share
PPOPP
2016
ACM

Declarative coordination of graph-based parallel programs

4 years 3 months ago
Declarative coordination of graph-based parallel programs
Declarative programming has been hailed as a promising approach to parallel programming since it makes it easier to reason about programs while hiding the implementation details of parallelism from the programmer. However, its advantage is also its disadvantage as it leaves the programmer with no straightforward way to optimize programs for performance. In this paper, we introduce Coordinated Linear Meld (CLM), a concurrent forward-chaining linear logic programming language, with a declarative way to coordinate the execution of parallel programs allowing the programmer to specify arbitrary scheduling and data partitioning policies. Our approach allows the programmer to write graph-based declarative programs and then optionally to use coordination to fine-tune parallel performance. In this paper we specify the set of coordination facts, discuss their implementation in a parallel virtual machine, and show—through example—how they can be used to optimize parallel execution. We compa...
Flávio Cruz, Ricardo Rocha, Seth Copen Gold
Added 09 Apr 2016
Updated 09 Apr 2016
Type Journal
Year 2016
Where PPOPP
Authors Flávio Cruz, Ricardo Rocha, Seth Copen Goldstein
Comments (0)
books