SPREE: Object Prefetching for Mobile Computers

Kvilekval, Kristian; Singh, Ambuj K.

doi:10.1007/978-3-540-30469-2_33

Cited by 3 publications

(2 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Their approach supports runtime improvement of transaction lock scheduling. Kvilekval and Singh use shape analysis to dynamically hoard (prefetch) remote data for mobile clients [21]. Their work reduces the effect of disconnections in mobile computing environments.…”

Section: Related Workmentioning

confidence: 99%

Extracting queries by static analysis of transparent persistence

Wiedermann

Cook

2007

Proceedings of the 34th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

View full text Add to dashboard Cite

Transparent persistence promises to integrate programming languages and databases by allowing procedural programs to access persistent data with the same ease as non-persistent data. When the data is stored in a relational database, however, transparent persistence does not naturally leverage the performance benefits of relational query optimization. We present a program analysis that combines the benefits of both approaches by extracting database queries from programs with transparent access to persistent data. The analysis uses a sound abstract interpretation of the original program to approximate the data traversal paths in the program, and the conditions under which the paths are used. The resulting paths are then converted into a query, and the program is simplified by removing redundant tests. We study an imperative kernel language with readonly access to persistent data, and identify the conditions under which the transformations can be applied. This analysis approach promises to combine the software engineering benefits of transparent data persistence with the performance benefits of database query optimization.

show abstract

Section: Related Workmentioning

confidence: 99%

Extracting queries by static analysis of transparent persistence

Wiedermann

Cook

2007

Proceedings of the 34th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

View full text Add to dashboard Cite

show abstract

“…Their approach supports runtime improvement of transaction lock scheduling. Kvilekval and Singh use shape analysis to dynamically hoard (prefetch) remote data for mobile clients [24]. Their work reduces the effect of disconnections in mobile computing environments.…”

Section: Related Workmentioning

confidence: 99%

Extracting queries by static analysis of transparent persistence

Wiedermann

Cook

2007

SIGPLAN Not.

View full text Add to dashboard Cite

Transparent persistence promises to integrate programming languages and databases by allowing procedural programs to access persistent data with the same ease as non-persistent data. When the data is stored in a relational database, however, transparent persistence does not naturally leverage the performance benefits of relational query optimization. We present a program analysis that combines the benefits of both approaches by extracting database queries from programs with transparent access to persistent data. The analysis uses a sound abstract interpretation of the original program to approximate the data traversal paths in the program and the conditions under which the paths are used. The resulting paths are then converted into a query, and the program is simplified by removing redundant tests. We study an imperative kernel language with read-only access to persistent data and identify the conditions under which the transformations can be applied. This analysis approach promises to combine the software engineering benefits of transparent data persistence with the performance benefits of database query optimization.

show abstract

Categorized Cache Prefetching Policy in Mobile Environment

Ajankar¹,

Sane²

2012

Proceedings of the International Conference on Advances in Computer Science and Electronics Engineering

View full text Add to dashboard Cite

In mobile environment cache management is a challenging task; it attracts the interest of many researchers to work on this field. Caching and prefetching techniques improves the performances of the use of cache for mobile devices. One of the important problem is the efficient access to data. A proposed solution to this problem is the prefetching technique because of which user is able to access the data with low access latency and in case of disconnection or limited connectivity also. This paper deals with the study of cache prefetching policy and it's simulation and analysis. In order to do this, here present a client and server algorithm for prefetching scheme in mobile environment. It includes prefetching techniques based on user interest and a cache invalidation scheme which is used for freeing space from non-validate data. It reduces the latency for accessing data by the user and also reduces the number of data item in the client cache. As percentage of cache updation is reduced, performance of the device improved. We are demonstrating the feasibility of the proposed approach with experiments using simulation.

show abstract

SPREE: Object Prefetching for Mobile Computers

Cited by 3 publications

References 26 publications

Extracting queries by static analysis of transparent persistence

Extracting queries by static analysis of transparent persistence

Extracting queries by static analysis of transparent persistence

Categorized Cache Prefetching Policy in Mobile Environment

Contact Info

Product

Resources

About