Affordable Access

The Eureka Programming Model for Speculative Task Parallelism (Artifact)

Authors
Publication Date
Source
Dagstuhl Research Online Publication Server
Keywords
  • Async-Finish Model, Delimited Continuations, Eureka Model, Parallel Programming, Speculative Paralle
  • Data Processing Computer Science
External links

Abstract

This artifact includes a Java-based library implementation of the Eureka programming model (EuPM) that simplifies the expression of speculative parallel tasks. Eureka-style computations are especially well-suited for parallel search and optimization applications. The artifact includes implementations of the eureka patterns that are supported by our Eureka API. These patterns include search, optimization, convergence, N-version programming, and soft real-time deadlines. These different patterns of computations can also be safely combined or nested in the EuPM, along with regular task-parallel constructs, thereby enabling high degrees of composability and reusability. We also include source code of the different benchmarks presented in the paper. The interested reader can use the artifact to experiment with various eureka-style applications and custom Eureka variants in the EuPM.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments