HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Trade-offs between shared virtual memory and message-passing on an iPSC/2 hypercube

Thierry Priol 1 Zakaria Lahjomri 1
1 PAMPA - Models and Tools for Programming Distributed Parallel Architectures
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : This paper presents the results of an experiment which evaluates the performance of shared virtual memory running on a distributed memory parallel architecture (iPSC/2 hypercube). Two parallel versions of the modified Gram-Schmidt algorithm are presented. Each uses disparate distribution schemes : data distribution, and control distribution. In the first case, cooperation between processes is achieved by sending messages, whereas shared variables are applied in the second case. This latter technique is made possible by implementing a shared virtual memory as part of the operating system. We present briefly an example of such a mechanism, called Koan which has been designed specifically for the iPSC/2 hypercube. This shared virtual memory allows us to compare experimentally the performances of the two distribution schemes. Theoretical execution models are also addressed in order to extrapolate expected performance on a large number of processors.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 4:59:26 PM
Last modification on : Friday, February 4, 2022 - 3:18:39 AM
Long-term archiving on: : Tuesday, April 12, 2011 - 8:07:20 PM


  • HAL Id : inria-00074927, version 1


Thierry Priol, Zakaria Lahjomri. Trade-offs between shared virtual memory and message-passing on an iPSC/2 hypercube. [Research Report] RR-1634, INRIA. 1992. ⟨inria-00074927⟩



Record views


Files downloads