Disk Prefetching Using Blocks' Association Rules

DOI

10.2991/jimec-17.2017.81How to use a DOI?

Keywords

Association rule; prefetching; Bloom filter.

Abstract

Modern applications, especially I/O-bound workload such as Online Transaction Processing(OLTP) often suffer from the performance gap between processor and I/O devices. Too much time is wasted waiting for the I/O operations. And there seems little evidence that the gap will stop widening in the near future. In this paper, a novel disk prefetching scheme is proposed. This prefetcher utilizes the blocks' association rules that are recognized as semantic information embedded in disk I/O traces. The experimental results show that the proposed scheme can satisfy the demand for real-time response to I/O stream and the I/O performance can be effectively increased.

Copyright

© 2017, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Minjie Sun
PY  - 2017/10
DA  - 2017/10
TI  - Disk Prefetching Using Blocks' Association Rules
BT  - Proceedings of the 2017 2nd Joint International Information Technology, Mechanical and Electronic Engineering Conference (JIMEC 2017)
PB  - Atlantis Press
SP  - 366
EP  - 371
SN  - 2352-538X
UR  - https://doi.org/10.2991/jimec-17.2017.81
DO  - 10.2991/jimec-17.2017.81
ID  - Sun2017/10
ER  -