7092 search results - page 206 / 1419 » Parallelizing constraint programs |
110
click to vote
ISHPC
2000
Springer
15 years 4 months ago
2000
Springer
The shared-memory programming model is a very effective way to achieve parallelism on shared memory parallel computers. As great progress was made in hardware and software technolo...
CPP
2011
14 years 9 days ago
2011
Abstract. In this paper we present a new technique for automatically verifying typing constraints in the setting of Dminor, a first-order data processing language with refinement...
128
click to vote
PACT
1997
Springer
15 years 4 months ago
1997
Springer
A technique for estimating the cost of executing a loop nest in parallel (parallel start-up overhead) is described in this paper. This technique is of utmost importance for paralle...
90
Voted
CASCON
1996
15 years 1 months ago
1996
The Enterprise parallel programming system allows programmers to create, compile, execute, and debug parallel applications that execute over a network of workstations. The run-tim...
104
Voted
PPOPP
2009
ACM
16 years 1 months ago
2009
ACM
Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore "low-leve...