170 search results - page 22 / 34 » Interactive Animation of Fault Tolerant Parallel Algorithms |
133
click to vote
CLUSTER
2000
IEEE
15 years 7 months ago
2000
IEEE
Current processor allocation techniques for multicomputers are based on centralized front-end based algorithms. As a result, the applied strategies are usually restricted to stati...
114
click to vote
PDCAT
2005
Springer
15 years 8 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...
111
Voted
ISPDC
2008
IEEE
15 years 9 months ago
2008
IEEE
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
A self-stabilizing distributed system is a faulttolerant distributed system that tolerates any kind and any finite number of transient faults, such as message loss and memory cor...
127
Voted
ICPPW
2003
IEEE
15 years 7 months ago
2003
IEEE
Gaussian Cubes (GCs) are a family of interconnection topologies in which the interconnection density and algorithmic efficiency are linked by a common parameter, the variation of ...