Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

LCPC
2009
Springer

favoriteEmaildiscussreport

139views System Software» more LCPC 2009»

Programming with Intervals

13 years 9 months ago

Programming with Intervals

Download www.lst.inf.ethz.ch

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 ﬂexibility of intervals by showing how to use them to emulate common parallel control-ﬂow constructs like barriers and signals, as well as higher-level patterns such as bounded-buﬀer producer-consumer. We have implemented intervals as a publicly available library for Java and Scala.

Nicholas D. Matsakis, Thomas R. Gross

Real-time Traffic

Data Races | LCPC 2009 | Parallel Control-ﬂow Constructs | Parallel Programming | System Software |

claim paper

Related Content

» Efficient Interval Linear Equality Solving in Constraint Logic Programming

» Interval Polyhedra An Abstract Domain to Infer Interval Linear Relationships

» Motivation for Variable Length Intervals and Hierarchical Phase Behavior

» Interval Sorting

» Handling errors in parallel programs based on happens before relations

» Online Interval Coloring and Variants

» An Interval Semiabsolute Deviation Model For Portfolio Selection

» The Complexity of Computing the Size of an Interval

» Hybrid cc with Interval Constraints

Post Info
More Details (n/a)

Added	26 Jul 2010
Updated	26 Jul 2010
Type	Conference
Year	2009
Where	LCPC
Authors	Nicholas D. Matsakis, Thomas R. Gross

Comments (0)