6 September 2007 in International Journal of Parallel Programming
1 April 2002 in Parallel Algorithms and Applications
The performance of shared-memory (OpenMP) implementa- tions of three dierent PDE solver kernels representing finite dierence methods, finite volume methods, and spectral methods has been investi- gated. The experiments have been performed on a self-optimizing NUMA system, the Sun Orange prototype, using dierent data placement and thread scheduling strategies. The results show that correct data place- ment is very important for the performance for all solvers. However, the Orange system has a unique capababilty of automatically changing the data distribution at run time through both migration and replication of data. For reasonable large PDE problems, we find that the time to do this is negligible compared to the total solve time. Also, the performance after the migration and replication process has reached steady-state is the same as what is achieved if data is optimally placed at the begin- ning of the execution using hand tuning. This shows that, for the ap- plication studied, the self-optimizing features are successful, and shared memory code without explicit data distribution directives yields good performance.