334 search results - page 33 / 67 » Fundamentals of Fault-Tolerant Distributed Computing in Asyn... |
128
click to vote
INFOCOM
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract—We study the throughput capacity of wireless networks which employ (asynchronous) random-access scheduling as opposed to deterministic scheduling. The central question w...
104
click to vote
LATINCRYPT
2010
14 years 12 months ago
2010
Abstract. Broadcast (BC) is considered as the most fundamental primitive for fault-tolerant distributed computing and cryptographic protocols. An important and practical variant of...
109
click to vote
DSN
2006
IEEE
15 years 7 months ago
2006
IEEE
Randomized agreement protocols have been around for more than two decades. Often assumed to be inefficient due to their high expected communication and time complexities, they ha...
HPCC
2007
Springer
15 years 5 months ago
2007
Springer
Effective and efficient mapping algorithms for multisite parallel applications are fundamental to exploit the potentials of grid computing. Since the problem of optimally mapping i...
134
click to vote
HPDC
2002
IEEE
15 years 6 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...