Advanced highly vectorized heat transfer model

In order to take advantage of the potential speed-up in execution time available in supercomputers, vectorizable algorithms are necessary. This paper presents algorithm improvements for increasing the vector performance of a two-dimensional heat conduction code, and demonstrates the speed-ups resulting from each step. The method used to increase vectorization at each step is discussed, and execution times on vector and scalar machines at each stage are presented. These results demonstrate not only the potential for speed-up by utilizing a vectorizable algorithm, but also show the vast differences in execution time between vector and scalar machines, especially for highly vectorized coding. In addition, the results indicate that vectorizable algorithms also tend to run faster on scalar machines.