178 search results - page 13 / 36 » Bounds, Heuristics, and Approximations for Distribution Syst... |
ALENEX
2010
13 years 9 months ago
2010
Monitoring the performance of large shared computing systems such as the cloud computing infrastructure raises many challenging algorithmic problems. One common problem is to trac...
WDAG
2007
Springer
14 years 1 months ago
2007
Springer
We study replacement algorithms for non-uniform access caches that are used in distributed storage systems. Considering access latencies as major costs of data management in such a...
SIGMETRICS
2008
ACM
13 years 7 months ago
2008
ACM
Burstiness and temporal dependence in service processes are often found in multi-tier architectures and storage devices and must be captured accurately in capacity planning models...
APLAS
2007
ACM
13 years 11 months ago
2007
ACM
This paper studies types and probabilistic bisimulations for a timed -calculus as an effective tool for a compositional analysis of probabilistic distributed behaviour. The types c...
AUTOMATICA
2006
13 years 7 months ago
2006
It was shown by Zames and Shneydor and later by Mossaheb that a high-frequency dither signal of a quite arbitrary shape can be used to narrow the effective nonlinear sector of Lip...