Sciweavers

1451 search results - page 155 / 291
» Order independence and rationalizability
Sort
View
SRDS
2000
IEEE
15 years 11 months ago
Deterministic Scheduling for Transactional Multithreaded Replicas
One way to implement a fault-tolerant a service is by replicating it at sites that fail independently. One of the replication techniques is active replication where each request i...
Ricardo Jiménez-Peris, Marta Patiño-...
SIGGRAPH
2000
ACM
15 years 10 months ago
Pomegranate: a fully scalable graphics architecture
Pomegranate is a parallel hardware architecture for polygon rendering that provides scalable input bandwidth, triangle rate, pixel rate, texture memory and display bandwidth while...
Matthew Eldridge, Homan Igehy, Pat Hanrahan
SIGMOD
2000
ACM
98views Database» more  SIGMOD 2000»
15 years 10 months ago
High Speed On-line Backup When Using Logical Log Operations
Media recovery protects a database from failures of the stable medium by maintaining an extra copy of the database, called the backup, and a media recovery log. When a failure occ...
David B. Lomet
EUROCRYPT
1999
Springer
15 years 10 months ago
Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes
Abstract. We present the first efficient statistical zero-knowledge protocols to prove statements such as: – A committed number is a prime. – A committed (or revealed) number ...
Jan Camenisch, Markus Michels
IPPS
1998
IEEE
15 years 10 months ago
An Efficient Counting Network
Counting networks were introduced as a new class of concurrent, distributed, low contention data structures suitable for implementing shared counters. Their structure is similar t...
Costas Busch, Marios Mavronicolas