3796 search results - page 30 / 760 » The Failure of Personalities to Generalize |
MOBIHOC
2008
ACM
14 years 8 months ago
2008
ACM
It was shown recently [7?9], under quite general conditions, that retransmission-based protocols may result in power-law delays and possibly zero throughput even if the distributi...
WWW
2003
ACM
14 years 1 months ago
2003
ACM
An important factor in the successful deployment of federated web-services-based business activities will be the ability to guarantee reliable distributed operation and execution....
JACM
2000
13 years 8 months ago
2000
A crashing network protocol is an asynchronous protocol whose memory does not survive crashes. We show that a crashing network protocol that works over unreliable links can be driv...
SPAA
2009
ACM
14 years 9 months ago
2009
ACM
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
PODC
2009
ACM
14 years 3 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...