562 search results - page 23 / 113 » Mapping a Fault-Tolerant Distributed Algorithm to Systems on... |
GRID
2004
Springer
15 years 3 months ago
2004
Springer
With the advent of Grid computing, more and more highend computational resources become available for use to a scientist. While this opens up new avenues for scientific research,...
EUROPAR
2007
Springer
15 years 3 months ago
2007
Springer
The dominant eigenvector of matrices defined by weighted links in overlay networks plays an important role in many peer-to-peer applications. Examples include trust management, im...
IJWMC
2006
14 years 9 months ago
2006
: We present a new distributed mechanism for tracking moving objects with a network of sensors. To track such objects efficiently and accurately, we need techniques that allow the ...
PDCAT
2005
Springer
15 years 3 months ago
2005
Springer
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
78
Voted
LCN
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract—Distributed interactive applications may have stringent latency requirements and dynamic user groups. These applications may benefit from a group communication system, ...