Sciweavers

195 search results - page 5 / 39
» Cluster-based find and replace
Sort
View
IOR
2002
88views more  IOR 2002»
13 years 6 months ago
An Adaptive Bayesian Replacement Policy with Minimal Repair
In this study, an adaptive Bayesian decision model is developed to determine the optimal replacement age for the systems maintained according to a general age replacement policy. I...
Savas Dayanik, Ülkü Gürler
PDPTA
2004
13 years 8 months ago
Efficient Disk Replacement and Data Migration Algorithms for Large Disk Subsystems
Random data placement has recently emerged as an alternative to traditional data striping. From a performance perspective, it has been demonstrated to be an efficient and scalable...
Roger Zimmermann, Beomjoo Seo
ISCA
1994
IEEE
117views Hardware» more  ISCA 1994»
13 years 10 months ago
Evaluating Stream Buffers as a Secondary Cache Replacement
Today's commodity microprocessors require a low latency memory system to achieve high sustained performance. The conventional high-performance memory system provides fast dat...
Subbarao Palacharla, Richard E. Kessler
WDAG
2007
Springer
162views Algorithms» more  WDAG 2007»
14 years 21 days ago
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
Beat Gfeller, Nicola Santoro, Peter Widmayer
NETWORKING
2004
13 years 8 months ago
A Geometric Derivation of the Probability of Finding a Relay in Multi-rate Networks
Abstract. Relaying can improve performance of a wireless network, especially when different transmission modes with distance/cost tradeoffs are available. Examples of such modes in...
Laura Marie Feeney, Daniel Hollos, Martin Kubisch,...