Automatic Prefetching with Binary Code Rewriting in Object-Based DSMs

Abstract : Dynamic optimizers modify the binary code of programs at runtime by profiling and optimizing certain aspects of the execution. We present a completely software-based framework that dynamically optimizes programs for object-based Distributed Shared Memory (DSM) systems. In DSM systems, reducing the number of messages between nodes is crucial. Prefetching transfers data in advance from the storage node to the local node so that communication is minimized. Our framework uses a profiler and a dynamic binary rewriter that monitors the access behavior of the application and places prefetches where they are beneficial to speed up the application. In addition, we adapt the number of prefetches per request to best fit the application's behavior. Evaluation shows that the performance of our system is better than manual prefetching. The number of messages sent decreases by up to 89%. Performance gains of up to 73% can be observed on the benchmarks.
Type de document :
Communication dans un congrès
14th international Euro-Par conference on Parallel Processing, Aug 2008, Las Palmas de Gran Canaria, Spain. Springer-Verlag, pp.643 - 653, 2008, 〈10.1007/978-3-540-85451-7_69〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00504507
Contributeur : Philippe Clauss <>
Soumis le : mardi 20 juillet 2010 - 16:34:38
Dernière modification le : jeudi 11 janvier 2018 - 01:49:17

Identifiants

Collections

Citation

Jean Christophe Beyler, Michael Klemm, Michael Philippsen, Philippe Clauss. Automatic Prefetching with Binary Code Rewriting in Object-Based DSMs. 14th international Euro-Par conference on Parallel Processing, Aug 2008, Las Palmas de Gran Canaria, Spain. Springer-Verlag, pp.643 - 653, 2008, 〈10.1007/978-3-540-85451-7_69〉. 〈inria-00504507〉

Partager

Métriques

Consultations de la notice

31