461 search results - page 5 / 93 » Verifying parallel programs with dynamic communication struc... |
PLDI
2012
ACM
11 years 9 months ago
2012
ACM
Existing dynamic race detectors suffer from at least one of the following three limitations: (i) space overhead per memory location grows linearly with the number of parallel thre...
IPPS
1996
IEEE
13 years 11 months ago
1996
IEEE
PVM and other distributed computing systems have enabled the use of networks of workstations for parallel computation, but their approach of treating all networks as collections o...
SAMOS
2010
Springer
13 years 5 months ago
2010
Springer
—Process Networks (PNs) is an appealing computation ion helping to specify an application in parallel form and realize it on parallel platforms. The key questions to be answered ...
SRDS
2000
IEEE
13 years 11 months ago
2000
IEEE
As has been shown, the polygon time structure overcomes the main limitations of the interval time structure, and allows to verify communication protocols, in which the explicit co...
PLDI
2010
ACM
13 years 11 months ago
2010
ACM
The availability of multicore processors has led to significant interest in compiler techniques for speculative parallelization of sequential programs. Isolation of speculative s...