Sciweavers

1517 search results - page 247 / 304
» Hardening Functions for Large Scale Distributed Computations
Sort
View
152
Voted
NSDI
2008
15 years 5 months ago
UsenetDHT: A Low-Overhead Design for Usenet
Usenet is a popular distributed messaging and file sharing service: servers in Usenet flood articles over an overlay network to fully replicate articles across all servers. Howeve...
Emil Sit, Robert Morris, M. Frans Kaashoek
IPPS
2007
IEEE
15 years 10 months ago
Performance Studies of a WebSphere Application, Trade, in Scale-out and Scale-up Environments
Scale-out approach, in contrast to scale-up approach (exploring increasing performance by utilizing more powerful shared-memory servers), refers to deployment of applications on a...
Hao Yu, José E. Moreira, Parijat Dube, I-Hs...
144
Voted
DCOSS
2006
Springer
15 years 7 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
177
Voted
ICDCN
2011
Springer
14 years 7 months ago
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
Valerie King, Steven Lonargan, Jared Saia, Amitabh...
208
Voted
ICDE
2007
IEEE
114views Database» more  ICDE 2007»
16 years 5 months ago
Scalable Peer-to-Peer Web Retrieval with Highly Discriminative Keys
The suitability of Peer-to-Peer (P2P) approaches for fulltext web retrieval has recently been questioned because of the claimed unacceptable bandwidth consumption induced by retri...
Ivana Podnar, Martin Rajman, Toan Luu, Fabius Klem...