165 search results - page 13 / 33 » Performance Analysis of Disk Arrays under Failure |
ALGORITHMICA
2000
13 years 7 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
CF
2009
ACM
13 years 5 months ago
2009
ACM
Emulation sits between simulation and experimentation to complete the set of tools available for software designers to evaluate their software and predict behavior under condition...
SIGMETRICS
1997
ACM
13 years 11 months ago
1997
ACM
Informed prefetching and caching based on application disclosure of future I/O accesses (hints) can dramatically reduce the execution time of I/O-intensive applications. A recent ...
LATIN
1998
Springer
13 years 11 months ago
1998
Springer
We study the performance of packet routing on arrays (or meshes) with bounded buffers in the routing switches, assuming that new packets are continuously inserted at all the nodes....
EUROSYS
2007
ACM
14 years 4 months ago
2007
ACM
During concurrent I/O workloads, sequential access to one I/O stream can be interrupted by accesses to other streams in the system. Frequent switching between multiple sequential ...