Performance is highly dependent on the compiler and on the nature of the code
-
Best performance is for data-parallel computations
-
Tie ³natural² parallelism in the problem to distributed array dimensions
|
Commercial compilers are now competitive with MPI for regular problems
-
Subscripts like A(L+1,K-1)
|
Research continues on irregular problems and task parallelism
-
Subscripts like A(INDX(I1,2))
-
Tree searches with branch-and-bound cutoffs
|