%0 Conference Proceedings
%T Automatically Generating Symbolic Prefetches for Distributed Transactional Memories
%+ University of California
%A Dash, Alokika
%A Demsky, Brian
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B ACM/IFIP/USENIX 11th International Middleware Conference (MIDDLEWARE)
%C Bangalore, India
%Y Indranil Gupta; Cecilia Mascolo
%I Springer
%3 Middleware 2010
%V LNCS-6452
%P 355-375
%8 2010-11-29
%D 2010
%R 10.1007/978-3-642-16955-7_18
%Z Computer Science [cs]/Digital Libraries [cs.DL]Conference papers
%X 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.
%G English
%2 https://inria.hal.science/hal-01055276/document
%2 https://inria.hal.science/hal-01055276/file/middleware10.pdf
%L hal-01055276
%U https://inria.hal.science/hal-01055276
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-LNCS-6452
%~ IFIP-MIDDLEWARE
%~ IFIP-2010