Sciweavers

101 search results - page 16 / 21
» Replication Strategies for Highly Available Peer-to-Peer Sto...
Sort
View
PPOPP
2010
ACM
14 years 4 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
TMC
2012
11 years 9 months ago
Message Drop and Scheduling in DTNs: Theory and Practice
Abstract—In order to achieve data delivery in Delay Tolerant Networks (DTN), researchers have proposed the use of store-carryand-forward protocols: a node there may store a messa...
Amir Krifa, Chadi Barakat, Thrasyvoulos Spyropoulo...
SRDS
1999
IEEE
13 years 11 months ago
Information Dissemination in Partitionable Mobile Ad Hoc Networks
Ad-hoc wireless networks have no wired component, and may have unpredictable mobility pattern. Such networks can get partitioned and reconnected several times. One possible approa...
Goutham Karumanchi, Srinivasan Muralidharan, Ravi ...
ISPDC
2006
IEEE
14 years 1 months ago
MojaveFS: Providing Sequential Consistency in a Distributed Objects System
This paper presents MojaveFS, a distributed file system with support for sequential consistency. It provides location transparency and makes use of replication for reliability an...
Cristian Tapus, David A. Noblet, Vlad Grama, Jason...
ICS
2009
Tsinghua U.
14 years 2 months ago
/scratch as a cache: rethinking HPC center scratch storage
To sustain emerging data-intensive scientific applications, High Performance Computing (HPC) centers invest a notable fraction of their operating budget on a specialized fast sto...
Henry M. Monti, Ali Raza Butt, Sudharshan S. Vazhk...