![]() |
![]() |
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
|
The NAS-SP code (sometimes referred to as APPSP or NPB-SP) is one of the NAS Parallel Benchmarks (NPB). The code uses an implicit algorithm to compute a finite difference solution to the 3D compressible Navier-Stokes equations. The solution is based on a Beam-Warming approximate factorization. The approximate factorization decouples the three dimensions. This leads to three sets of regularly structured systems of linear equations. The resulting equations are scalar penta-diagonal which are solved using the Thomas algorithm (Gaussian elimination) without pivoting of a banded system. The time taken to parallelize NAS-SP was notably faster than that of NAS-LU. Code information: 3500 lines of source and 25 subroutines Total Parallelization Time using ParaWise : Approximately 35 minutes. User Time: Approximately 10 minutes.
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||