Sciweavers

175 search results - page 5 / 35
» Scalable Fault-Tolerant Distributed Shared Memory
Sort
View
SPAA
2003
ACM
15 years 4 months ago
The complexity of verifying memory coherence
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
Jason F. Cantin, Mikko H. Lipasti, James E. Smith
SIGOPS
2011
210views Hardware» more  SIGOPS 2011»
14 years 6 months ago
Small trusted primitives for dependable systems
Secure, fault-tolerant distributed systems are difficult to build, to validate, and to operate. Conservative design for such systems dictates that their security and fault toleran...
Petros Maniatis, Byung-Gon Chun
HIPC
2000
Springer
15 years 3 months ago
Experiments with the CHIME Parallel Processing System
: This paper presents the results from running five experiments with the Chime Parallel Processing System. The Chime System is an implementation of the CC++ programming language (p...
Anjaneya R. Chagam, Partha Dasgupta, Rajkumar Khan...
111
Voted
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...
CLOUDCOM
2010
Springer
14 years 9 months ago
REMEM: REmote MEMory as Checkpointing Storage
Checkpointing is a widely used mechanism for supporting fault tolerance, but notorious in its high-cost disk access. The idea of memory-based checkpointing has been extensively stu...
Hui Jin, Xian-He Sun, Yong Chen, Tao Ke