70 search results - page 9 / 14 » Efficient Shared Memory Message Passing for Inter-VM Communi... |
131
click to vote
SIAMCOMP
2010
14 years 6 months ago
2010
This paper studies the inherent trade-off between termination probability and total step complexity of randomized consensus algorithms. It shows that for every integer k, the prob...
99
Voted
CAV
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. A recent approach to automated assume-guarantee reasoning (AGR) for concurrent systems relies on computing environment assumptions for components using the L algorithm fo...
81
Voted
EUROPAR
1999
Springer
15 years 3 months ago
1999
Springer
Abstract. This paper presents DAOS, a model for exploitation of Andand Or-parallelism in logic programs. DAOS assumes a physically distributed memory environment and a logically sh...
120
click to vote
IPPS
2009
IEEE
15 years 6 months ago
2009
IEEE
The increasing demand for computational cycles is being met by the use of multi-core processors. Having large number of cores per node necessitates multi-core aware designs to ext...
CPHYSICS
2010
14 years 11 months ago
2010
In this paper, a programming model is presented which enables scalable parallel performance on multi-core shared memory architectures. The model has been developed for application...