Sciweavers

200 search results - page 21 / 40
» Mobile Thin-Client System with Fault Tolerance and Scalabili...
Sort
View
WDAG
2007
Springer
103views Algorithms» more  WDAG 2007»
15 years 5 months ago
Probabilistic Opaque Quorum Systems
Byzantine-fault-tolerant service protocols like Q/U and FaB Paxos that optimistically order requests can provide increased efficiency and fault scalability. However, these protocol...
Michael G. Merideth, Michael K. Reiter
HPDC
2005
IEEE
15 years 5 months ago
411 on scalable password service
In this paper we present 411, a password distribution system for high performance environments that provides security and scalability. We show that existing solutions such as NIS ...
Federico D. Sacerdoti, Mason J. Katz, Philip M. Pa...
EUROSYS
2011
ACM
14 years 3 months ago
Increasing performance in byzantine fault-tolerant systems with on-demand replica consistency
Traditional agreement-based Byzantine fault-tolerant (BFT) systems process all requests on all replicas to ensure consistency. In addition to the overhead for BFT protocol and sta...
Tobias Distler, Rüdiger Kapitza
FTDCS
1997
IEEE
15 years 3 months ago
Distributed Transaction Processing as a Reliability Concept for Mobile Agents
Mobile agents offer a new possibility for the development of applications in distributed systems and are no longer a theoretical issue since different architectures for their impl...
Hartmut Vogler, Thomas Kunkelmann, Marie-Luise Mos...
ICCS
2005
Springer
15 years 5 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