Name
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.
|
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-13374-9_14 | Languages and Compilers for Parallel Computing |
Keywords | Field | DocType |
bounded-buffer producer-consumer,parallel programming,program schedule,higher-level pattern,common parallel control-flow construct,data race,available library,control flow | Scala,Programming language,Computer science,Parallel computing,Deadlock,Java | Conference |
Volume | ISSN | ISBN |
5898 | 0302-9743 | 3-642-13373-8 |
Citations | PageRank | References |
1 | 0.37 | 12 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nicholas D. Matsakis | 1 | 94 | 6.88 |
| Thomas R. Gross | 2 | 2807 | 404.74 |