Sciweavers

156 search results - page 24 / 32
» Parallel SAT Solving using Bit-level Operations
Sort
View
PODC
2004
ACM
15 years 5 months ago
Byzantine disk paxos: optimal resilience with byzantine shared memory
We present Byzantine Disk Paxos, an asynchronous shared-memory consensus algorithm that uses a collection of n > 3t disks, t of which may fail by becoming non-responsive or arb...
Ittai Abraham, Gregory Chockler, Idit Keidar, Dahl...
FTDCS
2004
IEEE
15 years 3 months ago
The vMatrix: Server Switching
Today most Internet services are pre-assigned to servers statically, hence preventing us from doing real-time sharing of a pool of servers across as group of services with dynamic...
Amr Awadallah, Mendel Rosenblum
CLUSTER
2009
IEEE
15 years 6 months ago
Integrating software distributed shared memory and message passing programming
Abstract—Software Distributed Shared Memory (SDSM) systems provide programmers with a shared memory programming environment across distributed memory architectures. In contrast t...
H'sien J. Wong, Alistair P. Rendell
ESA
1998
Springer
162views Algorithms» more  ESA 1998»
15 years 3 months ago
External Memory Algorithms
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
Jeffrey Scott Vitter
HPDC
1999
IEEE
15 years 4 months ago
Process Hijacking
Process checkpointing is a basic mechanism required for providing High Throughput Computing service on distributively owned resources. We present a new process checkpoint and migr...
Victor C. Zandy, Barton P. Miller, Miron Livny