|
ИСТИНА |
Войти в систему Регистрация |
ИСТИНА ПсковГУ |
||
Distance based prefetching algorithms for mining of the sporadic requests associationsстатья Исследовательская статья
- Авторы: Voevodkin Vadim, Sokolov Andrey
- Журнал: ArXiv e-prints
- Год издания: 2024
- Аннотация: Modern storage systems intensively utilize data prefetching algorithms while processing sequencesof the read requests. Performance of the prefetching algorithm (for instance increase of the cache hitratio of the cache system – CHR) directly affects overall performance characteristics of the storagesystem (read latency, IOPS, etc.).There are widely known prefetching algorithms that are focused on the discovery of the sequential patterns in the stream of requests. This study examines a family of prefetching algorithms thatis focused on mining of the pseudo random (sporadic) patterns between read requests – sporadicprefetching algorithms. The key contribution of this paper is that it discovers a new, lightweightfamily of distance-based sporadic prefetching algorithms (DBSP) that outperforms the best previously known results on MSR traces collection. Another important contribution of this paper is athorough description of the procedure for comparing the performance of sporadic prefetchers.
- Добавил в систему: Соколов Андрей Павлович