Sciweavers

292 search results - page 50 / 59
» Computing Replica Placement in Distributed Systems
Sort
View
98
Voted
SAC
2010
ACM
15 years 6 months ago
Asynchronous Byzantine consensus with 2f+1 processes
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
Miguel Correia, Giuliana Santos Veronese, Lau Cheu...
DAIS
2010
15 years 1 months ago
A Reconfiguration Language for Virtualized Grid Infrastructures
The growing needs in computational power to answer to the increasing number of on-line services and the complexity of applications makes it mandatory to build corresponding hardwar...
Rémy Pottier, Marc Léger, Jean-Marc ...
85
Voted
HPDC
2007
IEEE
15 years 6 months ago
IDEA: : an infrastructure for detection-based adaptive consistency control in replicated services
In Internet-scale distributed systems, replicationbased scheme has been widely deployed to increase the availability and efficiency of services. Hence, consistency maintenance amo...
Yijun Lu, Ying Lu, Hong Jiang
CCGRID
2003
IEEE
15 years 5 months ago
Peer-to-Peer Keyword Search Using Keyword Relationship
Decentralized and unstructured peer-to-peer (P2P) networks such as Gnutella are attractive for Internet-scale information retrieval and search systems because they require neither...
Kiyohide Nakauchi, Yuichi Ishikawa, Hiroyuki Morik...
EUROSYS
2008
ACM
15 years 8 months ago
DepSpace: a byzantine fault-tolerant coordination service
The tuple space coordination model is one of the most interesting coordination models for open distributed systems due to its space and time decoupling and its synchronization pow...
Alysson Neves Bessani, Eduardo Adílio Pelin...