Sciweavers

1024 search results - page 169 / 205
» Fault Tolerance in Decentralized Systems
Sort
View
ICCS
2005
Springer
15 years 3 months ago
Super-Scalable Algorithms for Computing on 100, 000 Processors
In the next five years, the number of processors in high-end systems for scientific computing is expected to rise to tens and even hundreds of thousands. For example, the IBM Blu...
Christian Engelmann, Al Geist
ISAS
2005
Springer
15 years 3 months ago
Dependable Distributed Computing Using Free Databases
Abstract. Designing and programming dependable distributed applications is very difficult. Databases provide features like transactions and replication that can help in the impleme...
Christof Fetzer, Trevor Jim
ICNP
2003
IEEE
15 years 3 months ago
On the Utility of Distributed Cryptography in P2P and MANETs: The Case of Membership Control
Peer-to-peer systems enable efficient resource aggregation and are inherently scalable since they do not depend on any centralized authority. However, lack of a centralized autho...
Maithili Narasimha, Gene Tsudik, Jeong Hyun Yi
ICSE
2003
IEEE-ACM
15 years 2 months ago
Supporting Dependable Distributed Applications Through a Component-Oriented Middleware-Based Group Service
Abstract. Dependable distributed applications require flexible infrastructure support for controlled redundancy, replication, and recovery of components and services. However, mos...
Katia B. Saikoski, Geoff Coulson
SPAA
2010
ACM
15 years 2 months ago
Brief announcement: byzantine agreement with homonyms
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 ...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...