Skip to Main content Skip to Navigation

An Efficient and Transparent Thread Migration Scheme in the PM2 Runtime System

Gabriel Antoniu 1 Luc Bougé 1 Raymond Namyst 1
1 REMAP - Regularity and massive parallel computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : This paper describes a new iso-address approach to the dynamic allocation of data in a multithreaded runtime system with thread migration capability. The system guarantees that the migrated threads and their associated static data are relocated exactly at the same virtual address on the destination nodes, so that no post-migration processing is needed to keep pointers valid. In the experiments reported, a thread can be migrated in less than 75 u- s.
Document type :
Complete list of metadatas
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 11:44:12 AM
Last modification on : Wednesday, December 11, 2019 - 1:54:06 PM
Document(s) archivé(s) le : Sunday, April 4, 2010 - 9:01:38 PM


  • HAL Id : inria-00073068, version 1



Gabriel Antoniu, Luc Bougé, Raymond Namyst. An Efficient and Transparent Thread Migration Scheme in the PM2 Runtime System. [Research Report] RR-3610, INRIA. 1999. ⟨inria-00073068⟩