437 search results - page 26 / 88 » Reducing Memory Sharing Overheads in Distributed JVMs |
111
click to vote
IJCAI
2007
15 years 1 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
EUROPAR
1999
Springer
15 years 4 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...
HPCA
1998
IEEE
15 years 4 months ago
1998
IEEE
This paper examines the performance benefits of employing multicast communication and application-level multithreading in the Brazos software distributed shared memory (DSM) syste...
106
click to vote
IPPS
2006
IEEE
15 years 5 months ago
2006
IEEE
This paper introduces a software DSM that can extend its shared object space exceeding 4GB in a 32bit commodity cluster environment. This is achieved through the dynamic memory ma...
101
click to vote
ISCA
2000
IEEE
15 years 4 months ago
2000
IEEE
Communication in cache-coherent distributed shared memory (DSM) often requires invalidating (or writing back) cached copies of a memory block, incurring high overheads. This paper...