Sciweavers

7092 search results - page 198 / 1419
» Parallelizing constraint programs
Sort
View
OOPSLA
2009
Springer
15 years 7 months ago
A type and effect system for deterministic parallel Java
Today’s shared-memory parallel programming models are complex and error-prone. While many parallel programs are intended to be deterministic, unanticipated thread interleavings ...
Robert L. Bocchino Jr., Vikram S. Adve, Danny Dig,...
HASKELL
2009
ACM
15 years 7 months ago
Parallel performance tuning for Haskell
Parallel Haskell programming has entered the mainstream with support now included in GHC for multiple parallel programming models, along with multicore execution support in the ru...
Don Jones Jr., Simon Marlow, Satnam Singh
183
Voted
DC
2011
14 years 8 days ago
Distributed algorithms for covering, packing and maximum weighted matching
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
Christos Koufogiannakis, Neal E. Young
197
Voted
MICRO
2012
IEEE
285views Hardware» more  MICRO 2012»
13 years 2 months ago
Automatic Extraction of Coarse-Grained Data-Flow Threads from Imperative Programs
This article presents a general algorithm for transforming sequential imperative programs into parallel data-flow programs. Our algorithm operates on a program dependence graph i...
Feng Li, Antoniu Pop, Albert Cohen
CP
2004
Springer
15 years 5 months ago
The Tractability of Global Constraints
Abstract. Constraint propagation is one of the techniques central to the success of constraint programming. Fast algorithms are used to prune the search space either before or duri...
Christian Bessière, Emmanuel Hebrard, Brahi...