370 search results - page 28 / 74 » The perfectly synchronized round-based model of distributed ... |
IPPS
1997
IEEE
15 years 4 months ago
1997
IEEE
We present a new randomized sorting algorithm on the Bulk-SynchronousParallel (BSP) model. The algorithm improves upon the parallel slack of previous algorithms to achieve optimal...
FUIN
2002
14 years 11 months ago
2002
Abstract. In this paper we give a complete formalization of a new computability model of a distributed parallel type which is inspired by some basic features of living cells: trans...
122
click to vote
CLUSTER
2004
IEEE
14 years 11 months ago
2004
IEEE
Fault tolerance in parallel systems has traditionally been achieved through a combination of redundancy and checkpointing methods. This notion has also been extended to message-pas...
103
click to vote
SPAA
2010
ACM
15 years 4 months ago
2010
ACM
In this work, we address Byzantine agreement in a message passing system with homonyms, i.e. a system with a number l of authenticated identities that is independent of the total ...
IPPS
1999
IEEE
15 years 4 months ago
1999
IEEE
Abstract. In recent years, there has been a surge of interest in Javabased volunteer computing systems, which aim to make it possible to build very large parallel computing network...