Sciweavers

6105 search results - page 777 / 1221
» A Parallel Algorithm for Bound-Smoothing
Sort
View
177
Voted
COREGRID
2007
Springer
16 years 1 months ago
Atomic Commitment in Transactional DHTs
We investigate the problem of atomic commit in transactional database systems built on top of Distributed Hash Tables. Therefore we present a framework for DHTs to provide strong d...
Monika Moser, Seif Haridi
GCC
2007
Springer
16 years 1 months ago
A Dynamic Quota-Based Peer Selection Strategy in BitTorrent
BitTorrent employs a static quota-based peer selection strategy to fixedly allocate upload quotas for the Tit-For-Tat (TFT) choke algorithm and Optimistic Unchoke (OU) algorithm, ...
Kun Huang, Lei Wang, Dafang Zhang, Yongwei Liu
189
Voted
HIPC
2007
Springer
16 years 1 months ago
No More Energy-Performance Trade-Off: A New Data Placement Strategy for RAID-Structured Storage Systems
Many real-world applications like Video-On-Demand (VOD) and Web servers require prompt responses to access requests. However, with an explosive increase of data volume and the emer...
Tao Xie 0004, Yao Sun
200
Voted
MIDDLEWARE
2007
Springer
16 years 1 months ago
Garbage Collecting the Grid: A Complete DGC for Activities
Abstract. Grids are becoming more and more dynamic, running parallel applications on large scale and heterogeneous resources. Explicitly stopping a whole distributed application is...
Denis Caromel, Guillaume Chazarain, Ludovic Henrio
169
Voted
HPDC
2006
IEEE
16 years 28 days ago
Peer to peer size estimation in large and dynamic networks: A comparative study
As the size of distributed systems keeps growing, the peer to peer communication paradigm has been identified as the key to scalability. Peer to peer overlay networks are charact...
Erwan Le Merrer, Anne-Marie Kermarrec, Laurent Mas...