2924 search results - page 137 / 585 » Lower Bounds in Distributed Computing |
PDCAT
2005
Springer
15 years 6 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...
138
click to vote
JACM
2002
15 years 11 days ago
2002
In completely symmetric systems that have homogeneous nodes (hosts, computers, or processors) with identical arrival processes, an optimal static load balancing scheme does not in...
128
Voted
ACTA
2005
15 years 18 days ago
2005
Clusters and distributed systems offer fault tolerance and high performance through load sharing. When all n computers are up and running, we would like the load to be evenly distr...
128
Voted
HPDC
2002
IEEE
15 years 5 months ago
2002
IEEE
In high energy physics, bioinformatics, and other disciplines, we encounter applications involving numerous, loosely coupled jobs that both access and generate large data sets. So...
103
Voted
COR
2006
15 years 22 days ago
2006
Numerical examples of a Braess-like paradox in which adding capacity to a distributed computer system may degrade the performance of all users in the system have been reported. Un...