TY - GEN
T1 - Cache-miss-initiated prefetch in mobile environments
AU - Song, Hui
AU - Cao, Guohong
N1 - Funding Information:
We would like to thank the anonymous referees whose insightful comments helped us to improve the presentation of the paper. This work was supported in part by the National Science Foundation (CAREER CCR-0092770 and ITR-0219711).
PY - 2004
Y1 - 2004
N2 - Prefetching has been widely used to improve system performance in mobile environments. Since prefetching also consumes system resources such as bandwidth and power, it is important to consider the system overhead when designing a prefetching scheme. This paper proposes a cache-miss-initiated prefetch (CMIP) scheme to address this issue. The CMIP scheme relies on two prefetch sets: the always-prefetch set and the miss-prefetch set. The always-prefetch set consists of data that should always be prefetched if possible. The miss-prefetch set consists of data that are closely related to the cache-missed data item. When a cache miss happens, instead of sending an uplink request to ask for the cache-missed data item only, the client also requests for the data items which are within the miss-prefetch set. This reduces not only future cache misses but also the number of uplink requests. Note that the client can ask for several data items in one uplink request with little additional cost. We propose novel algorithms to mine the association rules and use them to construct the two prefetch sets. Simulation results show that our CMIP scheme can greatly improve the system performance in terms of improved cache hit ratio, reduced uplink requests, and negligible additional traffic.
AB - Prefetching has been widely used to improve system performance in mobile environments. Since prefetching also consumes system resources such as bandwidth and power, it is important to consider the system overhead when designing a prefetching scheme. This paper proposes a cache-miss-initiated prefetch (CMIP) scheme to address this issue. The CMIP scheme relies on two prefetch sets: the always-prefetch set and the miss-prefetch set. The always-prefetch set consists of data that should always be prefetched if possible. The miss-prefetch set consists of data that are closely related to the cache-missed data item. When a cache miss happens, instead of sending an uplink request to ask for the cache-missed data item only, the client also requests for the data items which are within the miss-prefetch set. This reduces not only future cache misses but also the number of uplink requests. Note that the client can ask for several data items in one uplink request with little additional cost. We propose novel algorithms to mine the association rules and use them to construct the two prefetch sets. Simulation results show that our CMIP scheme can greatly improve the system performance in terms of improved cache hit ratio, reduced uplink requests, and negligible additional traffic.
UR - http://www.scopus.com/inward/record.url?scp=2342538934&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=2342538934&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:2342538934
SN - 0769520707
SN - 9780769520704
T3 - Proceedings - 2004 IEEE International Conference on Mobile Data Management
SP - 370
EP - 381
BT - Proceedings - 2004 IEEE International Conference on Mobile Data Management (MDM 2004)
T2 - Proceedings - 2004 IEEE International Conference on Mobile Data Management, MDM 2004
Y2 - 19 January 2004 through 22 January 2004
ER -