Modeling and evaluation of prefetching policies for context-aware information services

Personè, Vittoria de Nitto; Grassi, Vincenzo; Morlupi, A

doi:10.1145/288235.288249

Cited by 23 publications

(3 citation statements)

References 16 publications

(9 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Prior theoretical work in prefetch algorithm modeling and analysis observes, as we do, the tension between improving data access performance and spending limited bandwidth and energy resources to achieve that end. Persone et al develop a prefetch cost model by which to numerically evaluate prefetch strategies based on mobility patterns [6]. However, their work considers different costs of prefetching in isolation from each other and from the benefit of prefetching.…”

Section: Prefetchingmentioning

confidence: 99%

Informed mobile prefetching

Higgins

Flinn

Giuli

et al. 2012

Proceedings of the 10th International Conference on Mobile Systems, Applications, and Services

113

View full text Add to dashboard Cite

Prefetching is a double-edged sword. It can hide the latency of data transfers over poor and intermittently connected wireless networks, but the costs of prefetching in terms of increased energy and cellular data usage are potentially substantial, particularly for data prefetched incorrectly. Weighing the costs and benefits of prefetching is complex, and consequently most mobile applications employ simple but sub-optimal strategies.Rather than leave the job to applications, we argue that the underlying mobile system should provide explicit prefetching support. Our prototype, IMP, presents a simple interface that hides the complexity of the prefetching decision. IMP uses a cost-benefit analysis to decide when to prefetch data. It employs goal-directed adaptation to try to minimize application response time while meeting budgets for battery lifetime and cellular data usage. IMP opportunistically uses available networks while ensuring that prefetches do not degrade network performance for foreground activity. It tracks hit rates for past prefetches and accounts for networkspecific costs in order to dynamically adapt its prefetching strategy to both the network conditions and the accuracy of application prefetch disclosures. Experiments with email and news reader applications show that IMP provides predictable usage of budgeted resources, while lowering application response time compared to the oblivious strategies used by current applications.

show abstract

Section: Prefetchingmentioning

confidence: 99%

Informed mobile prefetching

Higgins

Flinn

Giuli

et al. 2012

Proceedings of the 10th International Conference on Mobile Systems, Applications, and Services

113

View full text Add to dashboard Cite

show abstract

“…Issues on cache granularity, coherence strategy, and replacement policy of mobile caching were investigated in [3], [6], [18], [28] via simulation models. Xu et al [32] proposed an efficient gain-based cache replacement policy in which the influence of data size, data retrieval delay, access probability, and update frequency is considered together.…”

Section: Related Workmentioning

confidence: 99%

Design and performance studies of an adaptive cache retrieval scheme in a mobile computing environment

2005

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

In a mobile computing system, as users move to a new service area, the new server is usually considered to take over the execution of running programs for mobile users from the previous server so as to reduce the communication overhead of a mobile system. This procedure is referred to as service handoff. Note that when service handoff occurs, the new server will lose its advantage for cache access. To remedy this, we explore in this paper several cache retrieval schemes to improve the efficiency of cache retrieval. In particular, we analyze the impact of using a coordinator buffer to improve the overall performance of cache retrieval. Moreover, in light of the properties of transactions (i.e., temporal locality of data access among transactions), we devise a Dynamic and Adaptive cache Retrieval scheme (DAR) that can utilize proper cache methods according to some specific criteria to deal with the service handoff situation in a mobile computing environment. Performance of these cache retrieval schemes is analyzed and a system simulator is developed to validate our results. We devise a systematic procedure for determining the optimal operating points of DAR. Our experimental results show that by adaptively adopting the advantages of different cache retrieval methods, DAR significantly outperforms other schemes and is particularly effective for a mobile computing environment.

show abstract

“…So sind beispielsweise die betrachteten Benutzerprofile auf das Kartenszenario beschränkt. In [7] wird davon ausgegangen, daß Informationen bestimmten Gebieten zugeordnet werden können. Diese Arbeit bietet eine ausführliche Analyse des Potentials ortsbezogener Hoarding-Verfahren.…”

Section: Verwandte Arbeitenunclassified

Ein Hoarding-Verfahren für ortsbezogene Informationen

Kubach

Rothermel

2001

Informatik Forsch Entw

View full text Add to dashboard Cite

Zusammenfassung. Mit der zunehmenden Verbreitung mobiler Endgeräte wächst auch der Bedarf in mobilen Umgebungen auf entfernt gespeicherte Informationen zuzugreifen. Da dieser Informationszugriff meistüber drahtlose Netzwerke erfolgt, treten in mobilen Informationssystemen häufig Probleme wie geringe Bandbreite, große Verzögerungen oder Verbindungsausfälle auf. HoardingVerfahren versuchen diese Probleme zu lösen, indem sie Informationen, auf die der Benutzer voraussichtlich zugreifen wird, im vorausübertragen. Dazu müssen sie jedoch vorhersagen, welche Informationen der Benutzer benötigen wird. In diesem Beitrag stellen wir ein Hoarding-Verfahren vor, das für diese Vorhersage die Ortsabhängigkeit von Informationszugriffen ausnutzt. Wie wir durch Simulationen zeigen, wird der Speicherplatz auf dem Endgerät dadurch sehr effizient genutzt. 1 Abstract. With the increasing popularity of mobile computing devices, the need to access information in mobile environments also grows rapidly. Since the information has to be accessed over wireless networks, mobile information systems often have to deal with problems like low bandwidth, high delay, and frequent disconnections. Information hoarding is a method that tries to overcome these problems by transferring information which the user will probably need in advance. Thus a hoarding mechanism has to predict what information the user will need. The mechanism we describe in this paper exploits the location dependence of information accesses for this prediction. As our simulations show, the memory on the mobile device is used very efficiently thereby.

show abstract

Modeling and evaluation of prefetching policies for context-aware information services

Cited by 23 publications

References 16 publications

Informed mobile prefetching

Informed mobile prefetching

Design and performance studies of an adaptive cache retrieval scheme in a mobile computing environment

Ein Hoarding-Verfahren für ortsbezogene Informationen

Contact Info

Product

Resources

About