219 search results - page 10 / 44 » Automatic Verification of Determinism for Structured Paralle... |
107
click to vote
IEEEPACT
1999
IEEE
15 years 3 months ago
1999
IEEE
Automatic parallelization of general-purpose programs is still not possible in general in the presence of irregular data structures and complex control-flows. One promising strate...
HPCC
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Checkpointing techniques are usually used to secure the execution of sequential and parallel programs. However, they can also be used in order to generate automatically a...
103
click to vote
PPOPP
2012
ACM
13 years 7 months ago
2012
ACM
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
IWPC
2000
IEEE
15 years 4 months ago
2000
IEEE
Call graphs are commonly used as input for automatic clustering algorithms, the goal of which is to extract the high level structure of the program under study. Determining the ca...
176
Voted
CP
2009
Springer
16 years 8 days ago
2009
Springer
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...