Sciweavers

196 search results - page 24 / 40
» Rebuilding for Array Codes in Distributed Storage Systems
Sort
View
ISPA
2005
Springer
14 years 1 months ago
Redundancy Schemes for High Availability in DHTs
High availability in peer-to-peer DHTs requires data redundancy. This paper takes user download behavior into account to evaluate redundancy schemes in data storage and share syste...
Fan Wu, Tongqing Qiu, YueQuan Chen, Guihai Chen
IPPS
1999
IEEE
14 years 4 days ago
Optimizing Irregular HPF Applications using Halos
This paper presents language features for High Performance Fortran HPF to specify non-local access patterns of distributed arrays, called halos, and to control the communication as...
Siegfried Benkner
JSAC
2010
113views more  JSAC 2010»
13 years 6 months ago
On counteracting Byzantine attacks in network coded peer-to-peer networks
Abstract—Random linear network coding can be used in peerto-peer networks to increase the efficiency of content distribution and distributed storage. However, these systems are ...
MinJi Kim, Luísa Lima, Fang Zhao, Joã...
ASAP
2005
IEEE
133views Hardware» more  ASAP 2005»
14 years 1 months ago
Speedups from Partitioning Critical Software Parts to Coarse-Grain Reconfigurable Hardware
In this paper, we propose a hardware/software partitioning method for improving applications’ performance in embedded systems. Critical software parts are accelerated on hardwar...
Michalis D. Galanis, Grigoris Dimitroulakos, Costa...
VEE
2005
ACM
199views Virtualization» more  VEE 2005»
14 years 1 months ago
Escape analysis in the context of dynamic compilation and deoptimization
In object-oriented programming languages, an object is said to escape the method or thread in which it was created if it can also be accessed by other methods or threads. Knowing ...
Thomas Kotzmann, Hanspeter Mössenböck