I've reached that level of effort on the linpack benchmark. Lapack is hard to beat. But everytime we measure the efficiency of a parallel implementation, we should compare it against the best scalar implementation. Comparing against an unoptimized scalar version is like setting up a strawman. For large problems, those that can amortize the cost of the subroutine call, the optimized BLAS routines still have benefit.
Cache utilization can only happen when the distributed computation is local.
I had hoped that someone would have sent in some examples before I leave, so I could learn how to use these routines. No such luck. The program below sets up a distributed 128 by 128 array among 8 T3D PEs. I hope that from matching up the output with the commented program, a user might understand the flow. If you have discovered a good technique or information on the T3D and you think it might benefit others, then send it to the email address below and it will be passed on through this newsletter.