Sciweavers

268 search results - page 13 / 54
» Cost-Aware Caching Algorithms for Distributed Storage Server...
Sort
View
HPDC
2006
IEEE
15 years 5 months ago
Improving I/O Performance of Clustered Storage Systems by Adaptive Request Distribution
We develop an adaptive load distribution protocol for logical volume I/O workload in clustered storage systems. It exploits data redundancy among decentralized storage servers to ...
Changxun Wu, Randal C. Burns
ICS
2004
Tsinghua U.
15 years 5 months ago
Inter-reference gap distribution replacement: an improved replacement algorithm for set-associative caches
We propose a novel replacement algorithm, called InterReference Gap Distribution Replacement (IGDR), for setassociative secondary caches of processors. IGDR attaches a weight to e...
Masamichi Takagi, Kei Hiraki
WDAG
2005
Springer
88views Algorithms» more  WDAG 2005»
15 years 5 months ago
Optimal Resilience for Erasure-Coded Byzantine Distributed Storage
We analyze the problem of efficient distributed storage of information in a message-passing environment where both less than one third of the servers, as well as an arbitrary num...
Christian Cachin, Stefano Tessaro
98
Voted
PDPTA
2007
15 years 1 months ago
Improving Performance and Server Resource Usage with Page
As web engineering evolves web based applications complexity grows in higher orders of magnitude. Is not uncommon to find in today web based applications complex and time consumin...
León Welicki, Oscar Sanjuán Mart&iac...
SIAMCOMP
2012
13 years 2 months ago
Randomized Competitive Algorithms for Generalized Caching
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
Nikhil Bansal, Niv Buchbinder, Joseph Naor