69 search results - page 12 / 14 » Algorithm-Based Fault Tolerance Applied to P2P Computing Net... |
104
click to vote
HPDC
2007
IEEE
15 years 3 months ago
2007
IEEE
Fine-Grained Cycle Sharing (FGCS) systems aim at utilizing the large amount of idle computational resources available on the Internet. Such systems allow guest jobs to run on a ho...
APPT
2007
Springer
15 years 3 months ago
2007
Springer
We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint pa...
CF
2009
ACM
14 years 7 months ago
2009
ACM
Emulation sits between simulation and experimentation to complete the set of tools available for software designers to evaluate their software and predict behavior under condition...
SPAA
2009
ACM
15 years 10 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...
EURONGI
2006
Springer
15 years 1 months ago
2006
Springer
Wireless sensor networks (WSNs) pose challenges not present in classical distributed systems: resource limitations, high failure rates, and ad hoc deployment. The lossy nature of w...