TY - JOUR
T1 - Adaptive power-aware prefetch in wireless networks
AU - Yin, Liangzhong
AU - Cao, Guohong
N1 - Funding Information:
Manuscript received August 21, 2002; revised January 4, 2003, May 2, 2003; accepted May 26, 2003. The editor coordinating the review of this paper and approving it for publication is S. Sarkar. This work was supported in part by the National Science Foundation under Grant CAREER CCR-0092770 and Grant ITR-0219711.
PY - 2004/9
Y1 - 2004/9
N2 - Most of the prefetch techniques used in the current cache management schemes do not consider power constraints of the mobile clients and other factors such as the size of the data items, the data access rate, and the data update rate. In this paper, we address these issues by proposing a power-aware prefetch scheme, called adaptive value-based prefetch (AVP) scheme. The AVP scheme defines a value function which can optimize the prefetch cost to achieve better performance. Also, AVP dynamically adjusts the number of prefetches to get better tradeoff between performance and power. As stretch is widely adopted as a performance metric for variable-size data requests, we show by analysis that the proposed approach can indeed achieve the optimal performance in terms of stretch when power consumption is considered. Simulation results demonstrate that our algorithm significantly outperforms existing prefetching algorithms under various scenarios.
AB - Most of the prefetch techniques used in the current cache management schemes do not consider power constraints of the mobile clients and other factors such as the size of the data items, the data access rate, and the data update rate. In this paper, we address these issues by proposing a power-aware prefetch scheme, called adaptive value-based prefetch (AVP) scheme. The AVP scheme defines a value function which can optimize the prefetch cost to achieve better performance. Also, AVP dynamically adjusts the number of prefetches to get better tradeoff between performance and power. As stretch is widely adopted as a performance metric for variable-size data requests, we show by analysis that the proposed approach can indeed achieve the optimal performance in terms of stretch when power consumption is considered. Simulation results demonstrate that our algorithm significantly outperforms existing prefetching algorithms under various scenarios.
UR - http://www.scopus.com/inward/record.url?scp=7544249235&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=7544249235&partnerID=8YFLogxK
U2 - 10.1109/TWC.2004.833430
DO - 10.1109/TWC.2004.833430
M3 - Article
AN - SCOPUS:7544249235
SN - 1536-1276
VL - 3
SP - 1648
EP - 1658
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
IS - 5
ER -