Sciweavers

207 search results - page 30 / 42
» An algorithm for stabilising multiple stores
Sort
View
CORR
2011
Springer
159views Education» more  CORR 2011»
13 years 2 months ago
Scalable constructions of fractional repetition codes in distributed storage systems
Abstract—In distributed storage systems built using commodity hardware, it is necessary to store multiple replicas of every data chunk in order to ensure system reliability. In s...
Joseph C. Koo, John T. Gill III
CMS
2011
229views Communications» more  CMS 2011»
12 years 7 months ago
Twin Clouds: Secure Cloud Computing with Low Latency - (Full Version)
Abstract. Cloud computing promises a cost effective enabling technology to outsource storage and massively parallel computations. However, existing approaches for provably secure ...
Sven Bugiel, Stefan Nürnberger, Ahmad-Reza Sa...
SIGMETRICS
2011
ACM
140views Hardware» more  SIGMETRICS 2011»
12 years 10 months ago
On the stability and optimality of universal swarms
Recent work on BitTorrent swarms has demonstrated that a bandwidth bottleneck at the seed can lead to the underutilization of the aggregate swarm capacity. Bandwidth underutilizat...
Xia Zhou, Stratis Ioannidis, Laurent Massouli&eacu...
MOBICOM
2006
ACM
14 years 1 months ago
Double rulings for information brokerage in sensor networks
We study the problem of information brokerage in sensor networks, where information consumers (sinks, users) search for data acquired by information producers (sources). Innetwork...
Rik Sarkar, Xianjin Zhu, Jie Gao
CGO
2005
IEEE
14 years 1 months ago
Compiler Managed Dynamic Instruction Placement in a Low-Power Code Cache
Modern embedded microprocessors use low power on-chip memories called scratch-pad memories to store frequently executed instructions and data. Unlike traditional caches, scratch-p...
Rajiv A. Ravindran, Pracheeti D. Nagarkar, Ganesh ...