3181 search results - page 568 / 637 » Automated Deployment Support for Parallel Distributed Comput... |
122
Voted
PODC
2009
ACM
15 years 9 months ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
139
click to vote
SPAA
2009
ACM
15 years 9 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
114
Voted
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
Next-generation e-Science applications will require the ability to transfer information at high data rates between distributed computing centers and data repositories. To support ...
225
Voted
SPAA
2005
ACM
15 years 8 months ago
2005
ACM
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...
PODC
2010
ACM
15 years 6 months ago
2010
ACM
Linearizability is the strongest known consistency property of shared objects. In asynchronous message passing systems, Linearizability can be achieved with 3S and a majority of c...