Automatically Generating Symbolic Prefetches for Distributed Transactional Memories
Résumé
Developing efficient distributed applications while
managing complexity can be challenging. Managing network latency is a
key challenge for distributed applications. We propose a new approach to
prefetching, symbolic prefetching, that can prefetch remote objects
before their addresses are known. Our approach was designed to hide the
latency of accessing remote objects in distributed transactional memory
and a wide range of distributed object middleware frameworks. We present
a static compiler analysis for the automatic generation of symbolic
prefetches -- symbolic prefetches allow objects whose addresses are
unknown to be prefetched. We evaluate this prefetching mechanism in the
context of a middleware framework for distributed transactional memory.
Our evaluation includes microbenchmarks, scientific benchmarks, and
distributed benchmarks. Our results show that symbolic prefetching
combined with caching can eliminate an average of 87% of remote reads.
We measured speedups due to prefetching of up to 13.31× for accessing
arrays and 4.54× for accessing linked lists.
Domaines
Bibliothèque électronique [cs.DL]Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...