Symbolic prefetching in transactional distributed shared memory

We present a static analysis for the automatic generation of symbolic prefetches in a transactional distributed shared memory. A symbolic prefetch specifies the first object to be prefetched followed by a list of field offsets or array indices that define a path through the heap. We also provide an object caching framework and language extensions to support our approach. To our knowledge, this is the first prefetching approach that can prefetch objects whose addresses have not been computed or predicted. Our approach makes aggressive use of both prefetching and caching of remote objects to hide network latency. It relies on the transaction commit mechanism to preserve the simple transactional consistency model that we present to the developer. We have evaluated this approach on several shared memory parallel benchmarks and a distributed gaming benchmark to observe speedups due to prefetching and caching.

• Type: Conference
• Year: 2010
• Where: PPOPP
• Authors: Alokika Dash, Brian Demsky
• Keywords: Memory Parallel Benchmarks, Object Caching Framework, Parallel Computing, PPOPP 2010, Simple Transactional Consistency