323 search results - page 39 / 65 » The Fault Tolerance of NP-Hard Problems |
172
click to vote
JSS
1998
15 years 5 months ago
1998
An important problem in the ®eld of distributed systems is that of detecting the termination of a distributed computation. Distributed termination detection (DTD) is a dicult p...
188
click to vote
HPCC
2009
Springer
15 years 3 months ago
2009
Springer
Abstract--The Grid is an heterogeneous and dynamic environment which enables distributed computation. This makes it a technology prone to failures. Some related work uses replicati...
145
click to vote
SPAA
2009
ACM
16 years 6 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...
168
click to vote
ESCIENCE
2006
IEEE
16 years 6 days ago
2006
IEEE
Modern scientific experiments can generate large amounts of data, which may be replicated and distributed across multiple resources to improve application performance and fault to...
155
click to vote
ICDCS
2005
IEEE
15 years 11 months ago
2005
IEEE
Existing techniques for keyword/attribute search in structured P2P overlays suffer from several problems: unbalanced load, hot spots, fault tolerance, storage redundancy, and unab...