139 search results - page 27 / 28 » Constructive and Adaptable Distributed Shared Memory |
TCS
2008
13 years 4 months ago
2008
Mobile sensors can self-deploy in a purely decentralized and distributed fashion, so to reach in finite time a state of static equilibrium in which they cover uniformly the enviro...
PARA
1995
Springer
13 years 8 months ago
1995
Springer
Abstract. ScaLAPACK is a library of high performance linear algebra routines for distributed memory MIMD computers. It is a continuation of the LAPACK project, which designed and p...
ACCESSNETS
2008
Springer
13 years 11 months ago
2008
Springer
An indoor power line is one of the most attractive media for in-home networks. However, there are many technical problems for achieving in-home power line communication (PLC) with ...
PODC
2010
ACM
13 years 9 months ago
2010
ACM
Wait-freedom and obstruction-freedom have received a lot of attention in the literature. These are symmetric progress conditions in the sense that they consider all processes as b...
STOC
2002
ACM
14 years 5 months ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...