Programming with Intervals

Abstract. Intervals are a new, higher-level primitive for parallel programming with which programmers directly construct the program schedule. Programs using intervals can be statically analyzed to ensure that they do not deadlock or contain data races. In this paper, we demonstrate the flexibility of intervals by showing how to use them to emulate common parallel control-flow constructs like barriers and signals, as well as higher-level patterns such as bounded-buffer producer-consumer. We have implemented intervals as a publicly available library for Java and Scala.

• Type: Conference
• Year: 2009
• Where: LCPC
• Authors: Nicholas D. Matsakis, Thomas R. Gross
• Keywords: Data Races, LCPC 2009, Parallel Control-flow Constructs, Parallel Programming, System Software